Algorithms and Data Structures
Divide and Conquer, Greedy Algorithms, Dynamic Programming, and Backtracking
Choose an algorithmic approach from the structure of a problem.
Loading learning records…
Readings and practice
Binary search: handle boundaries with a half-open interval
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
Merge sort: combine already sorted sequences
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
Quicksort: partition balance changes performance
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
Choose among greedy methods, divide-and-conquer, and dynamic programming
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
Insertion sort: extend a sorted prefix
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
Selection sort: separate comparisons from swaps
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
Heapsort: move the maximum into a sorted suffix
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
Counting sort: turn key counts into output positions
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
Radix sort: preserve earlier passes when sorting digits
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
Introsort: guard quicksort with a depth budget
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
Timsort: merge the ordered runs already present
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
KMP: reuse a matched prefix after a mismatch
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
The Z algorithm: compute prefix-match lengths
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
Rabin–Karp: filter windows with a rolling hash
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
Suffix arrays: search a lexicographic order of starting positions
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
Aho–Corasick: track many patterns in one automaton
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
Edit-distance dynamic programming: align prefixes by minimum cost
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
Testing binary-search invariants
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
Greedy methods versus dynamic programming
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
Stable versus unstable sorting
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
Testing sorting stability with records
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
Huffman coding
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
Choose each item once with 0–1 knapsack
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
Sample an unknown-length stream with a reservoir
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
Select one rank with three-way Quickselect
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
Binary-search the smallest feasible answer
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
Discover search bounds by doubling
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
Find a target pair from two endpoints
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
Maintain interval state with a sliding window
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered