CareerCup

Given two sorted arrays A and B that may have repeated elements. Form a new sorted array C that contains the elements of A and B [Condition : You are not allowed to merge the two arrays and then sort. ]

Given an array , find the element (say X) that has all the elements less that it to its left side and all the elements greater to it on its right side.
The left and right elements of X need not be in sorted form.

Find the maximum consecutive 1's in an array of 0's and 1's.
Example:
a) 00110001001110 - Output :3 [Max num of consecutive 1's is 3]
b) 1000010001 - Output :1 [Max num of consecutive 1's is 1]

Write test cases on Whatsapp group chat