Don’t Just LeetCode; Follow the Coding Patterns Instead
Coding Interviews are getting harder to pass. To prepare for coding interviews, you will need weeks, if not months of preparation.
No one really likes spending that much time preparing for the coding interviews. So is there a smarter solution?
First, let’s look at the problem.
Anyone preparing for coding interviews definitely knows LeetCode. It is probably the biggest online repository for coding interview questions. Let’s take a look at what problems people face when using LeetCode.
Problems with LeetCode
There are more than 2k problems in LeetCode. The biggest challenge with LeetCode is its lack of organization; it has a huge set of coding problems, and one isn’t sure where to start or what to focus on.
One wonders, is there an adequate number of questions one should go through to consider themselves prepared for the coding interview?
I would love to see a streamlined process that guides me and teaches me enough algorithmic techniques to feel confident for the interview. As a lazy person myself, I wouldn’t like to go through 500+ questions.
One technique that people often follow is to solve questions related to the same data structure; for example, focusing on questions related to Arrays, then LinkedList, HashMap, Heap, Tree, or Trie, etc. Although this does provide some organization, it still lacks coherence. For example, many questions can be solved using HashMaps but still require different algorithmic techniques.
I would love to see question sets that follow not only the same data structure but also similar algorithmic techniques.
The best thing I came across was the problem-solving patterns like Sliding Window, Fast and Slow Pointers, Topological Sort, etc. Following these patterns helped me nurture my ability to ‘map a new problem to an already known problem’. This not only made this whole coding-interview-preparation process fun but also a lot more organized.
Coding patterns enhance our “ability to map a new problem to an already known problem.” For a list of coding patterns, check Grokking the Coding Interview.
I have gathered around 20 of these coding problem patterns that I believe can help anyone learn these beautiful algorithmic techniques and make a real difference in the coding interviews.
The idea behind these patterns is that once you’re familiar with a pattern, you’ll be able to solve dozens of problems with it. For a detailed discussion of these patterns and related problems with solutions, take a look at Grokking the Coding Interview.
So, without further ado, let me list all these patterns:
- Sliding Window
- Islands (Matrix Traversal)
- Two Pointers
- Fast & Slow Pointers
- Merge Intervals
- Cyclic Sort
- In-place Reversal of a LinkedList
- Tree Breadth-First Search
- Tree Depth First Search
- Two Heaps
- Modified Binary Search
- Bitwise XOR
- Top ‘K’ Elements
- K-way Merge
- Topological Sort
- 0/1 Knapsack
- Fibonacci Numbers
- Palindromic Subsequence
- Longest Common Substring
Following is a small intro of each of these patterns with sample problems:
Like it or not, LeetCode-type questions are part of almost every programming interview, so every software developer should practice them before an interview. Their only option is to prepare smartly and learn problem-solving by focusing on the underlying problem patterns.
Learn more about these patterns and sample problems in Grokking the Coding Interview and Grokking Dynamic Programming for Coding Interviews.
Here are some interesting readings on Coding and System Design interviews: