Data Structures & Algorithms Flashcards
Every coding interview tests DSA. 35 must-know concepts from binary search to dynamic programming.
Start studying — completely free
SM-2 spaced repetition · 5 adaptive formats · any device
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.
Topics
Big O, hash tables, linked lists, BFS/DFS, BSTs, heaps, tries, quicksort, mergesort, DP, sliding window, two pointers, backtracking, union-find, topological sort.
Frequently asked questions
Better than grinding LeetCode?
This teaches concepts. LeetCode tests application. Use both — learn patterns here, practice on LeetCode.
Ready to start?
Sign in to begin. No rereading. Just recall.