1730. Shortest Path to Get Food
1730. Shortest Path to Get Food
Description
You are starving and you want to eat food as quickly as possible. You want to find the shortest path to arrive at any food cell.
1152. Analyze User Website Visit Pattern
1152. Analyze User Website Visit Pattern
Description
You are given two string arrays username
and website
and an integer array timestamp
. All the given arrays are of the same length and the tuple [username[i], website[i], timestamp[i]]
indicates that the user username[i]
visited the website website[i]
at time timestamp[i]
.
1102. Path With Maximum Minimum Value
1102. Path With Maximum Minimum Value
Description
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.
1905. Count Sub Islands
1359. Count All Valid Pickup and Delivery Options
1359. Count All Valid Pickup and Delivery Options
Description
Given n
orders, each order consists of a pickup and a delivery service.
588. Design In-Memory File System
588. Design In-Memory File System
Description
Design a data structure that simulates an in-memory file system.
37. Sudoku Solver
3480. Maximize Subarrays After Removing One Conflicting Pair
3480. Maximize Subarrays After Removing One Conflicting Pair
Description
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
1857. Largest Color Value in a Directed Graph
Description
There is a directed graph of n
colored nodes and m
edges. The nodes are numbered from 0
to n - 1
.