This problem involves finding the index of a given target value in a sorted array of integers. If the target is not found, the index where it would be inserted is returned.

212

Oct 12
Given a list of integers, the sum of the integers at even indices is returned. So for the input list [1, 2, 3, 4, 5], the output would be 6 (2 + 4).

237
1

Oct 11
This technical problem deals with finding the shortest path between two nodes in a directed graph. An example input and output is given in the problem description.

231

Oct 09
To reverse a singly linked list, we simply need to iterate through the list and reverse the pointers of each node. This can be done in place, without creating a new list.

184

Oct 05
This problem requires the use of a binary search algorithm to find a target value in a sorted array. If the target value is found, the index of that value is returned. If the target value is not found, -1 is returned.

258

Oct 04
This problem involves searching for a given value in a sorted array of integers. If the value is found, the index of the target value is returned; if not, -1 is returned.

250

Oct 03
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