The problem is to find the first non-repeating character in a string. The input is a string and the output is the first non-repeating character in the string.

227

Oct 22
The "Two Sum" problem asks us to find the indices of two numbers in an array that add up to a specific target. We are given that each input has exactly one solution, and we cannot use the same element twice. An example is provided, where the array is [2, 7, 11, 15] and the target is 9. The solution in this case is [0 , 1], since 2 + 7 = 9.

238

Oct 22
This problem deals with determining whether an array contains duplicates. The function should return true if any element appears more than once in the array, and false if every element is distinct.

180

Oct 21
Given an array of n integers, this code problem finds the contiguous subarray of given length k that has the maximum average value. The output is the maximum average value.

221

Oct 21
Given an array of n integers, find the contiguous subarray of given length k that has the maximum average value. Output the maximum average value.

218

Oct 21
This function takes a sorted array of integers and a target value as input. It returns the index of the target value if it is present in the array, or -1 if it is not .

226

Oct 21
This technical problem asks the programmer to return all possible subsets of a given set of distinct integers. The solution set must not contain duplicate subsets.

242

Oct 21
This problem deals with finding a target value in a sorted array using binary search. If the target value is present in the array, the function should return its index. If the target value is not present in the array, the function should return -1.

220

Oct 20