Closest Dessert Cost
LeetCode problem #1774
Sum of Mutated Array Closest to Target
LeetCode problem #1300
Dynamic Programming
Master dynamic programming patterns and optimization techniques.
0/1 Knapsack
Find maximum value that can be obtained with given weight capacity
Celebrity Problem
Find the celebrity in a party of n people using the minimum number of questions.
Connect Ropes with Minimum Cost
Connect ropes with minimum cost using greedy approach with heap
Dataflow Engines
Apache Spark, Flink batch, and modern dataflow architectures
Distributed Join Algorithms
Sort-merge, hash, and broadcast joins in distributed systems
Furthest Building You Can Reach
Find furthest building reachable using optimal allocation of bricks and ladders
House Robber
Find maximum amount that can be robbed without robbing adjacent houses
Longest Increasing Subsequence
Find the length of the longest increasing subsequence in an array
Maximize Sum After K Negations
Maximize array sum by flipping signs of k elements using greedy heap approach
Minimum Number of Refueling Stops
Find minimum refueling stops to reach target using greedy max-heap approach