DSA
Arrays, strings, linked lists, trees, graphs, recursion, dynamic programming and complexity analysis: the topics behind almost every product-company and service-company coding round.
What you are tested on
- Arrays, strings and hashing
- Linked lists, stacks and queues
- Trees, graphs and BFS/DFS
- Recursion, backtracking and dynamic programming
- Time and space complexity
Practice problems (109 in total)
- Two SumEasy
- Longest Substring Without Repeating CharactersMedium
- Merge IntervalsMedium
- Valid ParenthesesEasy
- Best Time to Buy and Sell StockEasy
- Binary SearchEasy
- Maximum SubarrayMedium
- Product of Array Except SelfMedium
- Top K Frequent ElementsMedium
- Number of IslandsMedium
- Coin ChangeMedium
- Longest Increasing SubsequenceMedium
Roadmaps
DSA Roadmap for Placements
The structured order most placement prep guides converge on: build the fundamentals before jumping into interview-style problems, not the other way around.
C and C++ Roadmap
Low-level control and speed: pointers, memory, the STL and modern C++ for competitive coding and systems roles.
Software Engineer (SDE) Job Preparation: 6-Month Plan
A realistic plan to go from a fresh CSE degree to clearing service-company and product-company hiring rounds.
How your DSA rating works
You start at 1200. Each timed, rated test moves your DSA rating up or down, the way chess ratings move. Recruiters see the number and the band (Beginner, Intermediate, Advanced or Expert), so they can judge your skill before reading a résumé. See a sample profile.
Questions about DSA
How should a fresher start DSA?
Pick one language, learn arrays and strings first, then move to linked lists, stacks, trees and graphs. Solve easy problems daily, then take a rated test to see where you stand.
Which DSA topics are asked most in campus drives?
Arrays, strings, sorting and searching, hashing, linked lists, trees and basic dynamic programming appear most often in written and online coding rounds.