Huachen Wang

LeetCode Study Note | Problem 15: 3Sum

✨ Problem Description Given an integer array nums, return all the unique triplets [nums[i], nums[j], nums[k]] such that i ≠ j ≠ k, and nums[i] + nums[

Administrator Administrator Published on 2025-05-15

LeetCode Study Note | Problem 283: Move Zeroes

🧩 Problem Description Given an integer array nums, move all 0’s to the end of it while maintaining the relative order of the non-zero elements. Examp

Administrator Administrator Published on 2025-05-15

LeetCode Study Note | Problem 42: Trapping Rain Water

🔍 Problem Description Given a non-negative integer array height[] representing the elevation map where the width of each bar is 1, compute how much w

Administrator Administrator Published on 2025-05-11