## Arrays

##### Longest Common Prefix in an Array of Strings

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.

146
Mar 07
##### Permutation Check

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

163
Mar 06
##### Array Sum

This problem asks you to find the sum of all the elements in an array. For example, given the array [1, 2, 3, 4, 5], the sum would be 15 .

162
Mar 06
##### Two Sum

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.

142
Mar 06
##### Length of longest substring without repeating characters

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.

145
Mar 06
##### Sum of array elements

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

173
Mar 06
##### Find the Maximum Sum of a Contiguous Subarray

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

151
Mar 06
##### Maximum Sum of Contiguous Subarray

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

143
Mar 05