2-D Dynamic Programming

#127 — Unique Paths

Medium 3 micro drills

Advanced Graphs

#100 — Flood fill

Easy 1 micro drill

Advanced Trees

#90 — Diameter of binary tree

Easy 3 micro drills

Arrays & Strings

#1 — Reverse array in-place

Easy 3 micro drills

Backtracking

#76 — Letter combinations of phone

Medium 3 micro drills

Binary Search

#51 — Binary search template

Easy 3 micro drills

Bit Manipulation

#83 — Count set bits

Easy 3 micro drills

Dynamic Programming

#63 — Climbing stairs

Easy 1 micro drill

Graphs

#42 — DFS iterative

Easy 3 micro drills

Greedy

#71 — Best time to buy/sell stock

Easy 3 micro drills

Hash Maps

#23 — Two sum (unsorted)

Easy 3 micro drills

Heaps

#57 — Min-heap push and pop

Easy 3 micro drills

Intervals

#114 — Meeting Rooms

Easy 3 micro drills

Linked Lists

#9 — Insert at position k

Easy 3 micro drills

Math & Geometry

#120 — Happy Number

Easy 2 micro drills

Recursion

#47 — Fibonacci (memoized)

Easy 1 micro drill

Sliding Window

#101 — Best Time to Buy and Sell Stock

Easy 3 micro drills

Sorting

#29 — Insertion sort

Easy 3 micro drills

Stacks & Queues

#19 — Evaluate postfix expression

Easy 3 micro drills

Trees

#34 — BST insert

Easy 3 micro drills

Tries

#107 — Implement Trie / Prefix Tree

Medium 3 micro drills

Two Pointers

#126 — Remove Duplicates from Sorted Array

Easy 3 micro drills