45. Jump Game II
Problem You are given a 0-indexed array of integers nums of length n. You are initially positioned at nums[0]. Each element n...
42. Trapping Rain Water
Problem Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water ...
321. Create Maximum Number
Problem You are given two integer arrays nums1 and nums2 of lengths m and n respectively. nums1 and nums2 represent the digit...
1719. Number Of Ways To Reconstruct A Tree
Problem You are given an array pairs, where pairs[i] = [xᵢ, yᵢ], and: There are no duplicates. xᵢ < yᵢ Let ways be the n...
2054. Two Best Non-Overlapping Events
Problem You are given a 0-indexed 2D integer array of events where events[i] = [startTimeᵢ, endTimeᵢ, valueᵢ]. The iᵗʰ event ...
2097. Valid Arrangement of Pairs
Problem You are given a 0-indexed 2D integer array pairs where pairs[i] = [startᵢ, endᵢ]. An arrangement of pairs is valid if...