## Maximum Sum Subarray using Divide & Conquer

Given an array of integers, find maximum sum subarray among all subarrays possible.

Coding made easy

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 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 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.

Given a sorted array of integers and a target value, find out if a target exists in the array or not in O(log(n)) time. If target exists in the array, print index of it.

Given a sorted array of integers and a target, find out if a target exists in the array or not. If target exists in the array, print index of it.