|
How would you find the nth to last element in a linked list in a single traversal of the list?
http://linkmingle.com/user/interview_questions/ama
created by interview_questions on 2008-05-29 22:02:58
|
|
How would you design the data structures for Notepad? How will make insertion and deletion efficient for significantly large files
http://linkmingle.com/details/807
created by interview_questions on 2008-05-29 22:20:45
|
|
You have an array of integers of size N.Given a number X how will you find whether 2 numbers exists in the array whose sum is x?.
A. When N is a small number (10k)
B. When N is huge (1Million)
http://linkmingle.com/details/806
created by interview_questions on 2008-05-29 22:11:52
|
|
How will you convert a relative path to absolute path. What datasctructers will you use?
Example:
Input: /home/syam/../syam/new/world/./../
Output: /home/syam/new
http://linkmingle.com/details/804
created by interview_questions on 2008-05-29 21:31:48
|
|
For a general tree, print all the nodes level by level. What all datastructures will be needed for this?.What is the time and space compexity.
http://linkmingle.com/details/803
created by interview_questions on 2008-05-29 21:03:28
|
|
Design an algorithm to find duplicate entries in an array
http://linkmingle.com/details/681
created by interview_questions on 2008-05-19 02:54:35
|
|
You have a file with million number of lines each line with million characters. You have all the practical limitations of a PC Program. You have all Java/C++ API's at your control. All lines are different except 2,which are exactly identical. Find the 2 line numbers, which are identical using minimum time and space complexity.
http://linkmingle.com/details/541
created by interview_questions on 2008-05-08 22:11:40
|
|
This was asked in one of the Amazon phone screening.
You have a General n-ary tree of k levels. There are total of N nodes in the tree.
How will you design an algorithm, which will save the tree to a file and reconstruct the whole tree from the saved file later?
Design an algorithm which require
1. Least amount of CPU time.
2. Least amount of file space.
For an N node tree what’s the minimum and maximum file space required?.
Please make necessary assumptions.
http://linkmingle.com/details/533
created by interview_questions on 2008-05-08 08:56:43
|
IndiaDiscuss.com : Social Bookmarkings and News Networking Site for India
RSS
Save Link 
Create/Add to List
