--- title: "Han (@EunHaSu) | Hashnode" description: "Java, Android, Algorithm. Read the latest articles by Han on Hashnode." url: "https://hashnode.com/@EunHaSu" --- @EunHaSu # Han @EunHaSu · VA, US · Joined April 2022 Java, Android, Algorithm ### [LeetCode 1518. Water Bottles Java Solution](https://eunhanlee.hashnode.dev/leetcode-1518-water-bottles-java-solution?utm_source=hashnode&utm_medium=feed) Problem 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... 2 min read · [eunhanlee.hashnode.dev](https://eunhanlee.hashnode.dev/leetcode-1518-water-bottles-java-solution?utm_source=hashnode&utm_medium=feed) [Jul 22, 2024](https://hashnode.com/posts/leetcode-1518-water-bottles-java-solution/669e741f92e82acaed4b92f5) ### [LeetCode 2582. Pass the Pillow Java Solution](https://eunhanlee.hashnode.dev/leetcode-2582-pass-the-pillow-java-solution?utm_source=hashnode&utm_medium=feed) Problem 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 ... 2 min read · [eunhanlee.hashnode.dev](https://eunhanlee.hashnode.dev/leetcode-2582-pass-the-pillow-java-solution?utm_source=hashnode&utm_medium=feed) [Jul 18, 2024](https://hashnode.com/posts/leetcode-2582-pass-the-pillow-java-solution/66991fd250a513f00db1d083) ### [LeetCode 2058. Find the Minimum and Maximum Number of Nodes Between Critical Points Java Solution](https://eunhanlee.hashnode.dev/leetcode-2058-find-the-minimum-and-maximum-number-of-nodes-between-critical-points-java-solution?utm_source=hashnode&utm_medium=feed) Problem 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... 2 min read · [eunhanlee.hashnode.dev](https://eunhanlee.hashnode.dev/leetcode-2058-find-the-minimum-and-maximum-number-of-nodes-between-critical-points-java-solution?utm_source=hashnode&utm_medium=feed) [Jul 17, 2024](https://hashnode.com/posts/leetcode-2058-find-the-minimum-and-maximum-number-of-nodes-between-critical-points-java-solution/6697f12089f1c2258283d259) ### [LeetCode 1701. Average Waiting Time Java Solution](https://eunhanlee.hashnode.dev/leetcode-1701-average-waiting-time-java-solution?utm_source=hashnode&utm_medium=feed) Problem 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... 2 min read · [eunhanlee.hashnode.dev](https://eunhanlee.hashnode.dev/leetcode-1701-average-waiting-time-java-solution?utm_source=hashnode&utm_medium=feed) [Jul 15, 2024](https://hashnode.com/posts/leetcode-1701-average-waiting-time-java-solution/66958bd4b01bfca5dce5c53c) ### [LeetCode 1598. Crawler Log Folder Java Problem Solution](https://eunhanlee.hashnode.dev/leetcode-1598-crawler-log-folder-java-problem-solution?utm_source=hashnode&utm_medium=feed) Problem 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 ... 1 min read · [eunhanlee.hashnode.dev](https://eunhanlee.hashnode.dev/leetcode-1598-crawler-log-folder-java-problem-solution?utm_source=hashnode&utm_medium=feed) [Jul 11, 2024](https://hashnode.com/posts/leetcode-1598-crawler-log-folder-java-problem-solution/66902e58210dac663590ebbc)