Interview Revision

Data Structures & Algorithms

Master the core patterns required for coding interviews. From Arrays to Dynamic Programming.

Explore Topics

Master core concepts for your next interview

DSA

14 Modules
Pattern
Arrays & Hashing
The foundational tools for a vast category of interview problems.
Beginner friendlyStart
Pattern
Binary Search
Binary Search patterns
Beginner friendlyStart
Pattern
Stacks & Queues
Mechanisms to enforce order and process elements in specific sequences.
Beginner friendlyStart
Pattern
Linked Lists
Test a candidate's ability to manipulate pointers and manage memory references.
Beginner friendlyStart
Pattern
Strings
Often serve as a medium to test other algorithmic patterns.
Beginner friendlyStart
Pattern
Searching & Recursion
Crucial for solving optimization and combinatorial problems.
Beginner friendlyStart
Pattern
Greedy Algorithms
Construct a solution by making a sequence of locally optimal choices.
Beginner friendlyStart
Pattern
Trees
Hierarchical data structures that test recursion and traversal.
Beginner friendlyStart
Pattern
Heaps
A specialized tree-based data structure for efficient min/max retrieval.
Beginner friendlyStart
Pattern
Tries
A specialized tree for efficient storage and retrieval of strings.
Beginner friendlyStart
Pattern
Graphs
The most general data structure, capable of modeling arbitrary relationships.
Beginner friendlyStart
Pattern
DP Part 1
An optimization technique for problems with optimal substructure.
Beginner friendlyStart
Pattern
DP Part 2
The most general data structure, capable of modeling arbitrary relationships.
Beginner friendlyStart
Pattern
DP Part 3
The most general data structure, capable of modeling arbitrary relationships.
Beginner friendlyStart