DDSA Solutions

Array

507 problems · 338 with full explanations

78 Easy199 Medium52 Hard
Array problems involve manipulating elements stored in a contiguous block of memory. Key techniques include two-pointer traversal, prefix sums, sliding windows, and in-place partitioning. In C#, arrays are zero-indexed and fixed in size — use List<T> when you need dynamic resizing.

How to practice

To practice Array problems effectively, start with the Easy problems listed below, trace through each solution on paper, then re-implement without looking. When you can recognise the array pattern within 30 seconds of reading a new problem, move on to Medium difficulty. Use the related topic pages and our study guide for a structured progression.

Open the full study guide →

Start here (Easy + explained)

All Array problems