Prompt Library

Explain a common intro algorithm through a real-world analogy and plain pseudocode, then generate one hand-solvable practice problem with step-by-step feedback on the attempt.

Generate a sorted dataset and target value, then step through a binary search, predicting the new range before low, mid, and high pointers are revealed.

Build a small example graph as an adjacency list, adjacency matrix, or both, comparing memory usage and lookup cost between representations.

Convert plain-English algorithm pseudocode into working code line by line, flagging every ambiguous step and stating the assumption made to resolve it.

Explain the divide, conquer, and combine pattern underneath merge sort, quicksort, or binary search, tracing each step on a concrete input.

Explain a core data structure through a matching analogy, a short code example, a realistic scenario where it wins, and a common beginner mistake.

Explain a classic dynamic programming problem by exposing the naive solution's repeated work, then solving it again with memoization, compared side by side.

Generate a working function that converts between Roman numerals and integers in a chosen language, with the algorithm design explained and edge cases covered.