Algorithm Interview Questions

“What are lists, binary search trees, complexity and big oh notation. What is the complexity of various operations, insertion, deletion, search in a BST and Linked list”

Answer Question

“Reverse a singly linked list”

Answer Question

“If you have a file containing millions of integers, how would you sort the data in the file using extremely limited resources, such a s 1GB of memory?”

View Answers (4)

“if you are asked to build a simple calculator, what do you plan to do?

example input - "1+2*3/(5-4)-6 "
output - "1"

(coded solution is preferred).”

Answer Question

“int Solve(string str);

Given the signature above, implement the simplest method that returns the results of the following arguments:

1. “3+5” (8)
2. “10+2-8” (4)
3. “5+10*3” (35)
4. “3+5--6" (14)”

View Answers (2)

“Given an XML file of the world,where the sub-nodes would be the countries, their sub-nodes being the States/Regions n leafs being the cities, and given 2 nodes, how would you find the most common sub-node to both the given nodes.
Eg:
1)
Node1- New Delhi
Node2-San Francisco
Output-Node for World
2)
Node 1-Beijing
Node 2-Shanghai
Output- Node for China(not world)”

View Answers (1)

“Explain few sorting algorithm. What are their complexities ?”

View Answers (1)

“Given the daily values of a stock, find how you can lose the most with one buy-sell trading.”

View Answers (11)

“Given two sorted integer arrays, write an algorithm to get back the intersection.”

View Answers (5)