| A | B | C | D | E | F | G | H | I | J | K | L | M | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1 | To edit go to - File -> Make a copy and use your copy for tracking (Once you've completed a level, mark it with an X) | Watch my explainer video for more context | |||||||||||
2 | |||||||||||||
3 | by @ericjduran | Practice Questions - Feel free to edit as needed for your use case. | |||||||||||
4 | Topics | Study a book Chapter on it | Watch a Lecture on it | Level 1 (1 - 5 Questions) | Level 2 ( 5 - 15 Questions) | Level 3 (15 - 30 Questions) | Level 4 (30+ Questions) | Level 5 (Expert on the subject) | Do I know all common questions? | Can I code it cold? (aka first thing in the morning) | Do I know the Gotchas? (Ex. Limits, Out of Bounds) | Can I answer Hard Questions | Mock Interview |
5 | Big O (wiki) | Not Yet | Not Yet | ||||||||||
6 | Strings | Not Yet | Not Yet | ||||||||||
7 | Arrays | Not Yet | Not Yet | ||||||||||
8 | Linked List | Not Yet | Not Yet | ||||||||||
9 | Stack | Not Yet | Not Yet | ||||||||||
10 | Queues | Not Yet | Not Yet | ||||||||||
11 | Hashtables / Maps | Not Yet | Not Yet | ||||||||||
12 | Trees | Not Yet | Not Yet | ||||||||||
13 | Binary Trees | Not Yet | Not Yet | ||||||||||
14 | Binary Search Trees | Not Yet | Not Yet | ||||||||||
15 | Trie | Not Yet | Not Yet | ||||||||||
16 | B-Tree | Not Yet | Not Yet | ||||||||||
17 | Tree Traversal | Not Yet | Not Yet | ||||||||||
18 | BFS - In, Pre, Post | Not Yet | Not Yet | ||||||||||
19 | DFS - In, Pre, Post | Not Yet | Not Yet | ||||||||||
20 | Heaps | Not Yet | Not Yet | ||||||||||
21 | Priority Queues | Not Yet | Not Yet | ||||||||||
22 | Min Heap | Not Yet | Not Yet | ||||||||||
23 | Max Heap | Not Yet | Not Yet | ||||||||||
24 | Heap Sort | Not Yet | Not Yet | ||||||||||
25 | Graphs | Not Yet | Not Yet | ||||||||||
26 | Matrix | Not Yet | Not Yet | ||||||||||
27 | Adjencry List | Not Yet | Not Yet | ||||||||||
28 | Object + Pointers | Not Yet | Not Yet | ||||||||||
29 | Traversal | Not Yet | Not Yet | ||||||||||
30 | Dynamic Programming | Not Yet | Not Yet | ||||||||||
31 | Recursion | Not Yet | Not Yet | ||||||||||
32 | Good to Know Algos/Problems | Not Yet | Not Yet | ||||||||||
33 | Sorting / Merge Sort | Not Yet | Not Yet | ||||||||||
34 | Searching | Not Yet | Not Yet | ||||||||||
| A | |
|---|---|
1 | Top Resources |
2 | Instagram video on how to use this sheet - Tips on how to go about learning the material |
3 | Basecs Podcast |
4 | Cracking the Coding Interview Book |
5 | |
6 | |
7 | Other Resources |
8 | The Algorithm Design Manual (Book) |
9 | Introduction to Algorithms (Book) |
10 | MIT: Introduction to Algorithms (Course) |