---
title: "CHAO DU (@chaos789) | Hashnode"
description: "Greetings. Read the latest articles by CHAO DU on Hashnode."
url: "https://hashnode.com/@chaos789"
---

@chaos789

# CHAO DU

@chaos789 · Joined June 2022

Greetings

### [LeetCode 494. Target Sum — 0/1 Knapsack Reframed](https://leetlog-by-chao.hashnode.dev/leetcode-494-target-sum-01-knapsack-reframed?utm_source=hashnode&utm_medium=feed)

Learn how LeetCode 494 Target Sum converts into a 0/1 knapsack subset-sum problem. Includes DP intuition, key edge cases, and an optimized Java solution.

3 min read · [leetlog-by-chao.hashnode.dev](https://leetlog-by-chao.hashnode.dev/leetcode-494-target-sum-01-knapsack-reframed?utm_source=hashnode&utm_medium=feed)

[Dec 3, 2025](https://hashnode.com/posts/leetcode-494-target-sum-01-knapsack-reframed/692fb34228d052863b41456e)

### [LeetCode 1049 – Last Stone Weight II](https://leetlog-by-chao.hashnode.dev/leetcode-1049-last-stone-weight-ii?utm_source=hashnode&utm_medium=feed)

A complete debug log for LeetCode 1049: how to transform the stone-smashing game into a 0-1 knapsack and optimize it to 1D DP.

3 min read · [leetlog-by-chao.hashnode.dev](https://leetlog-by-chao.hashnode.dev/leetcode-1049-last-stone-weight-ii?utm_source=hashnode&utm_medium=feed)

[Dec 2, 2025](https://hashnode.com/posts/leetcode-1049-last-stone-weight-ii/692e8c021f5b78feae751759)

### [LeetCode 416 — Partition Equal Subset Sum (My Debug Log)](https://chaodu.hashnode.dev/leetcode-416-partition-equal-subset-sum-my-debug-log?utm_source=hashnode&utm_medium=feed)

A step-by-step debugging journey solving LeetCode 416, from brute force and greedy attempts to the correct 0/1 knapsack DP solution.

4 min read · [chaodu.hashnode.dev](https://chaodu.hashnode.dev/leetcode-416-partition-equal-subset-sum-my-debug-log?utm_source=hashnode&utm_medium=feed)

[Dec 1, 2025](https://hashnode.com/posts/leetcode-416-partition-equal-subset-sum-my-debug-log/692d36930d028c88fde61fd4)

### [Unique Binary Search Trees (LeetCode 96): A Complete Explanation](https://leetlog-by-chao.hashnode.dev/unique-binary-search-trees-leetcode-96-a-complete-explanation?utm_source=hashnode&utm_medium=feed)

How to count unique BSTs using DP and Catalan numbers. Includes diagrams, explanations, and common beginner mistakes.

6 min read · [leetlog-by-chao.hashnode.dev](https://leetlog-by-chao.hashnode.dev/unique-binary-search-trees-leetcode-96-a-complete-explanation?utm_source=hashnode&utm_medium=feed)

[Nov 28, 2025](https://hashnode.com/posts/unique-binary-search-trees-leetcode-96-a-complete-explanation/69293b24a0b6c7e07fb8640b)

### [LeetCode Daily Log — Integer Break](https://leetlog-by-chao.hashnode.dev/leetcode-daily-log-integer-break?utm_source=hashnode&utm_medium=feed)

A clear explanation of the Integer Break problem using dynamic programming and the math behind why splitting into 3s maximizes product. Includes proofs and

4 min read · [leetlog-by-chao.hashnode.dev](https://leetlog-by-chao.hashnode.dev/leetcode-daily-log-integer-break?utm_source=hashnode&utm_medium=feed)

[Nov 28, 2025](https://hashnode.com/posts/leetcode-daily-log-integer-break/6929284f6dbcfc89f60dcd55)
