Largest subarray with given sum: Given an array and a sum k, we need to print the length of the longest subarray that sums to k.
Round 2: Technical Interview
Given an array arr[] of size N, Return the index of any one of its peak elements. An element is called a peak element if its value is not smaller than the value of its adjacent elements(if they exist).
Calculate the diameter of the binary tree: Find the Diameter of a Binary Tree. Diameter is the length of the longest path between any 2 nodes in the tree and this path may or may not pass from the root.
Round 3: Technical Interview
Convert a sorted array to a binary search tree.
Reverse a linked list and a follow-up problem: Given the head of a singly linked list, write a program to reverse the linked list, and return the head pointer to the reversed list.
Round 4: Technical + Managerial Round
What is RDBMS
Questions on os and computer networks
Given 2 numbers, add them without using any arithmetic operator.
Lowest common ancestor in a binary tree: Given a binary tree, Find the Lowest Common Ancestor for two given Nodes (x,y). The lowest common ancestor is defined between two nodes x and y as the lowest node in T that has both x and y as descendants.