## Count even length binary sequences with same sum of first and second half bits

The problem “Count even length binary sequences with same sum of first and second half bits” states that you are given an integer. Now find out the number of ways to construct a binary sequence of size 2*n such that the first half and second half have the same number …

## K maximum sums of overlapping contiguous sub-arrays

Problem Statement   The problem “K maximum sums of overlapping contiguous sub-arrays” states that you are given an array of integers. Find the maximum sum of k-subarrays such that their sum is maximum. These k-subarrays might be overlapping. So, we need to find k-subarrays such that their sum is maximum among …

## Maximum sum bitonic subarray

Problem Statement   An array having n integers is given to us. We need to find the maximum sum bitonic subarray. A bitonic subarray is nothing but just a subarray where the elements are arranged in a specific order. Such that the first elements are in increasing order and then in …

## Print a Binary Tree in Vertical Order

In this problem, we have given a pointer denoting the root of the binary tree and your task is to print the binary tree in the vertical order. Example   Input 1 / \ 2 3 / \ / \ 4 5 6 7 \ \ 8 9 Output 4 2 …

## Insertion Sort

Sort a given unsorted array using the insertion sort algorithm. Input: {9,5,1,6,11,8,4} Output: {1,4,5,6,8,9,11} Theory   Insertion Sort sorts numbers in the same way as we humans sort a set of numbered objects (ex cards) A number is taken from an unsorted array (right subarray) to a position in the sorted …

## Move All the Zeros to the End of the Given Array

Problem Statement   In the given array move all the zeros which are present in the array to the end of the array. Here there is always a way exist to insert all the number of zeroes to the end of the array. Example   Input 9 9 17 0 14 0 … 