๐ฎ๐ฌ ๐๐ผ๐ฑ๐ถ๐ป๐ด ๐ฃ๐ฎ๐๐๐ฒ๐ฟ๐ป๐ ๐๐ผ ๐ ๐ฎ๐๐๐ฒ๐ฟ ๐ ๐๐๐ก๐ ๐๐ป๐๐ฒ๐ฟ๐๐ถ๐ฒ๐๐
Coding patterns enhance our โability to map a new problem to an already known problem.โ
๐ญ๐ฐ ๐ ๐ผ๐๐ ๐ฃ๐ผ๐ฝ๐๐น๐ฎ๐ฟ ๐๐บ๐ฎ๐๐ผ๐ป ๐๐ผ๐ฑ๐ถ๐ป๐ด ๐๐ป๐๐ฒ๐ฟ๐๐ถ๐ฒ๐ ๐ค๐๐ฒ๐๐๐ถ๐ผ๐ป๐:
Reference:
โก ๐๐ฟ๐ผ๐ธ๐ธ๐ถ๐ป๐ด ๐๐ต๐ฒ ๐๐ผ๐ฑ๐ถ๐ป๐ด ๐๐ป๐๐ฒ๐ฟ๐๐ถ๐ฒ๐: Grokking the Coding Interview | The #1 Course
โก ๐๐ฟ๐ผ๐ธ๐ธ๐ถ๐ป๐ด ๐๐๐ป๐ฎ๐บ๐ถ๐ฐ ๐ฃ๐ฟ๐ผ๐ด๐ฟ๐ฎ๐บ๐บ๐ถ๐ป๐ด ๐ฃ๐ฎ๐๐๐ฒ๐ฟ๐ป๐ ๐ณ๐ผ๐ฟ ๐๐ผ๐ฑ๐ถ๐ป๐ด ๐๐ป๐๐ฒ๐ฟ๐๐ถ๐ฒ๐๐: Grokking Dynamic Programming
๐๐๐ง๐ ๐๐ง๐ ๐ฉ๐๐ 20 ๐๐ค๐๐๐ฃ๐ ๐ฅ๐๐ฉ๐ฉ๐๐ง๐ฃ๐จ:
1. Sliding Window
2. Islands (Matrix Traversal)
3. Two Pointers
4. Fast & Slow Pointers
5. Merge Intervals
6. Cyclic Sort
7. In-place Reversal of a LinkedList
8. Tree Breadth-First Search
9. Tree Depth First Search
10. Two Heaps
11. Subsets
12. Modified Binary Search
13. Bitwise XOR
14. Top โKโ Elements
15. K-way Merge
16. Topological Sort
17. Unbounded Knapsack
18. Fibonacci Numbers
19. Palindromic Subsequence
20. Longest Common Substring