This problem asks you to find the longest common prefix among an array of strings. This can be done by comparing the first characters of each string, then the second characters of each string, and so on until a difference is found or the end of the shortest string is reached.

165

Mar 07
Given two strings, this function will check if one is a permutation of the other.

181

Mar 06
The "Two Sum" problem is a code problem in the "Data Structures and Algorithms" category. Given an array of integers, the goal is to return the indices of the two numbers that add up to a specific target. For example, given nums = [2, 7, 11, 15] and target = 9, the solution would be to return [0, 1] because nums[0] + nums[1] = 2 + 7 = 9.

159

Mar 06
This problem asks for the length of the longest substring without repeating characters. For example, given the string "abcabcbb", the answer would be 3, since the substring "abc " has a length of 3.

165

Mar 06
This problem asks you to find the sum of all elements in an array.

189

Mar 06
Given an array of n integers, the goal is to find the contiguous subarray whose sum is maximum.

169

Mar 06
Given an array of n integers, the maximum sum of any contiguous subarray of the array is the sum of the largest subarray.

160

Mar 05