Skip to content
Log inStart studying

DSA learning path

Searching & Sorting

Binary search, partitioning, stable sorting and inversion counting.

Start with Binary Search

Problems in this path

  1. Binary Search
    Easy · Binary Search
    Open
  2. Sort Three Colours
    Medium · Dutch National Flag
    Open
  3. Count Inversions
    Hard · Merge Sort
    Open
  4. Lower Bound Position
    Easy · Boundary Binary Search
    Open
  5. First and Last Target Position
    Medium · Dual Boundary Search
    Open
  6. Search a Rotated Sorted Array
    Medium · Modified Binary Search
    Open
  7. Find a Peak Index
    Medium · Slope Binary Search
    Open
  8. Integer Square Root
    Easy · Answer-Space Binary Search
    Open
  9. Kth Missing Positive
    Medium · Missing-Count Binary Search
    Open
  10. Merge Sorted Sequences
    Easy · Merge Step
    Open

Read first

Sorting Algorithms and Their Trade-offs

Compare insertion sort, merge sort and quicksort, understand stability, and choose a sorting strategy from the shape of the data.

16 min read

Binary Search and Boundary Finding

Search sorted data in logarithmic time, find first and last valid positions, and binary-search an answer when feasibility is monotonic.

17 min read