Ace your Coding Interview
Get hired by top tech companies with our comprehensive interview preparation.
Get StartedGiven two sorted arrays of integers, find a maximum sum path involving elements of both arrays whose sum is maximum. We can start from either array, but we can switch between arrays only through its common elements.
Given an integer array, find the smallest window sorting which will make the entire array sorted in increasing order.
Given an array constructed from another array by taking the sum of every distinct pair in it, decode the array to get back the original array elements.
Find the largest number possible from a set of given numbers where the numbers append to each other in any order to form the largest number.
Given an array of positive integers, find the smallest subarray’s length whose sum of elements is greater than a given number k.
Given an integer array, find a subarray having a given sum in it.
Given an integer array, find the minimum sum subarray of size k, where k is a positive integer.
Given a binary array, find the maximum sequence of continuous 1’s that can be formed by replacing at most k zeros by ones.
Given an integer array, find all distinct combinations of a given length k, where the repetition of elements is allowed.
Given an integer array, find all distinct combinations of a given length k. The program should print only distinct combinations.
Given a circular integer array, find a subarray with the largest sum in it.
Given an integer array, find a contiguous subarray within it that has the largest sum using Kadane’s algorithm.