On this page 8 sections
Short answer: Learn DSA in this order: Big-O → arrays and strings → hash maps → two pointers and sliding window → stacks and queues → linked lists → recursion → trees → graphs → heaps → dynamic programming. Learn each topic, solve 10 to 20 problems on it, and focus on recognising patterns rather than memorising solutions.
DSA scares a lot of students. It shouldn’t. It’s a set of patterns you learn one at a time.
Why DSA matters
- Most software company interviews include coding problems
- It helps you write code that stays fast as data grows
- It trains clear problem-solving, which helps everywhere
Step 0: Pick one language
Use the language you know best. Python is concise for interviews; Java and C++ are common in university courses. Don’t switch mid-way.
The roadmap
| Order | Topic | Key ideas |
|---|---|---|
| 1 | Big-O complexity | Time and space, O(1), O(n), O(log n), O(n²) |
| 2 | Arrays and strings | Indexing, iteration, prefix sums |
| 3 | Hash maps and sets | Counting, lookups, duplicates |
| 4 | Two pointers, sliding window | Subarrays, pairs, substrings |
| 5 | Stacks and queues | Brackets, monotonic stack, BFS |
| 6 | Linked lists | Reversal, fast and slow pointers |
| 7 | Recursion and backtracking | Subsets, permutations |
| 8 | Binary search | On arrays and on answers |
| 9 | Trees and BSTs | DFS, BFS, traversals |
| 10 | Heaps | Top-K, scheduling |
| 11 | Graphs | BFS, DFS, shortest paths, topological sort |
| 12 | Dynamic programming | Memoization, tabulation, classic patterns |
How to practise
- Learn the concept from one good resource
- Solve easy problems on that topic until they feel natural
- Move to medium problems
- Stuck for 30 to 40 minutes? Read the hint or solution, understand it, then solve it again yourself the next day
- Write the pattern in your own notes
- Review old problems weekly
Quality beats quantity. 150 well-understood problems beat 600 copied ones.
Interview tips
- Say your approach out loud before coding
- Start with a brute-force solution, then improve it
- Test with small examples and edge cases (empty input, one item, duplicates)
- State the time and space complexity
How long does it take?
With an hour a day, most people get interview-ready for junior roles in three to five months.
Don’t forget real projects
DSA gets you through interviews; projects get you the interview. Balance both. See how to become a software engineer in Pakistan and the developer resume guide.
Frequently asked questions
Which language is best for DSA?
The one you know best. Python is the most concise; C++ and Java are popular in competitive programming and university courses.
Is LeetCode enough for DSA?
It’s great for practice. Pair it with a structured course or book to learn concepts properly.
Do web developers need DSA?
For interviews at many companies, yes. For day-to-day web work, the basics (arrays, maps, complexity) matter most.
Can I learn DSA without strong maths?
Yes. Most interview DSA needs logic and practice, not advanced maths.
Written by Syed Imran Murtaza
Freelance software engineer and web developer in Karachi, Pakistan (also known as CtrlAltImran). I build websites, web apps, custom WordPress plugins and AI tools for clients worldwide. About me · Hire me · My work