Published on

5 Coding Problems You Should Know by Heart

Authors
  • avatar
    Name
    Ronald Luo, MSc
    Twitter

Five Questions to Memorize Before Your Next Technical Interview

  1. Two Sum

Is there a data structure with a fast look up time that we can use to speed up our solution?

  1. Reverse Linked List

Linked lists are a vital component of every computer science education. Using a one-pass two pointer technique, how can we turn our linked list around?

  1. Invert Binary Tree

Binary trees are similar to linked lists, if you consider the idea that at every node, you can take two paths instead of one. Let's see if we can use recursion to flip the leaves of the tree around.

  1. Binary Search

Higher or lower? When you're given a sorted array and asked to find a target, how can you find it faster than O(N)?

  1. Best Time to Buy and Sell Stock

Is there a way to find the optimal trades without looking at all possibilities?

💻  Continue practicing from the best (free) resources out there

  1. Check out Coding Interview University for a comprehensive education on data structures and algorithms.
  2. Check out Pitt CS's LeetCode study plan to get you on track in ~12 weeks.
  3. Check out Jeremy Aguilon's blog where he ranks questions by cram score.
  4. Check out Neetcode.io, video explanations from a Google software engineer.

👋  Thanks for making it to the end!

  1. Click here to read more about Deep Work
  2. Click here to check out other articles!
  3. Click here to check out my GitHub!
Discuss on Twitter • View on GitHub