A steady set of interview problems.

Browse by title, pick a problem, and get straight into practice.

Minimum Replacements to Make Array AlternatingArray, Greedy, Hash Map, Counting

Medium

Merge k Sorted ListsLinked List, Divide and Conquer, Heap (Priority Queue)

Hard

Two SumMath, Basic

Easy

Reverse Nodes in k-GroupLinked List, Recursion

Hard

Median of Two Sorted ArraysArray, Binary Search, Divide and Conquer

Hard