Learning problem-solving through Coding Patterns was the best thing that happened to me when preparing for interviews.
These patterns taught me how to solve unknown or unseen problems.
And helped me develop the ability to map a new problem to an already known problem.
That’s the best thing I could suggest to anyone.
Learn the basics of a pattern and then practice mapping problems to it.
Practice at least a dozen of problems for each pattern.
Check “Grokking the Coding Interview.” It has 325 lessons covering all the essential coding patterns.
Ref:
➡ 𝗚𝗿𝗼𝗸𝗸𝗶𝗻𝗴 𝘁𝗵𝗲 𝗖𝗼𝗱𝗶𝗻𝗴 𝗜𝗻𝘁𝗲𝗿𝘃𝗶𝗲𝘄: https://lnkd.in/g6ApdjVW
➡ 𝗚𝗿𝗼𝗸𝗸𝗶𝗻𝗴 𝗗𝘆𝗻𝗮𝗺𝗶𝗰 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴 𝗣𝗮𝘁𝘁𝗲𝗿𝗻𝘀 𝗳𝗼𝗿 𝗖𝗼𝗱𝗶𝗻𝗴 𝗜𝗻𝘁𝗲𝗿𝘃𝗶𝗲𝘄𝘀: https://lnkd.in/gyB7Anr5
Here are the 23 coding patterns:
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. 0/1 Knapsack
17. Unbounded Knapsack
18. Fibonacci Numbers
19. Palindromic Subsequence
20. Longest Common Substring
21. Topological Sort
22. Backtracking
23. Multi-threaded
➡ 𝗚𝗿𝗼𝗸𝗸𝗶𝗻𝗴 𝘁𝗵𝗲 𝗖𝗼𝗱𝗶𝗻𝗴 𝗜𝗻𝘁𝗲𝗿𝘃𝗶𝗲𝘄: https://lnkd.in/g6ApdjVW
➡ 𝗚𝗿𝗼𝗸𝗸𝗶𝗻𝗴 𝗗𝘆𝗻𝗮𝗺𝗶𝗰 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴 𝗣𝗮𝘁𝘁𝗲𝗿𝗻𝘀 𝗳𝗼𝗿 𝗖𝗼𝗱𝗶𝗻𝗴 𝗜𝗻𝘁𝗲𝗿𝘃𝗶𝗲𝘄𝘀: https://lnkd.in/gyB7Anr5