Echo's Home

1199. Minimum Time to Build Blocks

Posted on 2025-03-27 Edited on 2025-06-14 In Leetcode

Description

You are given a list of blocks, where blocks[i] = t means that thei-th block needstunits of time to be built. A block can only be built by exactly one worker.

826. Most Profit Assigning Work

Posted on 2025-03-27 Edited on 2025-06-14 In Leetcode

826. Most Profit Assigning Work

Description

You have n jobs and m workers. You are given three arrays: difficulty, profit, and worker where:

1235. Maximum Profit in Job Scheduling

Posted on 2025-03-27 Edited on 2025-06-14 In Leetcode

1235. Maximum Profit in Job Scheduling

Description

We have n jobs, where every job is scheduled to be done from startTime[i] to endTime[i], obtaining a profit of profit[i].

1447. Simplified Fractions

Posted on 2025-03-27 Edited on 2025-06-14 In Leetcode

1447. Simplified Fractions

Description

Given an integer n, return a list of all simplified fractions between 0 and 1 (exclusive) such that the denominator is less-than-or-equal-to n. You can return the answer in any order .

1166. Design File System

Posted on 2025-03-27 Edited on 2025-06-14 In Leetcode

1166. Design File System

Description

You are asked to design a file systemthat allows you to create new paths and associate them with different values.

1117. Building H2O

Posted on 2025-03-27 Edited on 2025-06-14 In Leetcode

1117. Building H2O

Description

There are two kinds of threads: oxygen and hydrogen. Your goal is to group these threads to form water molecules.

1188. Design Bounded Blocking Queue

Posted on 2025-03-27 Edited on 2025-06-14 In Leetcode

1188. Design Bounded Blocking Queue

Description

Implement a thread-safe bounded blocking queue that has the following methods:

365. Water and Jug Problem

Posted on 2025-03-23 Edited on 2025-06-14 In Leetcode

365. Water and Jug Problem

Description

You are given two jugs with capacities x liters and y liters. You have an infinite water supply. Return whether the total amount of water in both jugs may reach target using the following operations:

3466. Maximum Coin Collection

Posted on 2025-03-23 Edited on 2025-06-14 In Leetcode

3466. Maximum Coin Collection

Description

Mario drives on a two-lane freeway with coins every mile. You are given two integer arrays, lane1 and lane2, where the value at the i^th index represents the number of coins he gains or loses in the i^th mile in that lane.

137. Single Number II

Posted on 2025-03-23 Edited on 2025-06-14 In Leetcode

137. Single Number II

Description

Given an integer array nums where every element appears three times except for one, which appears exactly once . Find the single element and return it.