Given an array containing only 0s and 1s, find the largest subarray which contain equal no of 0s and 1s. Expected time complexity is O(n).
Given a Binary Tree, find vertical sum of the nodes that are in same vertical line. Print all sums through different vertical lines.
Given two arrays: arr1[0..m-1] and arr2[0..n-1]. Find whether arr2 is a subset of arr1 or not. Both the arrays are not in sorted order. It… Read More »
Write a C program that, given an array A of n numbers and another number x, determines whether or not there exist two elements in… Read More »
Write an efficient C function to return maximum occurring character in the input string e.g., if input string is “test” then function should return ‘t’.… Read More »