-
Number of Submatrices That Sum to Target - Subarray target sum properly explained
Array
C++
Hard
Hash Table
Matrix
Prefix Sum
-
Out of Boundary Paths - DFS + Recursive Memoization
C++
Depth-First Search
Dynamic Programming
Medium
Memoization
Recursion
-
Pseudo-Palindromic Paths in a Binary Tree - Simple DFS with palindrome test at leaves
Binary Tree
Bit Manipulation
Breadth-First Search
C++
Depth-First Search
Medium
Tree
-
Insert Delete GetRandom O(1) - Swap with last element
Array
C++
Design
Hash Table
Math
Medium
Randomized
-
Leaf-Similar Trees - Leaf Iterator
Binary Tree
C++
Depth-First Search
Easy
Iterator
Tree
-
Minimum Difficulty of a Job Schedule - Simple concise code for top-down DP with intuition
Array
C++
Dynamic Programming
Hard
Memoization
-
Partition Labels - Greedy logic
C++
Greedy
Hash Table
Medium
String
Two Pointers
-
Minimum Cost to Make Array Equalindromic - Check one palindrome on each side of median
Array
C++
Greedy
Math
Medium
Sorting