Coding Interview Prep

Keep the fundamentals ready to recall.

Ready-made practice for the Coding Interview Prep. Build recall one short session at a time — no decks to build before you begin.

503 cards·9 decks·Yours for life
or go All-Access →

Flashcards are a memory tool. Learn the material first, then use NoReread to retain it and refresh what you already know. It doesn't replace studying the subject.

Cards are created from publicly available sources and may contain errors. Check anything you rely on against your official materials.

What's inside

Explore the curriculum, one focused deck at a time.

1Complexity, Arrays and Strings56 cards · Complexity, Arrays and Strings: Big-O analysis, arrays, strings, two pointers, sliding window, and prefix sums.2Graphs59 cards · Graphs: graph representations, BFS and DFS, topological sort, shortest paths, union-find, and minimum spanning trees.3Greedy, Bit Manipulation and Math40 cards · Greedy, Bit Manipulation and Math: greedy algorithms, bit manipulation, and number theory and randomized techniques.4Hash Tables, Stacks, Queues and Linked Lists53 cards · Hash Tables, Stacks, Queues and Linked Lists: hash tables, stacks and monotonic stacks, queues and deques, and linked-list techniques.5JavaScript Interview52 cards · Core JavaScript semantics for interviews: closures, prototypes, the event loop, async/await, this binding, hoisting, types & coercion, ES6+, modules, and common gotchas.6Recursion, Backtracking and Dynamic Programming65 cards · Recursion, Backtracking and Dynamic Programming: recursion and divide and conquer, backtracking, and dynamic programming patterns.7Sorting and Searching45 cards · Sorting and Searching: comparison and linear-time sorts, quickselect, binary search patterns, and interval problems.8System Design Fundamentals76 cards · System Design Fundamentals: scaling, caching, databases, replication, sharding, consistency, queues, rate limiting, API design, and classic design problems.9Trees, Heaps and Tries57 cards · Trees, Heaps and Tries: binary trees and traversals, binary search trees and balancing, heaps and priority queues, tries, and range-query trees.
Archived decks · 2Still yours to study

Keep the Coding Interview Prep material fresh.

Start free and study a few minutes a day. $5.99 once, and these 503 cards are yours for life.

or go All-Access →

Technical interview flashcards for software engineers: complexity analysis, core data structures, algorithm patterns, system design, and JavaScript fundamentals. 503 cards in 9 decks. Built from publicly available sources such as MIT OpenCourseWare 6.006 and 6.046J (algorithms) and MIT 6.5840 (distributed systems) course materials. Flashcards are a memory-retention tool, not a replacement for practice solving problems.