Software Developer interview questions – page 28

Given a cordinate system in which there are n points. you have to calculate the m minimum points from some origin point. Suggest a data structure for this

Design the most optimal data structure for a never ending stream of numbers. It should be optimized for insertion, deletion, searching, finding kth largest and kth smallest

Reverse a binary search tree in such a manner so that parent child relationship maintained and left child become right child and vice versa

Find the minimum and maximum element in stack in O(1)

given an array find the next minimum element in array for each element. for example if give array is 4,2,1,5,3 resultant array would be 2,1,-1,3,-1

Write a recursive routine to calculate a ^ n

Design the most optimal data structures for an LRU cache

Convert a sorted array to balanced binary search tree

Reverse a singly linked list in groups of k in­place

Design the most optimal data structure for storing a word and its meaning. Note that a word could have multiple meanings

Given a bst. Replace the value in each node with sum of all the nodes which have values greater than the node itself

No of combinations of moves for knight in chess board are given return total possible positions

Little discussion on intern project and then discussion on java project

Multiple requests for storing multiple files on a server. How to keep them mutually exclusive?

Write COMPLETE code for implementing a hash table?

What is paging. what is virtual memory and discussion on why do we have virtual memory?

Inside a system with 4 gb ram OS only uses around 3.2 gb. Why is rest of the memory lying waste?

A LONG discussion on implementing a T-9 dictionary in a mobile

An array is given which may be any of the 4 cases a.) completely increasing b.) completely decreasing c.) decreasing then increasing d.) increasing then decreasing. Find max in the array. o(log n) solution. Then o(1) solution for 3 cases out of these

How to merge k sorted arrays of n length and discussion on its complexity?

How to identify that if a tree is a bst or not?

Discussion about the java project

Shortest path in maze and then discussion on it. Maze was modified into a n-dimension maze. complete code for 2-d maze

A person can take one or two steps at a time. Find the number of ways in which n steps can be travelled

Take a infix expression as input and print its postfix expression

Given a table m*n , find the number of ways of reaching from one corner to opposite corner, if a person can only move in two directions( towards the goal)

Replace every element in array with its closest maximum element in right. As amortized analysis was involved he asked for mathematical proof

Asked to design distributed Hashtable . Discussed pros and cons

How will you resolve conflicts with your manager

How will you resolve conflicts with your team mates