|
You are given a linked list. Each node is of type Node and has variables next and val. Given head of such a linked list how will you remove any loop if exist in the linked list.Code should execute in O(n) time and should only use 2 extra pointers.
http://linkmingle.com/details/933
created by interview_questions on 2008-06-08 23:25:37
|
|
How do you convert a decimal number to its hexa-decimal equivalent.Give a C code to do the same
http://linkmingle.com/details/932
created by interview_questions on 2008-06-08 22:30:58
|
|
Write a program to convert a decimal number to its hexa-decimal equivalent
http://linkmingle.com/details/896
created by interview_questions on 2008-06-06 02:36:08
|
|
Write a function to find the middle node of a single link list.
http://linkmingle.com/details/887
created by interview_questions on 2008-06-05 07:04:58
|
|
Suppose we have N companies, and we want to eventually merge them into one big company. How many ways are there to merge?
http://linkmingle.com/details/884
created by interview_questions on 2008-06-05 05:26:29
|
|
Given that you have one string of length N and M small strings of length L . How do you efficiently find the occurrence of each small string in the larger one ?
http://linkmingle.com/details/883
created by interview_questions on 2008-06-05 04:41:26
|
|
How do you find out the fifth maximum element in an Binary Search Tree in efficient manner.
http://linkmingle.com/details/882
created by interview_questions on 2008-06-05 04:29:05
|
|
There is an array A[N+1] of N integers. You have to compose an array Output[N+1] such that Output[i] will be equal to the productof all the elements of A[] except A[i].
Example:
INPUT:[4, 3, 2, 1, 2]
OUTPUT:[12, 16, 24, 48, 24]
Solve it without division operator and in O(n) with out using division.
http://linkmingle.com/details/865
created by interview_questions on 2008-06-04 23:58:34
|
|
Technical & HR Interview Questions of Google,Microsoft,Yahoo and many more Companies.
http://placementsindia.blogspot.com
created by interview_questions on 2008-06-04 23:21:13
|
|
Here are some questions I got on my first interview with Google
http://alien.dowling.edu/~rohit/wiki/index.php?tit
created by interview_questions on 2008-06-04 23:15:38
|