Part-(1/4)
Mastering of DSA are always sought by big product-based companies because it ensures good handling of their data and provides a good measure of a candidate’s problem-solving skills.
If you will follow this roadmap, then your preparation will be organized. Here are Topics and most imp problems from listed sub-topics
Very Very IMP Topics
Arrays & Strings
- Basic Array And Strings Questions
- Kadane’s Algorithm
- Dutch National Flag Algorithm
Multidimensional Arrays
- Rotation based problems.
- Traversal Based Problems
Sorting Algorithms & Searching
- Insertion Sort
- Selection Sort.
- Binary Search on Arrays and matrices
Linked Lists
- Reversal Problems
- Sorting Problems.
- Slow And Fast Pointers
- Modify In Linked list
Stacks and Queues
- Implementation Problems
- Application Problems.
Binary Trees
- Construction Of BST
- Conversion Based Problems
- Modification in BST
- Standard Problems
Recursion and Backtracking
- Basic Recursion Questions
- Divide And Conquer
Priority Queues and Heaps
- Implementation Based problems
- Conversion based problems
- K Based Problems
Graphs
- Graph Traversals – BFS And DFS
- MST
- Shortest Path Algorithms
- Topological Sort
- Graphs in Matrix
Dynamic Programming
on study material, daily ques, company wise Leetcode problems.
- DP with Arrays
- DP With Strings
- DP With Maths
- DP With Trees
- Breaking And Partition Based Problems
- Counting Based Problems
After completing them, do these!!
- Hashmaps
- Tries
- Bit Manipulation
- Greedy
- Circular Queues
- String Algorithms like KMP and Z Algorithm
- Number Theory
Stay tuned for the next post-
💖 from sakshamceo
Top comments (0)