Stage 3 of 8 · 6 lessons · ~6 weeks
Recursion, sorting and searching
Learn to trust recursion, then use it to understand the classic sorts and binary search. Divide and conquer starts here and comes back in trees, graphs, backtracking and dynamic programming.
6 more stages, 40 more topics, free with an account.
You have seen the open stages of the DSA and problem solving roadmap. Every topic it covers is listed above, and an account opens the rest: what each topic means, a question to check yourself, the courses, the practice and Tauseef's advice for every stage. Early access is open: sign up and your account is active shortly after.
Everything here is free to learn from. A few things, like adding a roadmap, keeping a cheat sheet or asking Tauseef a question, use credits. You get 15 when you join, your first roadmap is free, and if you are learning seriously and run out, you can ask for more. Credits only make sure the platform goes to people who are actually learning.