## Cut all the rods with some length such that the sum of cut-off length is maximized

Given N rods of different lengths. The task is to cut all the rods with some maximum integer height ‘h’ such that sum of cut-off… Read More »

Given N rods of different lengths. The task is to cut all the rods with some maximum integer height ‘h’ such that sum of cut-off… Read More »

Given a list of n-1 integers and these integers are in the range of 1 to n. There are no duplicates in list. One of… Read More »

Given two arrays H and S. The array H[] contains the length of the hypotenuse and the array S[] contains Area of a right-angled triangle.… Read More »

Given n eggs and k floors, find the minimum number of trials needed in worst case to find the floor below which all floors are… Read More »

Given a sorted array and a target value, find the first element that is strictly smaller than given element. Examples: Input : arr[] = {1,… Read More »

Given a preorder traversal of a BST. The task is to find the number of elements less than root. Examples: Input: preorder[] = {3, 2,… Read More »

Given an array of N integers and a number X. The task is to find the index of first element which is greater than or… Read More »

Given array of sorted integer, search key and search preferences find array position. A search preferences can be: 1) EQUAL – search only for equal… Read More »

Given an array of N elements and an element K, find the index of an array element in Java. Examples: Input: a[] = { 5,… Read More »

Binary search is very easy right? Well, binary search can become complex when element duplication occurs in the sorted list of values. It’s not always… Read More »

Recently, BA Continuum India visited our campus for recruitment. There were total 4 rounds. Round 1: This round was a general aptitude test, which consisted… Read More »

Consider you have an infinitely long binary tree having a pattern as below: 1 / \ 2 3 / \ / \ 4 5 6… Read More »

Given an array of positive and negative integers and an integer K. The task is to find the subarray which has its sum closest to… Read More »

Given an array arr[0..n-1] of n integers, find the maximum length subarray such that its first element is greater than or equal to the last… Read More »

Given an array of integers and an integer x. Find length of maximum size subarray having average of integers greater than or equal to x.… Read More »