1102. Path With Maximum Minimum Value
Given an m x n integer matrix grid, return the maximum score of a path starting at (0, 0) and ending at (m - 1, n - 1) moving in the 4 cardinal directions.
1359. Count All Valid Pickup and Delivery Options
Given n orders, each order consists of a pickup and a delivery service.
588. Design In-Memory File System
Design a data structure that simulates an in-memory file system.
3480. Maximize Subarrays After Removing One Conflicting Pair
You are given an integer n which represents an array nums containing the numbers from 1 to n in order. Additionally, you are given a 2D array conflictingPairs, where conflictingPairs[i] = [a, b] indicates that a and b form a conflicting pair.
1857. Largest Color Value in a Directed Graph
There is a directed graph of n colored nodes and m edges. The nodes are numbered from 0 to n - 1.
2276. Count Integers in Intervals
Given an empty set of intervals, implement a data structure that can: