[Problem] Array String Dynamic Programming Intuition Each character of target must match a character in the same position across one of the strings in words. Once a character is used a...
[Problem] Array Dynamic Programming Intuition Using a sliding window approach, we can calculate the sum of consecutive subarrays. And by keeping track of the best sums for one, two, an...
[Problem] Array Binary Search Sliding Window Prefix Sum Intuition Interpret the question as: “Longest subarray with at most k zeroes”. There is NO ACTUAL FLIPPING you need to do. Th...
[Problem] Array Dynamic Programming Intuition View the problem as maximizing values[i] + i + values[j] - j Approach Separate the components: => maxi = values[i] + i => ma...
[Problem] Array Dynamic Programming Backtracking Intuition Each element in the array can either be positive (+num) or negative (-num) to the target. When you have such choices (decisio...
[Problem] Tree Depth-First Search Breadth-First Search Binary Tree Intuition Traversing level-by-level(row) = BFS Approach Traverse using BFS: Use a queue to perform a BFS of the ...
[Problem] Tree Breadth-First Search Binary Tree Intuition Traversing level-by-level = BFS Approach Traverse using BFS: Use a queue to perform a BFS of the tree. For...
[Problem] Array Binary Search Stack Binary Indexed Tree Segment Tree Heap (Priority Queue) Monotonic Stack Intuition The problem revolves around determining the leftmost building where A...
[Problem] Tree Depth-First Search Intuition Given a tree structure with nodes having values. The goal is to maximize the number of valid components we can obtain by removing edges. A c...
[Problem] Tree Depth-First Search Breadth-First Search Binary Tree Intuition We only need to reverse the values at odd levels while maintaining the tree structure. Approach 1. BFS (B...