Description https://leetcode.com/problems/shortest-path-in-a-grid-with-obstacles-elimination/ You are given an m x n integer matrix grid where each cell is either 0 (empty) or 1 (obstacle). You can move up, down, left,…

Description https://leetcode.com/problems/all-paths-from-source-lead-to-destination/ Given the edges of a directed graph where edges[i] = [ai, bi] indicates there is an edge between nodes ai and bi, and two nodes source and destination of…

Description https://leetcode.com/problems/path-with-minimum-effort/ You are a hiker preparing for an upcoming hike. You are given heights, a 2D array of size rows x…

Description https://leetcode.com/problems/minimum-knight-moves/ In an infinite chess board with coordinates from -infinity to +infinity, you have a knight at square [0, 0]. A knight has 8 possible moves it…

Description https://leetcode.com/problems/sequence-reconstruction/ Check whether the original sequence org can be uniquely reconstructed from the sequences in seqs. The org sequence is a permutation of the…

Description https://leetcode.com/problems/number-of-islands-ii/ You are given an empty 2D binary grid grid of size m x n. The grid represents a map where 0‘s represent…

Description https://leetcode.com/problems/design-add-and-search-words-data-structure/ There is an undirected graph with n nodes, where each node is numbered between 0 and n – 1. You are given a 2D array graph,…

Description https://leetcode.com/problems/clone-graph/ Given a reference of a node in a connected undirected graph. Return a deep copy (clone) of the graph. Each node in…

Description https://leetcode.com/problems/rotting-oranges/ You are given an m x n grid where each cell can have one of three values: 0 representing an empty cell,…

Description https://leetcode.com/problems/accounts-merge/ Given a list of accounts where each element accounts[i] is a list of strings, where the first element accounts[i][0] is a name, and the…