Medium on hungln

Leetcode 799: Champagne Tower

Sat, 14 Feb 2026 16:22:09 +0700

Approach: Simulation

Intuition

In this problem, instead of simulating the final amount of champagne in each glass, we focus on the amount of champagne that flows through each glass. Any amount exceeding one unit is considered excess and is split equally between the two glasses in the row below (bottom-left and bottom-right). For example, if 10 units are poured into the top cup, 1 unit is retained and the remaining 9 units are distributed—4.5 units to each glass directly below.

Leetcode 3713: Longest Balanced Substring I

Thu, 12 Feb 2026 10:27:07 +0700

#3713Longest Balanced Substring I Medium →

Approach: Brute-Force Enumeration + Frequency Counting

Intuition

The goal is to indentify the longest balanced substring within string s. A substring is called balanced if all the distinct characters in the substring appears the same number of times. My approach exhaustively explores all possible substrings to track the maximum length encountered.

Leetcode 1382: Balance a Binary Search Tree

Mon, 09 Feb 2026 11:24:53 +0700

#1382Balance a Binary Search Tree Medium →

Overview

The problem asks us to balance a binary search tree (BST) such that the height of the tree is minimized. This means that for every node in the tree, the height of its left subtree and the height of its right subtree should differ by at most 1.