Learning Path
The fastest route from no technical experience to a full-stack, frontend or backend engineering role. It interleaves what the job needs with what the interview needs, in the order to learn them.
Roadmap 1 of 6
Coding Interviews
Start here. You begin your software engineering journey by cracking the coding interview, because practising leetcode teaches you basic programming and data structures and algorithms at the same time.
- Stage 1
Python and data structures & algorithms
Your first programming language, and the one you will use in coding interviews. Use Python for DSA and nothing else: it is the simplest to learn and the fastest to write, and in an interview, speed matters.
Set up Python
- 1
Install Python
link - 2
Run your first script
link - 3
Both, on video
link
Learn Python and DSA
Pick one route. Both cover the same ground.
PaidNeetCode courses
Take these courses in order
link- 1
Python for Beginners
- 2
Big O Notation
- 3
Python for Coding Interviews
- 4
Python OOP
- 5
Algorithms and Data Structures for Beginners
or
FreeFree resources
Beginner Python
Pick one format.
VideoOne long video
Watch it start to finish
Beginner Python
link
or
ReadingTopic by topic
Read in this order
- 1
Printing text
link - 2
Variables and types
link - 3
Variable assignment and scope
link - 4
Variable scope and the global keyword
link - 5
The nonlocal keyword
link - 6
Math
link - 7
Boolean logic
link - 8
Functions
linklink - 9
Conditional logic
linklink - 10
Loops
forwhilerangelink - 11
Strings
linklinklink - 12
Lists
linklinklinktuples - 13
Sets
linklink - 14
Dictionaries
linklink - 15
Exceptions
linklink
Big-O notation
Before any data structures and algorithms, learn Big-O notation for runtime and space complexity. It is at the core of every coding interview, and the rest makes little sense without it.
Big-O notation
link
Python for DSA
Leetcode-specific language features, then the data structures and algorithms you will use to solve problems.
Before a question asks you to traverse a binary tree, learn how the tree works and how it is built. Also, learning the raw algorithms first makes applying them far easier.
- 1
Pass-by
linklink - 2
Sorting
linklinkO(n), also covers Big-O - 3
Unpacking
link - 4
Loop unpacking and enumerate
link - 5
zip
link - 6
List initialization
link - 7
List comprehensions
link - 8
List concat and repeating
link - 9
List copying
link - 10
Static and dynamic arrays, and strings
linkO(n), also covers Big-O - 11
Stacks and queues
linkO(n), also covers Big-O - 12
Hashmaps and hashsets
linkO(n), also covers Big-O - 13
Heaps and priority queues
linkO(n), also covers Big-O - 14
Linked lists
linkO(n), also covers Big-O - 15
Recursion
linkO(n), also covers Big-O - 16
Binary search
linkO(n), also covers Big-O - 17
Trees
linkO(n), also covers Big-O - 18
Graphs
linkO(n), also covers Big-O - 19
Backtracking
linkO(n), also covers Big-O - 20
Dynamic programming
linkO(n), also covers Big-O
- 1
- Stage 2
Mastering SWE Python module
What you just learned is extremely useful. The problem is remembering it. Organic leetcode practice only takes you so far, and you can’t afford to forget anything when you never know what you’ll be asked.
Practise this deck as you study, and you’ll remember everything you need for good.
Python deck
- Stage 3
Leetcode 150
Getting good at leetcode takes repetition. The first pass through the 150 is a struggle. On the next, some questions that beat you before come easily, while the hardest still don’t. Take a break, try them all again, and over time the problems that once made you quiver become easy.
Coming soonMastering SWE leetcode module
Track your problems with spaced repetition. After you do a question, rate it like any other card, and it comes back when attempting it again helps most. When a problem shows up for review, do it.
The 150 roadmap
Go through the topics in order, and within each topic do the questions from easiest to hardest.
link- +
Also: Prefix sum
Not on the NeetCode roadmap, so add it to your practice yourself.
Working a problem
Step 1: 25 min
Attempt it on your own
Step 2: Stuck?
Watch NeetCode’s video explanation
Step 3: 15 min
Implement the solution from the explanation
Step 4: Still stuck?
Read the code solution, then write it yourself
Don’t spend more than 25 minutes on your own. Going longer on a wrong approach teaches bad habits, and some problems need an approach you won’t find alone.
Master the 150 before the 250
You should be able to pick any of the 150 at random and solve it easily. New problems would still teach you something, but the 150 already cover every pattern. Once you’ve mastered them, move on to the 250.
- +
See the full roadmap free
Every step and every resource, with just the free plan.
Create a free accountAlready have one? Sign in