Very easy - 2 puzzles , finding socks pair, hat problem . 1. given an array of positive and negative numbers form an arrray with alternate +ve and -ves 2. replace every element in an array with multiplication of all others without using division operator
Design an image file retrieval API.
Given a seesaw and 8 identical looking balls, find the one heavier ball. Improve your solution as much as possible. Once at the optimal solution, how many balls does this work with?
Sticky Session
1. experiences. 2. a graph related question as follows, later on I found out a tricky solution online. //problem: count islands in a graph // // A graph is a collection of nodes that are connected to each other with // edges. There are N nodes, numbered 1..N. and M edges. Each edge connects // two different node numbers. Here is an example graph with N= 8, M=6: // // 1---2---3 6 8 // | | | // 4---5 7 // // The goal is to count the number of islands in the graph. An island is a // graph of nodes that are connected only to themselves and not to any of the // other nodes in the graph. The above example has three islands. As a node // not connected to anything at all is regarded as it own island. // Implement the function IslandCount() below. The values N and M are passed // in, along with the array E which contains pairs of node numbers that are // connected by edges. The above example has E equal to // // E = { 1,2,2,3, 1,4, 2, 5, 4,5, 6, 7} // // IslandCount() should return the number of islands in the graph.
Datastructure/Algo related white board session. Design related Whiteboard sessions
What's the difference between final, finally & finalize keyword
Implement strstr in C
How will you find or incriminate a thread that is causing heap corruption within a process among different threads.
Find a duplicate number in a given array. The numbers are 1 ... n
Viewing 881 - 890 interview questions