Patterns for Coding Interviews

General Discussion
1

I saw these links in a newsletter and thought people might be interested.

A friend recently asked me how I’d prepare for a technical interview with just a week’s notice. That’s simple-- I’d make sure to try to solve 1-2 problems a day, and focus the rest of my time really stress testing my knowledge of the below patterns. That’s because by knowing how to apply these techniques, nearly any coding interview problem can be cracked. They are:

  1. Two Pointers
  2. Recursion
  3. Use of a Hash Map
  4. Merge Intervals
  5. Two Heaps
  6. BFS/DFS
  7. Binary Search
  8. Sliding Windows
  9. K-Way Merge
  10. Permutations
  11. Union Find
3 Likes