Catalog
Follow a path, one topic at a time.
88 interactive traces. Work through each track in order - your progress is saved to your account.
Sign in to save your progress and unlock members-only lessons.
Foundations
syncing…- BASICSBeginnerContinue →FreeFoundations - Big-O NotationThe language every engineer uses to describe speed - what O(n), O(log n), and friends actually measure, and why constants stop mattering.10m
- BASICSBeginnerFreeFoundations - Logarithms for EngineersA logarithm asks 'how many times must I halve (or double)?' - the math hiding inside binary search, balanced trees, and every O(log n) promise.8m
- BASICSBeginnerMembersFoundations - Binary Numbers & Bitwise OperationsComputers count in ones and zeros - learn to read binary, meet the bitwise operators, and understand why powers of two rule memory.9m
- BASICSBeginnerMembersFoundations - Arrays & MemoryArrays live side by side in memory - which is why indexing is instant, inserting in the middle is not, and caches love them.7m
- BASICSBeginnerMembersFoundations - Recursion & the Call StackA function that calls itself sounds scary until you see the call stack - master base cases and you unlock trees, sorting, and DP.8m
- BASICSBeginnerMembersFoundations - Sets & Maps (Hash Intuition)Ask 'have I seen this before?' or 'what do I know about X?' in one step - hash sets and maps are the most-used tools in interviews.7m
- BASICSBeginnerMembersFoundations - Graphs & NetworksNodes and edges model everything from friendships to road maps - learn the vocabulary before touching graph algorithms.7m
- BASICSBeginnerMembersFoundations - Statistics Engineers Actually UseMean vs median, percentiles, and expected value - the numbers behind latency dashboards and 'why averages lie'.7m
- BASICSBeginnerMembersFoundations - Complexity Classes ComparedWatch every complexity class race real input sizes - and learn where the practical limits of computing actually sit.7m
- BASICSBeginnerMembersFoundations - Reading Code Traces on This SiteLearn to read the variable-table trace format used across this platform - pointers, highlights, and invariants in five minutes.6m
Data Structures
syncing…- DSBeginnerContinue →FreeLinked List - Insert at HeadO(1) insertion. Allocate a node, rewire next, and move the head pointer.5m
- DSIntermediateFreeLRU CacheHash map for O(1) lookup plus a doubly linked list for recency order. Least-recently-used evicts first.9m
- DSBeginnerMembersValid ParenthesesCheck that every bracket is closed in the right order using a stack.6m
- DSBeginnerMembersMerge Two Sorted ListsMerge two sorted lists into one by always taking the smaller next node.7m
- DSBeginnerMembersReverse Linked ListReverse a linked list in place by rewiring each node's next pointer with three pointers.7m
- DSBeginnerMembersMaximum Depth of Binary TreeFind how deep a binary tree goes by computing subtree heights bottom-up.6m
- DSBeginnerMembersInvert Binary TreeMirror a binary tree by swapping each node's left and right children.6m
- DSIntermediateMembersValidate Binary Search TreeCheck a BST's ordering with an in-order walk or a value range.8m
- DSIntermediateMembersBinary Tree Level Order TraversalVisit a tree row by row using a queue - breadth-first search.7m
- DSBeginnerMembersLinked List CycleDetect a cycle in a linked list with Floyd's slow and fast pointers.7m
- DSAdvancedMembersBinary Tree Maximum Path SumFind the largest sum of any path in a binary tree with a post-order gain function.10m
- DSIntermediateMembersLowest Common Ancestor of a BSTFind the deepest node that has both targets as descendants using the BST order.8m
- DSAdvancedMembersSerialize and Deserialize Binary TreeEncode a tree to a string and rebuild it exactly, using pre-order with null markers.10m
- DSBeginnerMembersSame TreeCheck whether two binary trees are identical with a parallel recursive walk.6m
- DSIntermediateMembersData Structure - Heap & Priority QueueA binary heap gives O(1) access to the min/max and O(log n) insert - the engine behind top-k, schedulers, and Dijkstra.9m
- DSIntermediateMembersData Structure - Trie (Prefix Tree)Store words character by character so prefix lookups cost O(length), not O(dictionary size) - the engine of autocomplete.8m
Algorithms
syncing…- ALGOBeginnerContinue →FreeBinary SearchHalve the search space every step. Trace low, mid, and high as they converge on the target.6m
- ALGOBeginnerMembersBubble SortThe largest unsorted value bubbles to the end of each pass. Watch swaps happen in place.8m
- ALGOBeginnerFreeTwo SumFind two numbers that add up to a target. The single most-asked interview question.6m
- ALGOBeginnerMembersValid PalindromeCheck whether a string reads the same forward and backward with two pointers.5m
- ALGOBeginnerMembersValid AnagramDecide whether two strings are the same letters rearranged, by counting characters.5m
- ALGOBeginnerMembersContains DuplicateDetect whether an array has any repeated value using a hash set.4m
- ALGOBeginnerMembersBest Time to Buy and Sell StockFind the maximum profit from one buy and one sell by tracking the lowest price seen so far.6m
- ALGOIntermediateMembersMaximum SubarrayFind the contiguous subarray with the largest sum using Kadane's algorithm.8m
- ALGOIntermediateMembersNumber of IslandsCount connected land regions in a grid with a flood-fill DFS.9m
- ALGOBeginnerMembersClimbing StairsCount ways to climb n stairs taking 1 or 2 steps - the Fibonacci recurrence.7m
- ALGOIntermediateMembersHouse RobberMax money you can rob from a row of houses without hitting adjacent ones.8m
- ALGOIntermediateMembers3SumFind all triplets that sum to zero using sort plus two pointers.10m
- ALGOIntermediateMembersProduct of Array Except SelfReturn the product of every element except the current one, without division.8m
- ALGOIntermediateMembersCoin ChangeFind the fewest coins that make a target amount with unbounded denominations.10m
- ALGOIntermediateMembersGroup AnagramsGroup words that are anagrams using a sorted string as the key.8m
- ALGOIntermediateMembersLongest Substring Without Repeating CharactersFind the longest substring with all distinct characters using a sliding window.8m
- ALGOIntermediateMembersTop K Frequent ElementsReturn the k most common values using bucket sort by frequency.8m
- ALGOIntermediateMembersWord BreakDecide if a string can be split into dictionary words with DP.10m
- ALGOIntermediateMembersDecode WaysCount how many ways a digit string can decode into letters with a Fibonacci-style DP.9m
- ALGOIntermediateMembersCourse ScheduleDecide if all courses can be taken by detecting a cycle with Kahn's topological sort.10m
- ALGOBeginnerMembersNumber of 1 BitsCount set bits in an integer by clearing the lowest 1 with n & (n - 1).6m
- ALGOBeginnerMembersMissing NumberFind the missing number from 0..n using the sum formula or XOR.6m
- ALGOIntermediateMembersRotate ImageRotate an n x n matrix 90 degrees clockwise in place via transpose and reverse.8m
- ALGOIntermediateMembersMerge IntervalsMerge overlapping intervals by sorting on start, then fusing overlaps in one pass.8m
- ALGOIntermediateMembersInsert IntervalInsert a new interval into a sorted non-overlapping list and merge any overlaps.8m
- ALGOBeginnerMembersMeeting RoomsDecide if one person can attend all meetings by checking sorted intervals for overlaps.6m
- ALGOIntermediateMembersAlgorithm - Union-Find (Disjoint Set Union)Track which items belong to the same group in near-constant time - the secret weapon behind cycle detection and connected components.8m
- ALGOAdvancedMembersAlgorithm - Dijkstra's Shortest PathGreedy + priority queue settles the closest unfinalized node each round - shortest paths for any graph with non-negative weights.10m
- ALGOBeginnerMembersAlgorithm - Merge SortDivide in half, sort recursively, merge linearly - the stable O(n log n) guarantee and the gateway to external sorting.7m
- ALGOBeginnerMembersAlgorithm - Quick SortPartition around a pivot and recurse - the fastest in-memory sort in practice, with an O(n²) worst case you must know how to avoid.8m
System Design
syncing…- SYSIntermediateContinue →FreeSystem Design - URL ShortenerA short URL service end to end: short-code generation, storage, caching, and redirects.7m
- SYSBeginnerMembersSystem Design - How DNS WorksTurn a name into an IP: recursive resolution from the resolver to the root, TLD, and authoritative servers.6m
- SYSIntermediateFreeSystem Design - CachingServe hot data from memory and pick the write strategy that matches your risk tolerance.9m
- SYSIntermediateMembersSystem Design - CAP TheoremA distributed system can guarantee only two of three: consistency, availability, and partition tolerance.7m
- SYSIntermediateMembersSystem Design - SQL vs NoSQLPick the store that fits the data shape: relational for joins and ACID, NoSQL for scale and flexibility.8m
- SYSAdvancedMembersSystem Design - Scaling to Millions on AWSGrow a system from one box to millions of users by removing the bottleneck at each step.12m
- SYSAdvancedMembersSystem Design - Twitter Timeline and SearchPost a tweet, fan it out to follower timelines, serve reads from cache, and search an index.12m
- SYSIntermediateMembersSystem Design - Content Delivery NetworkServe content from servers near the user so it loads fast anywhere in the world.8m
- SYSIntermediateMembersSystem Design - Load BalancerSpread traffic across servers so no single machine is overwhelmed, and hide failures.8m
- SYSIntermediateMembersSystem Design - Reverse ProxyA server that sits in front of your backend, forwards requests, and shields it from clients.7m
- SYSIntermediateMembersSystem Design - Application Layer and MicroservicesSplit an app into small independent services, each owning one job and its own data.9m
- SYSAdvancedMembersSystem Design - Database ScalingKeep the database fast as it grows: replication, federation, sharding, and denormalization.11m
- SYSIntermediateMembersSystem Design - Consistency PatternsWeak, eventual, or strong: how fresh a read is, and what you pay for it.8m
- SYSIntermediateMembersSystem Design - Availability PatternsFailover and replication keep a system up - and the nines measure how well.8m
- SYSIntermediateMembersSystem Design - Asynchronism and QueuesDo slow work later, off the request path, so the user is never kept waiting.8m
- SYSIntermediateMembersSystem Design - Communication ProtocolsHow services talk: TCP vs UDP underneath, and RPC vs REST on top.9m
- SYSIntermediateMembersSystem Design - Security and TLSTLS encrypts traffic end to end: a handshake exchanges keys, then symmetric crypto seals the stream.7m
- SYSAdvancedMembersSystem Design - Web CrawlerDownload the web page by page: a frontier queue, polite fetching, dedup, and an index.12m
- SYSIntermediateMembersSystem Design - Personal Finance AggregatorPull transactions from many banks, normalize them, and categorize spending.10m
- SYSAdvancedMembersSystem Design - Social GraphModel users and follows as a graph, then traverse it for suggestions and feeds.10m
- SYSAdvancedMembersSystem Design - Key-Value StoreConsistent hashing maps keys to shards so adding a node moves few keys, with quorums for consistency.11m
- SYSAdvancedMembersSystem Design - Sales RankingTurn a stream of orders into a live bestseller list with incremental counters and a top-N computation.10m
- SYSIntermediateMembersOO Design - Parking LotModel a parking lot: levels, spots, vehicles, and tickets, with O(1) spot lookup.9m
- SYSBeginnerMembersOO Design - Deck of CardsModel cards, a deck, hands, and a game - and shuffle correctly with Fisher-Yates.7m
- SYSIntermediateMembersOO Design - Call CenterRoute calls to the first available employee, then escalate up the chain of command.8m
- SYSAdvancedMembersOO Design - Online ChatModel users, conversations, and messages, with fan-out delivery and presence tracking.9m
- SYSIntermediateMembersSystem Design - Back-of-Envelope EstimationEstimate QPS, storage, and latency in your head to sanity-check any design before building.8m
- SYSIntermediateMembersSystem Design - Rate LimiterReject excess traffic with counters and windows - fixed, sliding, and token-bucket strategies compared.9m
- SYSIntermediateMembersSystem Design - Distributed Message QueueDecouple producers from consumers with a durable log - offsets, delivery guarantees, and ordering trade-offs.10m
- SYSIntermediateMembersSystem Design - Proximity Service (Geo-Indexing)Find everything nearby at city scale - geohash grids, cell rings, and the write-heavy reality of moving objects.10m
- SYSAdvancedMembersSystem Design - Undo/Redo & Collaborative EditingCommand stacks for solo undo, then OT and CRDT strategies when many cursors edit one document at once.10m
- SYSIntermediateMembersSystem Design - Notification SystemFan one event out to millions across push, email, and in-app - with preferences, dedupe, and rate caps at every hop.9m