Difficulty

Medium DSA Problems with Solutions

Where most interview questions live. Patterns get combined, edge cases multiply, and the right data structure matters.

Medium problems are the bulk of the FAANG interview pool. They test whether you can combine two patterns (sliding window + hash map, BFS + state encoding, DP + bitmask), reason about edge cases under time pressure, and pick the right data structure on the first try. If you can solve mediums fluently, you're ready for most onsite rounds. Every medium problem on Ratta includes multiple approaches — typically a brute-force first, then the optimized solution — so you can see the progression rather than memorizing a single template.

Arrays & Hashing · 8

Two Pointers · 2

Sliding Window · 2

Binary Search · 2

Linked List · 2

Trees · 5

Tries · 2

Heap / Priority Queue · 1

Backtracking · 1

Graphs · 6

Dynamic Programming · 12

Greedy · 1

Intervals · 4

Bit Manipulation · 1