403. Frog Jump
2385. Amount of Time for Binary Tree to Be Infected
2385. Amount of Time for Binary Tree to Be Infected
Description
You are given the root of a binary tree with unique values, and an integer start. At minute 0, an infection starts from the node with value start.
871. Minimum Number of Refueling Stops
871. Minimum Number of Refueling Stops
Description
A car travels from a starting position to a destination which is target miles east of the starting position.
2268. Minimum Number of Keypresses
2268. Minimum Number of Keypresses
Description
You have a keypad with 9 buttons, numbered from 1 to 9, each mapped to lowercase English letters. You can choose which characters each button is matched to as long as:
305. Number of Islands II
2589. Minimum Time to Complete All Tasks
2589. Minimum Time to Complete All Tasks
Description
There is a computer that can run an unlimited number of tasks at the same time . You are given a 2D integer array tasks where tasks[i] = [starti, endi, durationi] indicates that the i^th task should run for a total of durationi seconds (not necessarily continuous) within the inclusive time range [starti, endi].
1306. Jump Game III
2097. Valid Arrangement of Pairs
2097. Valid Arrangement of Pairs
Description
You are given a 0-indexed 2D integer array pairs where pairs[i] = [starti, endi]. An arrangement of pairs is valid if for every index i where 1 <= i < pairs.length, we have endi-1 == starti.
2050. Parallel Courses III
Description
You are given an integer n, which indicates that there are n courses labeled from 1 to n. You are also given a 2D integer array relations where relations[j] = [prevCourse<sub>j</sub>, nextCourse<sub>j</sub>] denotes that course prevCourse<sub>j</sub> has to be completed before course nextCourse<sub>j</sub> (prerequisite relationship). Furthermore, you are given a 0-indexed integer array time where time[i] denotes how many months it takes to complete the (i+1)^th course.