Data structures, algorithms and coding interviews
Coding Interview Patterns
Coding interview patterns with examples that run: a method for any problem, then hashing, two pointers, windows, trees, graphs, dynamic programming and more.
219 lessons: 3 free, 43 free with Pro answers, 27 with a free core and 146 with a free intro.
Examples run with Python 3.14.8 and Pyodide 314.0.7.
Who it is for
Candidates preparing for coding rounds, from internships to mid-level roles, who know one programming language and basic data structures and algorithms.
What you will be able to do
- Approach any coding problem with a repeatable method, from clarifying questions to tests
- Read input limits to choose a target complexity, and check it by measuring
- Recognise the common patterns, such as hashing, two pointers, sliding windows and prefix sums
- Solve tree, graph, heap, interval and backtracking problems with tested templates
- Design dynamic-programming states and greedy rules, and argue why they are correct
- Test a solution with edge cases and with stress tests against a brute force
- Explain your reasoning aloud and make good use of hints in a live round
Before this track
Revise and practise
- Practice: every exercise and quiz (216 exercises, 219 quizzes)
Modules and lessons
What the labels mean
- Free
- the whole lesson and every answer in it
- Free lesson, Pro answers
- the whole lesson is free; the model answers to its interview questions open with a pass
- Free core, Pro depth
- the core of the lesson is free; its in-depth parts open with a pass
- Free intro, Pro
- the first part is free; the rest opens with a pass
- Pro
- opens with a Pro, Premium or Ultimate pass
Minutes are reading time: “8 of 25 min free” means 8 minutes of the lesson are free.
What a pass opens in this track
227 in-depth parts and 607 interview answers. The same pass opens every other track and every Pro tool.
- Module 1
How to approach a coding round
A repeatable method for any coding problem: formats, constraints, brute force to optimal, tests, invariants and getting unstuck.
- Coding rounds: formats and what gets scored Free lesson, Pro answers: 20 minutes
- A six-step method for any coding problem Free lesson, Pro answers: 20 minutes
- Read constraints to pick the target complexity Free lesson, Pro answers: 15 minutes
- From brute force to optimal: the usual moves Free lesson, Pro answers: 20 minutes
- Edge cases and tests before you code Free lesson, Pro answers: 20 minutes
- Dry runs and loop invariants Free lesson, Pro answers: 20 minutes
- Getting unstuck: heuristics and using hints Free lesson, Pro answers: 20 minutes
- Module 2
Interview toolkits in five languages
The parts of Python, JavaScript/TypeScript, Java, C++ and Go that coding rounds use, the traps in each, and fast input/output for online assessments.
- Choosing your interview language Free lesson, Pro answers: 25 minutes
- Python toolkit for coding rounds Free lesson, Pro answers: 20 minutes
- JavaScript and TypeScript toolkit Free lesson, Pro answers: 20 minutes
- Java toolkit for coding rounds Free lesson, Pro answers: 20 minutes
- C++ toolkit for coding rounds Free lesson, Pro answers: 15 minutes
- Go toolkit for coding rounds Free lesson, Pro answers: 25 minutes
- Online assessments: input, output and scoring Free lesson, Pro answers: 15 minutes
- Build a stress tester: brute force vs optimal Free lesson, Pro answers: 25 minutes
- Module 3
Arrays and hashing
Hash maps and sets for lookups, counts and groups, plus in-place tricks that use the array itself.
- Hash map patterns: lookup, count, group Free lesson, Pro answers: 30 minutes
- Complement lookup: pairs in one pass Free core, Pro depth: 8 of 25 minutes free
- Frequency maps: checking a valid anagram Free intro, Pro: 3 of 15 minutes free
- Grouping with canonical keys Free intro, Pro: 4 of 15 minutes free
- Sets for consecutive runs Free intro, Pro: 3 of 15 minutes free
- Product of all others: prefix and suffix passes Free intro, Pro: 5 of 20 minutes free
- Majority vote in O(1) space Free intro, Pro: 5 of 20 minutes free
- Cyclic placement and in-place marking Free intro, Pro: 4 of 25 minutes free
- Encoding lists of strings safely Free intro, Pro: 4 of 20 minutes free
- Knowing what to track in one pass Free intro, Pro: 4 of 20 minutes free
- Module 4
Two pointers
Converging pointers on sorted or symmetric data, reader–writer pointers for in-place edits, and parallel scans of two sequences.
- Two pointers: converging and reader–writer Free lesson, Pro answers: 25 minutes
- In-place compaction with reader–writer pointers Free intro, Pro: 4 of 20 minutes free
- Dutch national flag: three-way partitioning Free intro, Pro: 4 of 20 minutes free
- Merge two sorted arrays in place Free intro, Pro: 5 of 20 minutes free
- Two pointers on strings: palindromes and edits Free intro, Pro: 5 of 25 minutes free
- Module 5
Sliding window
Fixed and variable windows over arrays, strings and event streams, including monotonic deques and windows that need order statistics.
- Sliding windows: fixed and variable Free lesson, Pro answers: 25 minutes
- Module 6
Prefix sums and difference arrays
Range totals in O(1), subarray counting with hash maps, remainders and parity, 2-D tables and range updates.
- Prefix sums for instant range totals Free lesson, Pro answers: 25 minutes
- Count subarrays with a target sum Free core, Pro depth: 7 of 20 minutes free
- Divisibility with prefix remainders Free intro, Pro: 5 of 20 minutes free
- Balanced stretches: ±1 and XOR prefixes Free intro, Pro: 5 of 20 minutes free
- Module 7
Sorting as a tool
What sorting buys, custom orders and comparator traps, linear-time sorts, quickselect, merge-sort counting, medians and ranks.
- Sort first: what sorting buys you Free lesson, Pro answers: 30 minutes
- Custom orders and comparator pitfalls Free core, Pro depth: 11 of 35 minutes free
- Counting, bucket and radix sort Free intro, Pro: 6 of 30 minutes free
- Quickselect for the k-th element Free intro, Pro: 6 of 30 minutes free
- Counting pairs with merge sort Free intro, Pro: 7 of 35 minutes free
- Sorting for optimisation: medians and pairing Free intro, Pro: 6 of 30 minutes free
- Coordinate compression and ranks Free intro, Pro: 5 of 25 minutes free
- Module 8
Stacks and monotonic stacks
Nesting, undo and deferred decisions, expression evaluation, next-greater queries, histograms, contribution counting and stack-based greedy choices.
- Stack patterns: nesting and undo Free lesson, Pro answers: 25 minutes
- Bracket matching and minimum fixes Free core, Pro depth: 7 of 25 minutes free
- Stacks that know their minimum Free intro, Pro: 5 of 20 minutes free
- Next greater element with a monotonic stack Free intro, Pro: 4 of 20 minutes free
- Largest rectangle in a histogram Free intro, Pro: 4 of 20 minutes free
- Contribution counting with monotonic stacks Free intro, Pro: 3 of 15 minutes free
- Greedy choices with a monotonic stack Free intro, Pro: 4 of 20 minutes free
- Stack simulations: collisions and spans Free intro, Pro: 3 of 15 minutes free
- Module 9
Binary search
Invariant-based binary search, library bounds, search on the answer, rotated arrays, sorted matrices and partition search.
- Binary search that is correct the first time Free: 30 minutes
- First, last and count with bounds Free core, Pro depth: 7 of 25 minutes free
- Binary search on a monotone predicate Free intro, Pro: 5 of 25 minutes free
- Search on the answer: capacity and speed Free intro, Pro: 6 of 25 minutes free
- Minimise the maximum: split into k groups Free intro, Pro: 6 of 30 minutes free
- Maximise the minimum distance Free intro, Pro: 5 of 25 minutes free
- Rotated arrays and peaks Free intro, Pro: 6 of 35 minutes free
- Sorted matrices: staircase and value search Free intro, Pro: 6 of 35 minutes free
- Partition search: median of two sorted arrays Free intro, Pro: 7 of 35 minutes free
- Module 10
Linked list patterns
Dummy heads, in-place reversal, fast and slow pointers, merging, folding, pointer gaps and deep copies.
- Linked-list toolkit: dummies and test helpers Free lesson, Pro answers: 25 minutes
- Reversing a linked list in place Free core, Pro depth: 11 of 35 minutes free
- Fast and slow pointers: middle and cycles Free intro, Pro: 8 of 35 minutes free
- Merging, splitting and partitioning lists Free intro, Pro: 8 of 35 minutes free
- Deep copies of lists with extra pointers Free intro, Pro: 8 of 30 minutes free
- Module 11
Tree patterns: depth-first
Recursive contracts, iterative traversals, path problems, lowest common ancestors, BSTs, building and serialising trees.
- Recursive tree functions: decide what returns Free lesson, Pro answers: 35 minutes
- Iterative traversals for deep trees Free core, Pro depth: 11 of 35 minutes free
- Balanced binary tree, height and diameter Free intro, Pro: 9 of 35 minutes free
- Root-to-leaf paths and backtracking Free intro, Pro: 8 of 30 minutes free
- Maximum path sum through any node Free intro, Pro: 9 of 35 minutes free
- Downward path sums with prefix counts Free intro, Pro: 9 of 35 minutes free
- Lowest common ancestor Free intro, Pro: 6 of 40 minutes free
- BST patterns: bounds, order and successors Free intro, Pro: 7 of 40 minutes free
- Building trees from traversal orders Free intro, Pro: 7 of 35 minutes free
- Serialise trees to find duplicate subtrees Free intro, Pro: 7 of 35 minutes free
- Treating a tree as a graph Free intro, Pro: 7 of 30 minutes free
- Module 12
Tree patterns: breadth-first
Level-order templates, side views, vertical order, width and completeness, N-ary trees and parent arrays.
- Level-order traversal template Free lesson, Pro answers: 30 minutes
- Side views and zigzag level order Free core, Pro depth: 10 of 30 minutes free
- Vertical order traversal of a binary tree Free intro, Pro: 9 of 35 minutes free
- Maximum width of a binary tree Free intro, Pro: 8 of 35 minutes free
- N-ary trees and parent arrays Free intro, Pro: 8 of 30 minutes free
- Module 13
Heaps and top-K
Heaps in five languages, top-k, k closest, k-way merge, frontier search, running medians, scheduling and lazy deletion.
- Heaps in five languages Free lesson, Pro answers: 40 minutes
- Top-k with a size-k heap Free core, Pro depth: 10 of 30 minutes free
- Top k frequent words: heap or buckets Free intro, Pro: 6 of 30 minutes free
- K closest points to origin and closest values Free intro, Pro: 6 of 30 minutes free
- Merging k sorted lists with a heap Free intro, Pro: 6 of 35 minutes free
- Frontier heaps for k-th smallest pairs Free intro, Pro: 7 of 35 minutes free
- Running median with two heaps Free intro, Pro: 6 of 30 minutes free
- Scheduling with heaps Free intro, Pro: 8 of 35 minutes free
- Heaps with lazy deletion Free intro, Pro: 7 of 35 minutes free
- Module 14
Intervals and sweep line
Interval conventions, merging, intersections and free time, greedy selection, peak overlap, skylines and online booking.
- Interval conventions and overlap tests Free lesson, Pro answers: 30 minutes
- Merge intervals and insert an interval Free core, Pro depth: 10 of 30 minutes free
- Interval list intersections and common slots Free intro, Pro: 7 of 30 minutes free
- Non-overlapping intervals: the fewest removals Free intro, Pro: 7 of 30 minutes free
- Minimum number of platforms: peak overlap Free intro, Pro: 8 of 30 minutes free
- The skyline problem: a sweep line with a heap Free intro, Pro: 7 of 35 minutes free
- My Calendar I: online bookings with ordered maps Free intro, Pro: 6 of 30 minutes free
- Module 15
Matrices and simulation
Grid conventions, rotations, spiral and diagonal walks, in-place state encoding and simulations that repeat.
- Grid conventions and direction arrays Free lesson, Pro answers: 30 minutes
- Rotate a matrix 90 degrees in place Free core, Pro depth: 10 of 30 minutes free
- Spiral matrix and zigzag diagonal order Free intro, Pro: 7 of 30 minutes free
- Set matrix zeroes: in-place updates with markers Free intro, Pro: 9 of 35 minutes free
- Simulations that repeat: robot bounded in circle Free intro, Pro: 8 of 35 minutes free
- Module 16
Backtracking
Choose–explore–unchoose, subsets, permutations, combinations, partitions, grid search, constraint puzzles, pruning and meet in the middle.
- Backtracking: choose, explore, unchoose Free lesson, Pro answers: 40 minutes
- Generating subsets three ways Free core, Pro depth: 10 of 30 minutes free
- Permutations and next permutation Free intro, Pro: 8 of 35 minutes free
- Combinations and combination sums Free intro, Pro: 8 of 35 minutes free
- Partitioning strings with backtracking Free intro, Pro: 7 of 35 minutes free
- Word search on a grid with backtracking Free intro, Pro: 7 of 35 minutes free
- Constraint search: N-Queens and Sudoku Free intro, Pro: 8 of 40 minutes free
- Generate parentheses: brackets and expressions Free intro, Pro: 8 of 35 minutes free
- Partition to k equal sum subsets: pruning Free intro, Pro: 7 of 35 minutes free
- Meet in the middle algorithm for n up to 40 Free intro, Pro: 8 of 35 minutes free
- Module 17
Bit manipulation
Bits across languages, XOR tricks, counting bits, powers of two, masks and Gray codes, bitwise arithmetic and bitsets.
- Bits across languages Free lesson, Pro answers: 25 minutes
- XOR tricks: unique and missing values Free core, Pro depth: 8 of 25 minutes free
- Counting bits: popcount and the 0-to-n table Free intro, Pro: 5 of 20 minutes free
- Bitwise AND of a range: powers of two, reversal Free intro, Pro: 5 of 20 minutes free
- Bitmask subsets: submasks and Gray codes Free intro, Pro: 10 of 35 minutes free
- Divide two integers: shifts, carries and 32 bits Free intro, Pro: 10 of 35 minutes free
- Bitsets: subset sums by shifting Free intro, Pro: 9 of 35 minutes free
- Module 18
Maths for coding rounds
Integer traps, gcd and lcm, fast power and inverses, primes, combinations, digits and big numbers, check digits, integer geometry and randomness.
- Division, remainders and overflow across languages Free lesson, Pro answers: 30 minutes
- Digits, bases and numbers as strings Free intro, Pro: 6 of 30 minutes free
- Check digits: the Luhn algorithm Free intro, Pro: 5 of 25 minutes free
- Random shuffles and sampling Free intro, Pro: 6 of 35 minutes free
- Module 19
Tries
Prefix trees for lookups, counts and suggestions, wildcard search, grid word search and binary tries for XOR.
- Tries: insert, search and prefixes Free lesson, Pro answers: 40 minutes
- Prefix counts and autocomplete suggestions Free core, Pro depth: 11 of 35 minutes free
- Wildcard search in a trie Free intro, Pro: 7 of 35 minutes free
- Many words in a grid: trie plus DFS Free intro, Pro: 8 of 40 minutes free
- Binary tries for maximum XOR Free intro, Pro: 7 of 40 minutes free
- Module 20
Graph patterns: traversal
Modelling problems as graphs, BFS for shortest paths, grids, multi-source and state-space BFS, DFS, cycles, bipartite checks and Euler paths.
- Modelling problems as graphs Free lesson, Pro answers: 40 minutes
- BFS shortest paths: fewest hops and the route Free core, Pro depth: 12 of 35 minutes free
- Number of islands: flood fill and border regions Free intro, Pro: 9 of 35 minutes free
- Multi-source BFS: nearest source and spreading Free intro, Pro: 8 of 30 minutes free
- BFS over states: word ladders and padlocks Free intro, Pro: 9 of 35 minutes free
- BFS with extra state: keys and wall breaks Free intro, Pro: 9 of 35 minutes free
- Clone a graph: DFS for components and copies Free intro, Pro: 6 of 35 minutes free
- Cycle detection: directed and undirected graphs Free intro, Pro: 7 of 35 minutes free
- Reconstruct an itinerary with Eulerian paths Free intro, Pro: 7 of 35 minutes free
- Module 21
Topological sort and DAGs
Kahn's algorithm, DFS ordering, scheduling with prerequisites, smallest and unique orders, alphabets from sorted words and DP on DAGs.
- Topological order with Kahn's algorithm Free lesson, Pro answers: 35 minutes
- Topological order with DFS Free core, Pro depth: 10 of 30 minutes free
- Scheduling with prerequisites Free intro, Pro: 9 of 35 minutes free
- Smallest and unique topological orders Free intro, Pro: 8 of 35 minutes free
- Inferring an alphabet from sorted words Free intro, Pro: 9 of 35 minutes free
- Dynamic programming on DAGs Free intro, Pro: 9 of 35 minutes free
- Module 22
Union-find (disjoint sets)
A short union-find template and its uses: connectivity, redundant edges, merging records, weighted constraints and offline threshold queries.
- Union-find: the 20-line template Free lesson, Pro answers: 35 minutes
- Connectivity and redundant edges Free core, Pro depth: 10 of 30 minutes free
- Merging records that share identifiers Free intro, Pro: 6 of 30 minutes free
- Offline queries sorted by threshold Free intro, Pro: 8 of 35 minutes free
- Module 23
Weighted graphs: shortest paths and spanning trees
Dijkstra and its variants, 0-1 BFS, Bellman–Ford, Floyd–Warshall, augmented states, spanning trees, bridges, strongly connected components and A*.
- Dijkstra's algorithm with a heap Free lesson, Pro answers: 35 minutes
- Dijkstra variants: minimax and probabilities Free core, Pro depth: 10 of 35 minutes free
- 0-1 BFS with a deque Free intro, Pro: 6 of 30 minutes free
- Min cost to connect all points: Kruskal and Prim Free intro, Pro: 7 of 35 minutes free
- Critical connections: bridges and cut vertices Free intro, Pro: 8 of 40 minutes free
- Strongly connected components: Kosaraju and Tarjan Free intro, Pro: 8 of 40 minutes free
- A* search with admissible heuristics Free intro, Pro: 8 of 35 minutes free
- Module 24
Dynamic programming: foundations
From recursion to DP, state design, linear DP, pick-or-skip, counting with modulo, maximum subarray, word segmentation, LIS and space optimisation.
- From recursion to dynamic programming Free lesson, Pro answers: 40 minutes
- Designing DP states and transitions Free core, Pro depth: 11 of 35 minutes free
- Linear DP: steps, costs and choices Free intro, Pro: 8 of 35 minutes free
- Pick-or-skip DP with adjacency rules Free intro, Pro: 7 of 30 minutes free
- Counting ways with modulo arithmetic Free intro, Pro: 9 of 35 minutes free
- Maximum subarray: sum, product and circular Free intro, Pro: 8 of 35 minutes free
- Segmenting strings with a dictionary Free intro, Pro: 9 of 35 minutes free
- Longest increasing subsequence Free intro, Pro: 7 of 35 minutes free
- LIS applications: envelopes and chains Free intro, Pro: 8 of 40 minutes free
- Space optimisation and reconstruction Free intro, Pro: 8 of 40 minutes free
- Module 25
Dynamic programming: knapsack, grids and strings
0/1 and unbounded knapsack, subset sums, grid DP, LCS and diffs, edit distance, palindromes, pattern matching and rebuilding answers.
- 0/1 knapsack: table to one row Free lesson, Pro answers: 35 minutes
- Subset sums, partitions and target signs Free core, Pro depth: 10 of 30 minutes free
- Unbounded knapsack and coin change Free intro, Pro: 7 of 30 minutes free
- Grid DP: paths, costs and squares Free intro, Pro: 7 of 30 minutes free
- Longest common subsequence and diffs Free intro, Pro: 7 of 35 minutes free
- Edit distance with operations Free intro, Pro: 6 of 35 minutes free
- Palindromic substrings and subsequences Free intro, Pro: 7 of 35 minutes free
- Wildcard and regex-style matching Free intro, Pro: 9 of 40 minutes free
- Interleavings and distinct subsequences Free intro, Pro: 9 of 35 minutes free
- Rebuilding the answer from a DP table Free intro, Pro: 7 of 30 minutes free
- Module 26
Dynamic programming: advanced patterns
Interval DP, state machines, bitmask and digit DP, trees and rerooting, probability, combinatorial counting, data-structure speed-ups and games.
- Interval DP: merging and cutting costs Free lesson, Pro answers: 35 minutes
- State-machine DP: buy, sell, cool down Free core, Pro depth: 9 of 30 minutes free
- Bitmask DP: assignments and shortest tours Free intro, Pro: 8 of 35 minutes free
- Digit DP: counting numbers up to N Free intro, Pro: 8 of 35 minutes free
- Dynamic programming on trees Free intro, Pro: 7 of 35 minutes free
- Rerooting: answers for every root Free intro, Pro: 7 of 35 minutes free
- Probability DP: will the knight stay on the board? Free intro, Pro: 7 of 35 minutes free
- Two-player games with minimax DP Free intro, Pro: 6 of 30 minutes free
- Module 27
Greedy algorithms and proofs
When greedy works, activity selection, reach-based greedy, circular tours, last occurrences, cooldowns, two-pass rules, Huffman-style merging and sorted matching.
- When greedy works: proofs and counterexamples Free lesson, Pro answers: 40 minutes
- Activity selection and interval partitioning Free core, Pro depth: 13 of 40 minutes free
- Jump game: farthest reach and fewest jumps Free intro, Pro: 6 of 30 minutes free
- Gas station problem: where the circular tour starts Free intro, Pro: 7 of 30 minutes free
- Partition labels: cuts at last occurrences Free intro, Pro: 7 of 25 minutes free
- Task scheduling with cooldowns Free intro, Pro: 8 of 35 minutes free
- Two-pass greedy from both ends Free intro, Pro: 8 of 30 minutes free
- Least-cost merges with a heap (Huffman) Free intro, Pro: 8 of 35 minutes free
- Module 28
String patterns
Strings in five languages, palindromes, the prefix function, the Z-function, rolling hashes, parsing and run-length encoding, and text layout.
- Strings in five languages Free lesson, Pro answers: 35 minutes
- Longest palindromic substring Free core, Pro depth: 10 of 30 minutes free
- Shortest palindrome with the KMP prefix function Free intro, Pro: 9 of 35 minutes free
- Z-function: matching, prefix counts and periods Free intro, Pro: 7 of 30 minutes free
- String to integer (atoi) and run-length encoding Free intro, Pro: 8 of 30 minutes free
- Text justification and word wrap Free intro, Pro: 8 of 30 minutes free
- Module 29
Design-a-data-structure problems
Designing classes with required costs: LRU and LFU caches, random access sets, stack and queue adapters, versioned stores, iterators and frequency structures.
- Design-a-data-structure problems: a method Free lesson, Pro answers: 40 minutes
- LRU cache in O(1) Free core, Pro depth: 11 of 35 minutes free
- LFU cache in O(1) with frequency buckets Free intro, Pro: 8 of 40 minutes free
- Insert, delete and getRandom in O(1) Free intro, Pro: 8 of 35 minutes free
- Stack adapters: browser history, undo, queues Free intro, Pro: 7 of 35 minutes free
- Versioned stores: values at any past time Free intro, Pro: 8 of 35 minutes free
- Iterator design: flatten, peek, interleave Free intro, Pro: 8 of 35 minutes free
- Frequency stack and a constant-time counter Free intro, Pro: 9 of 35 minutes free
- Module 30
Range queries: Fenwick and segment trees
Choosing a range-query structure, Fenwick trees, counting with ranks, segment trees with lazy propagation, sparse tables and LCA.
- Choosing a range-query structure Free lesson, Pro answers: 40 minutes
- Fenwick trees for prefix sums with updates Free core, Pro depth: 12 of 35 minutes free
- Counting smaller elements with Fenwick trees Free intro, Pro: 8 of 35 minutes free
- Segment trees: point updates, range queries Free intro, Pro: 8 of 40 minutes free
- Lazy propagation for range updates Free intro, Pro: 9 of 45 minutes free
- Sparse tables: range minimum and LCA in O(1) Free intro, Pro: 10 of 45 minutes free
- Module 31
Concurrency coding problems
Concurrency tasks that appear in coding rounds: limited parallelism, bounded buffers, ordering and thread-safe structures, verified with race detectors.
- Concurrency questions in coding rounds Free: 35 minutes
- Running tasks with a concurrency limit Free core, Pro depth: 10 of 30 minutes free
- Bounded buffers and ordered workers Free intro, Pro: 8 of 35 minutes free
- Thread-safe counters, caches and aggregation Free intro, Pro: 9 of 40 minutes free
- Module 32
Coding rounds with AI: read, debug, extend
What public sources say about AI-assisted rounds, and the skills they reward: reading and debugging unfamiliar code, extending it and verifying code you did not write.
- Coding rounds with an AI assistant Free: 25 minutes
- Module 33
Pattern recognition and mixed practice
A decision guide, operation costs, a bug catalogue, unlabeled mixed drills and a revision system.
- Which pattern? A decision guide Free lesson, Pro answers: 20 minutes
- Operation costs across five languages Free core, Pro depth: 7 of 20 minutes free
- Mixed drill: arrays, strings and windows Free intro, Pro: 6 of 25 minutes free
- Mixed drill: DP, greedy and backtracking Free intro, Pro: 4 of 20 minutes free
- Revision: re-solve queues and pattern notes Free intro, Pro: 5 of 25 minutes free
Related tools
Official documentation
- The Python Standard Library (Python Software Foundation)
- Time complexity of operations on built-in types (Python Software Foundation)
- Pyodide documentation (Pyodide)