DSA, CP and Career Guidance Swapnil Narayan Software Engineer at Microsoft Got offers from Amazon and Oracle Facebook HackerCup Quarter-Finalist T O P I C
Hey there, I’m Swapnil Narayan, a graduate from IIT(ISM) Dhanbad with Computer Science majors. I’m a Software Engineer at Microsoft India, and have also got offers from Amazon and Oracle for Software Engineering roles. I’m a very passionate Competitive Programming Instructor and have a decent experience for the same at various popular edtech platforms, and have taken sessions with IITs, NITs, and other engineering colleges . I will be your mentor for this session and will walk you through the topics the following slides. About the Instructor
In this Session, I will be delivering all possible guidance for DSA and Competitive Programming and will make sure for you to inculcate and master them with ease. We will be discussing ideas on the best preparation strategy for your upcoming interviews and our major objective will be to develop your coding skills. Curious how we gonna do that? Let’s dive into the world of Algorithms. About the Instructor
Types Internship Placement Opportunity On - Campus Off - Campus
Online Assessment Round or Coding Round. Technical Interview Round. HR Round. Types of Rounds
60 mins or 90 mins Online Test. MCQs Data Structures and Algorithms. Mathematics and Aptitude. Core CS subjects. 2 or 3 Coding Problems. Online Assessment Round
Resume based questions. DSA and Competitive Programming. Puzzles and Maths Questions. Core CS Subjects. Projects and Internships. Technical Interview Rounds
DSA for Interviews (Some Must Do Concepts) Technical Interview Rounds
Factorial. Prime Numbers. Sieve. XOR concept. Binary Exponentiation. Maths
Two Pointers Approach. Sliding Window. Kadane’s Algorithm Binary Search. Merge Sort. Quick Sort. Inversion Concept. Arrays, Searching and Sorting
Implement all the operations of Linked List, Stack and Queue. Implement Stack using Queue and vice versa. Detect and Remove Loop in Linked List. Next Greater Element and similar concept. Implement LRU Cache. Linked Lists, Stack and Queue
Binary Tree and Binary Search Tree. Traversals, and Views of Tree. Breadth First Search and Depth First Search. Graph Algorithms Dijkstra Bellman Ford Floyd Warshall Implement insert and search in Trie (Avoid Deletion) Trees, Graphs and Trie
String Manipulations. Longest Common Prefix. String Matching Algorithms. Rabin Karp. KMP Algorithm. Z Algorithm. Trie for Strings. Strings
Standard Greedy Problems like Activity Selection, Job Sequencing etc. Standard DP Problems like LIS, LCS, Knapsack, Coin Change, Edit Distance etc. Practice easy problems on DP. Greedy Algorithm and DP
Heaps Kth Largest/Smallest. Hashing Bit Manipulations Backtracking Nqueens Rat in the Maze Miscellaneous
Arrays, Searching and Sorting Core Subjects OS DBMS CN OOPS
Why learn DSA?
Contests and Competitive Programming Arrays, Searching and Sorting
Writing Programs to Solve Problems in a contest environment. One has limited time to solve problem, ranging from few hours to few days. Team Participation or Individual. What is It?
Algorithms Skills (Must!) Basic Maths and Aptitude Skills. Programming Skills. Speed (Both thinking and typing) Creativity. Debugging Skills. What do these test?
ACM ICPC Facebook Hacker Cup Google Code Jam Google Kickstart Topcoder Open Some Prestigious Contests
Skillyst by foundit Codeforces (Highly Recommended) Where to Practice?
PRACTICE, PRACTICE and PRACTICE! Tips for Best Performance
Skillyst Courses by the Experts. Code Studio Discussions LeetCode Discussions Codeforces Blogs. CP Algorithms Website Best Resources
Zuno UI / UX contest
Thank you for attending the session! Lets connect over LinkedIn and share success stories Liked it?