Search for a command to run...
Articles tagged with #algorithms
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,...
This article explains the correct dynamic programming solution for LeetCode 96: Unique Binary Search Trees.I also document a common mistake that many learners make, including myself: trying to derive dp[n] by inserting a new node into all BSTs of siz...
https://leetcode.cn/problems/integer-break/ Date: 2025-11-28Difficulty: MediumTopics: Dynamic Programming, MathStatus: Solved 1. Problem Summary Given an integer n, split it into at least two positive integers such that the product of these integers...
🌟 Introduction This is one of the cleanest interval-greedy problems on LeetCode. You’re given a list of horizontal balloon ranges on the x-axis. If you shoot an arrow at position x, it will burst every balloon whose interval contains x. Your goal is...
Tags: leetcode, algorithms, backtracking, javaMeta description: Clean Java backtracking for LeetCode 39 (Combination Sum). Includes pruning, complexity notes, and a decision-tree diagram to visualize the DFS search. 🧠 Problem Given an array of dis...
📌 Problem Recap We are given the root of a Binary Search Tree (BST).Goal → return the minimum absolute difference between values of any two different nodes. Constraints: 2 ≤ n ≤ 10^4 0 ≤ val ≤ 10^5 Example: Input: root = [4,2,6,1,3] Output: 1 ...