| Random Link ¯\_(ツ)_/¯ | ||
| Jun 6, 2026 | » | Greedy Algorithms
2 min; updated Jun 6, 2026
Sample ProblemYou are given two integer arrays:
Assign cookies such that as many children as possible are satisfied. Each child can receive at most one cookie, and each cookie can be given to only one child. A Greedy Algorithm |
| Jun 3, 2026 | » | Earliest Finish Time for Land and Water Rides
2 min; updated Jun 3, 2026
Problem StatementThere are \(L\) possible land rides and \(W\) possible water rides, with \(1 \le L, W \le 5 \times 10^4\). A tourist must experience exactly one ride from each category, in either order. A ride may be started at its opening time or any later moment. Immediately after finishing one ride, the tourist may board the other if it’s already open or wait until it opens. Return the earliest possible time at which the tourist can finish both rides. ... |