Dec 3, 2025 · 3 min read · This post solves LeetCode 494. Target Sum by converting it into a subset sum / 0-1 knapsack counting problem. Problem Summary You are given an array nums and a target.By placing '+' or '-' in front of each number, you create an expression such as: +...
Join discussionDec 2, 2025 · 3 min read · 1. Problem Overview We are given an array stones[i] representing weights. Each turn: Pick two stones x ≤ y if x == y: both vanish else: new stone = y - x At most one stone remains.Return the smallest possible final weight. Example: Input: [2,7,...
Join discussionDec 1, 2025 · 4 min read · This problem looks simple at first, but it actually teaches you one of the most important dynamic programming patterns:subset sum = 0/1 knapsack. Here is my complete debug journey: from wrong brute force → wrong greedy → correct DP. 1. First Attempt...
Join discussionAug 3, 2025 · 2 min read · Dynamic Programming (DP) is a fundamental technique in algorithm design, used to solve problems by breaking them into smaller, overlapping subproblems. Two classic examples that illustrate its power are the 0/1 Knapsack Problem and the Longest Increa...
Join discussion
Jun 19, 2025 · 9 min read · 🧠 What is Dynamic Programming? Dynamic Programming (DP) is a powerful algorithmic technique that merges the correctness of complete search with the efficiency of greedy algorithms. It is especially useful when a problem can be broken down into overl...
CChinonso commented
Nov 17, 2024 · 4 min read · We are highlighting the differences between the 0-1 Knapsack Problem and the Extended Greedy Knapsack (ExtGreedyKS) Algorithm: Aspect0-1 Knapsack ProblemExtGreedyKS Algorithm DefinitionAn optimization problem where you select a subset of item...
Join discussion
May 21, 2023 · 4 min read · The 0-1 Knapsack is a classical DP problem that is asked in interviews. Simply put, we are given a set of values and their corresponding weights. We need to determine the items to include in a knapsack so that the sum of those values/weights is the m...
Join discussion