60 LeetCode problems to solve for coding interview

Kohei Arai
3 min readApr 30, 2019

--

I recently received a job offer from one of FAANG. Here are some problems to help me pass the coding interview. Categories are

  • LinkedList
  • Stack
  • Heap, PriorityQueue
  • HashMap
  • Graph, BFS, DFS
  • Tree, BT, BST
  • Sort
  • Dynamic Programming
  • Binary search
  • Recursion
  • Sliding window
  • Greedy + Backtracking

If you can solve them quickly, you would have a high chance to pass coding interview. Problems are either Easy or Medium. I put these questions in Google Spreadsheet. Feel free to copy and paste to keep track of the progress.

These problems are also available on LeetCode List. You can clone to your account to avoid solving problems you have already solved.

LinkedList

Stack

Heap, PriorityQueue

HashMap

Graph, BFS, DFS

Tree, BT, BST

Sort

Check out Sorting Algorithms Animations. Understand in which data set radix sort or insertion sort are better than general heap/merge sort. Go each of sorting algorithms and understand pros and cons.

Dynamic Programming

Binary Search

Recursion

Sliding Window

Greedy + Backtracking

Others

I could not put these problems in above categories, but good to solve.

Summary

If you complete all questions and looking for more problem sets, I recommend checking out Algorithm Questions. They also summarize LeetCode problems by category.

If you finish Algorithm Questions too, check out Algorithms and Coding Interviews. My friend is writing it, and it’s worth to read. It provides more detail explanation and general approaches to the problems.

I mentioned these links in the middle of the stories, but here are links to keep track of your progress. Feel free to use them!

Good luck on your job preparation and coding interviews!

--

--