Huachen Wang

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

LeetCode Study Note | Problem 53: Maximum Subarray

Problem Overview Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its s

Administrator Administrator Published on 2025-05-10
Previous Next