-
Parallel Courses II - DFS + DP + Bitmasking
Bit Manipulation
Bitmask
C++
Combinatorics
Depth-First Search
Dynamic Programming
Graph
Hard
-
Validate Binary Tree Nodes - DFS solution
Binary Tree
Breadth-First Search
C++
Depth-First Search
Graph
Medium
Tree
Union Find
-
Maximum Number of Jumps to Reach the Last Index - DP based solution
Array
C++
Dynamic Programming
Medium
Memoization
Recursion
-
Unique Binary Search Trees II - Recursion and memoization DP
Backtracking
Binary Search Tree
Binary Tree
C++
Dynamic Programming
Medium
Memoization
Recursion
Tree
-
Special Permutations - DP with bitmask
Array
Bit Manipulation
Bitmask
C++
Dynamic Programming
Medium
Memoization
Recursion
-
Valid Number - DFA using hashmap
C++
Hard
Hash Table
String
-
Movement of Robots - Collision means nothing
Array
Brainteaser
C++
Math
Medium
Prefix Sum
Simulation
Sorting
-
Maximum Level Sum of a Binary Tree - BFS in Java
Binary Tree
Breadth-First Search
Depth-First Search
Java
Medium
Tree