Roadmap to Crack INR 4-10 LPA Jobs
By Syntax_Error
1. Core DSA Topics (Must-Know)
- Arrays & Strings
- Two-pointer technique, Sliding Window
- Prefix Sum, Kadanes Algorithm
- Sorting techniques (QuickSort, MergeSort)
- Recursion & Backtracking
- Basic recursion, Subset & Combination problems
- N-Queens, Sudoku Solver
- Backtracking optimizations
- Linked List
- Reverse a Linked List (Iterative & Recursive)
- Detect & remove cycle (Floyds Cycle Detection)
- Merge two sorted lists, Add two numbers
- Stacks & Queues
- Implementing Stack & Queue
- Monotonic Stack, Next Greater Element
- LRU Cache, Sliding Window Maximum
- Binary Search
- Classic problems (Search in Rotated Sorted Array, Peak Element)
- Binary Search on Answer (Min Days to Make Bouquets, Allocate Books)
- Hashing & Maps
- Frequency Counting, Two Sum
- Longest Consecutive Sequence
- Subarray Sum Equals K
- Trees (Binary Trees & BSTs)
- Preorder, Inorder, Postorder Traversal
- Lowest Common Ancestor, Diameter of a Tree
- BST operations, Convert Sorted Array to BST
- Graphs (Basic to Medium Level)
- BFS & DFS
- Dijkstras Algorithm, Floyd Warshall
- Topological Sorting (Kahns Algorithm)
- Dynamic Programming (Medium Level Required)
- 1D DP: Fibonacci, Climbing Stairs, Coin Change
- 2D DP: Knapsack, LCS, Matrix Chain Multiplication
- DP on Trees & Subsets
2. Competitive Coding Level (LeetCode / CodeForces)
- Solve 200-300 LeetCode (Easy to Medium)
- At least 50 Hard questions (important for top companies)
- Focus on contests, company-specific preparation
3. System Design & SQL (If applying for INR 8LPA+ roles)
- Low-Level Design (Classes, Objects, APIs)
- SQL Queries (Joins, Indexing, Optimization)
Final Roadmap to Crack INR 4-10 LPA Jobs
- LeetCode Top 150 Interview Questions
- DSA Sheets (Striver/Aman Dhattarwal)
- Mock Interviews (Practice under pressure)
- Resume Projects (At least 2 good ones)
