eunhanlee.hashnode.devLeetCode 1518. Water Bottles Java SolutionProblem Description Problem: LeetCode 1518. Water Bottles Description: We have numBottles water bottles. We can exchange numExchange empty bottles for one new full water bottle. The goal is to calculate the maximum number of water bottles we can dr...Jul 22, 2024·2 min read
eunhanlee.hashnode.devLeetCode 2582. Pass the Pillow Java SolutionProblem Description Problem: https://leetcode.com/problems/pass-the-pillow/description/ Description: People are standing in a circle numbered from 1 to n. Person 1 holds a pillow and every hour they pass the pillow to the person to their right. If ...Jul 18, 2024·2 min read
eunhanlee.hashnode.devLeetCode 2058. Find the Minimum and Maximum Number of Nodes Between Critical Points Java SolutionProblem Description Problem: LeetCode 2058. Nodes Between Critical Points Description: Given a singly linked list, we need to find the minimum and maximum distance between nodes that are local maxima (a value greater than its neighbors) or local mi...Jul 17, 2024·2 min read
eunhanlee.hashnode.devLeetCode 1701. Average Waiting Time Java SolutionProblem Description Problem: https://leetcode.com/problems/average-waiting-time/ Description: The task is to calculate the average waiting time for all customers, considering each customer's arrival time and cooking time. Each customer can start th...Jul 15, 2024·2 min read
eunhanlee.hashnode.devLeetCode 1598. Crawler Log Folder Java Problem SolutionProblem Description Problem: LeetCode 1598 Description: Calculate the depth of the file system directory based on the given log array. "./" represents the current directory, and "../" represents the parent directory. Approach Idea: Traverse the ...Jul 11, 2024·1 min read