Given a 2D array of integers, find the longest path of consecutive integers starting from the top left corner of the array. The path can move in 4 directions: up, down, left , or right.

250

Oct 02
The twoSum function should return the indices of two numbers in an array that add up to a specific target number.

226

Oct 01
This problem deals with finding a target integer within a large array of integers. The function should return the index of the target integer if it is found, or -1 if it is not found .

221

Oct 01
This problem deals with finding the shortest path between two vertices in a graph. A data structure is needed that can efficiently find this path.

228

Oct 01
Given a 2D array of integers, this problem looks for the longest path from the top left to the bottom right where each step only visits cells with values greater than or equal to the current cell.

235

Oct 01
This problem asks for the shortest path between two cities, given a list of airline flights. This can be solved using a graph data structure, where the nodes represent cities and the edges represent flights between them.

147

Oct 01
This problem is about finding the shortest path between two nodes in a graph. This can be done using a variety of algorithms, such as Dijkstra's algorithm or A*.

208

Oct 01
This problem asks for all possible permutations of a set of distinct integers. The input is a list of distinct integers, and the output is a list of all possible permutations of those integers .

213

Oct 01