Given an array of n integers, this problem looks for the contiguous subarray of length k with the maximum sum.
Given a string, the longest substring without repeating characters is found.
This problem asks you to write a function that takes in an array of integers and an integer k, and returns the sum of the k largest integers in the array.
This problem asks us to find the maximum sum of a contiguous subarray of length k in an array of n integers. For example, given the array [5, 2, -1, 7, 4, 3, -2] and k = 3, the maximum sum would be 12 (from the subarray [7, 4, 3]).
This problem is about checking if a given string is a permutation of a palindrome. A palindrome is a word or phrase that is the same forwards and backwards, and a permutation is a rearrangement of letters. The palindrome does not need to be limited to just dictionary words.
Given an array of n integers, this problem seeks to find the contiguous subarray whose sum is maximum.
The sum of the elements in an array is equal to the sum of the first element in the array plus the sum of the remaining elements in the array.
This problem is about finding the first non-repeating character in a given string. If there is no such character, the function should return -1.