Back to mind mapsDSA and Coding Interview
DSA and Coding Interview
Overview
Basics ladder
Week 1: Arrays, strings, two pointers, sliding window
Day 1: Arrays, traversal, two pointers
Day 2: Prefix sum and in place manipulation
Day 3: Sliding window, fixed and variable
Day 4: Two pointers and containers
Day 5: Sliding window with frequency maps
Day 6: Prefix and difference arrays
Day 7: Week 1 review
Week 2: Hash tables, stacks, queues, linked lists, binary search
Day 8: Hash tables, sets and maps
Day 9: Stacks and monotonic stacks
Day 10: Queues and deques
Day 11: Linked lists and fast slow pointers
Day 12: Linked lists with the dummy node
Day 13: Binary search
Day 14: Week 2 review
Week 3: Trees, tries, recursion, backtracking
Day 15: Binary trees and DFS
Day 16: Tree path problems and diameter
Day 17: Binary search trees
Day 18: Level order BFS
Day 19: Tries
Day 20: Recursion and backtracking
Day 21: Week 3 review
Week 4: Graphs, dynamic programming, heaps, greedy
Day 22: Graphs, BFS and DFS
Day 23: Graph shortest path and bipartite
Day 24: One dimensional dynamic programming
Day 25: Two dimensional dynamic programming
Day 26: Heaps and priority queues
Day 27: Greedy
Week 5: Advanced topics and final review
Day 28: Advanced graphs
Day 29: Bit manipulation and miscellaneous
Day 30: Grand review and mock
Advanced ladder
Plan summary
Just in time learning rules
Resource master reference
Interview focus
Press enter or space to select a node. You can then use the arrow keys to move the node around. Press delete to remove it and escape to cancel.
Press enter or space to select an edge. You can then press delete to remove it or escape to cancel.