DeriveIt

The right way to prepare for coding interviews.

A better way to solve problems.

NeetCode

A treacherous journey through every problem.

DeriveIt

One simple approach - Recursion.

Simple categories.

We know how difficult it can be to juggle all the ideas that go into a coding interview. That's why we have simple, well-motivated categories that teach you everything you need to know.
Recursion
Recursion
Tree Traversals
Tree Traversals
Graphs
Graphs
Dynamic Programming
Dynamic Programming
Backtracking
Backtracking
Sorted Data Structures
Sorted Data Structures
Single Pass Tricks
Single Pass Tricks
Greedy Problems
Greedy Problems
Data Structure Problems
Data Structure Problems

Developed and reviewed by engineers from these cool places.

cornell
amazon
facebook / meta
google

Solve problems in the right order.

We start with the fundamentals and gradually crank up the difficulty, reaching very advanced concepts. You'll be solving problems you previously thought were hard without even realizing it.
Advanced Dynamic Programming
Heap Data Structure

Data Structures from the ground up.

Want to know where every Data Structure comes from, and when you should use each one? You're in the right place. We're also home to the well-known cheat sheet, Every Data Structure on 1 Page.

Unparalleled organization.

Each group of problems on DeriveIt is highly related. We don't just lump all the problems that have a Tree under a "Trees" category. You'll have a crystal clear picture of exactly what ideas you're practicing in each problem, so that you can remember things better when interview day rolls around.

Be Big O ready.

Every solution has a detailed time and space complexity analysis that even includes the Call Stack. You'll learn unique insights like why recursion usually takes up O(N) space, and why your time complexity is always \ge your space complexity.

Everything you need.

We cover everything you learn from the famous Blind75 and NC150 problem lists, and more. Our experts have curated some of the best practice problems you'll find anywhere.

FAQ