# Tag Archives: Flipkart

Given two values k1 and k2 (where k1 < k2) and a root pointer to a Binary Search Tree. Print all the keys of the… Read More
Write a SortedMerge() function that takes two lists, each of which is sorted in increasing order, and merges the two together into one list which… Read More
Given a binary tree, write a function to get the maximum width of the given tree. Width of a tree is maximum of widths of… Read More
The problem is opposite of this post. We are given a stack data structure with push and pop operations, the task is to implement a… Read More
Inversion Count for an array indicates – how far (or close) the array is from being sorted. If the array is already sorted, then… Read More
Write a function to print spiral order traversal of a tree. For below tree, function should print 1, 2, 3, 4, 5, 6, 7.    … Read More
Level order traversal of a tree is breadth first traversal for the tree.  Level order traversal of the above tree is 1 2 3 4… Read More
An element in a sorted array can be found in O(log n) time via binary search. But suppose we rotate an ascending order sorted… Read More
Given a singly linked list, find the middle of the linked list. For example, if the given linked list is 1->2->3->4->5 then the output should… Read More
Write an efficient program to find the sum of contiguous subarray within a one-dimensional array of numbers that has the largest sum.    Recommended: Please… Read More
Write a program that, given an array A[] of n numbers and another number x, determines whether or not there exist two elements in A[]… Read More