Given an array of integers, find maximum sum subarray among all subarrays possible.
Given an array, find peak element in it. A peak element is an element that is greater than its neighbors.
Given a sorted binary array, efficiently find the number of 1’s in it.
Given a nearly sorted array such that each of the N elements may be misplaced by no more than one position from the correct sorted order, efficiently search a given element in it. Report if the element is not present in the input array. An element at index i in correct sorted order can …
Given a sorted array of integers, find floor and ceil of a given number in it. The floor and ceil map the given number to the largest previous or the smallest following integer, respectively.
Given a sorted array of distinct non-negative integers, find smallest missing element in it.
Given a sorted array of integers containing duplicates, count occurrences of a number provided. If the element is not found in the array, report that as well.
Given a string, print it in reverse using recursion. For example, consider the input string “Techie Delight”. The output should be “thgileD eihceT”.
Given a sorted array of integers, find index of first or last occurrence of a given number. If the element is not found in the array, report that as well.
Given a circular sorted array of integers, search an element in it. Assume there are no duplicates in the array and the rotation is in anti-clockwise direction.
Given a sorted array of distinct positive integers, print all triplets that forms Arithmetic Progression with integral common difference. An Arithmetic Progression is a sequence of numbers such that the difference between the consecutive terms is constant. For instance, the sequence 5, 7, 9, 11, 13, 15, . . . is an arithmetic progression …
Given a circularly sorted array of integers, find the number of times the array is rotated. Assume there are no duplicates in the array and the rotation is in anti-clockwise direction.