rahulm
BAN USER- 0of 0 votes
AnswersFind the character that has maximum frequency in an array of characters. If n is small and dealing with unicode char-space, extra space for hashtable is overhead, can you avoid?
- rahulm in United States for RCX| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer - 0of 0 votes
AnswersGave a puzzle - placed two robots and a sensor on the line, write code that will be executed on both machines and make them meet.
- rahulm in United States for RCX| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer - 0of 0 votes
AnswersCan you mention any issues that you debugged earlier and thought was tough?
- rahulm in United States for RCX| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer - 0of 0 votes
AnswersGiven a binary tree
- rahulm in United States for RCX
struct Node {
Node* leftChild;
Node* rightChild;
Node* nextRight;
}
Populate the nextRight pointers in each node.| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer - 0of 0 votes
AnswersA kidnapper wants to write a ransom note. He'll do so by cutting character/words from a magazine. Given a note and the magazine (both in form of strings), find out if the note can be formed from the magazine.
- rahulm in United States for RCX| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer - 0of 0 votes
AnswersPrint all the paths from the root to the leaf in a tree
- rahulm in United States for RCX| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Trees and Graphs - 0of 0 votes
AnswersGiven a sorted array, construct a balanced BST.
- rahulm in United States for RCX| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Trees and Graphs - 0of 0 votes
AnswersWhat happens after www.amazon.com is typed by customer?
- rahulm in United States for RCX| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer - 0of 0 votes
AnswersI showed the feature 'Customers who bought also bought' on amazon.com, and asked to design and implement.
- rahulm in United States for RCX
Q. What if memory is not sufficient?
Q. How do DB tables look like?
Q. Can you state what all components are present in the system and how does the control flow after webserver receives the request?
Q. If you use multiple DB calls for every request, it may be very inefficient as you might be serving millions of requests. can you improve?| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Large Scale Computing - 0of 0 votes
AnswersGiven a binary tree where each node contains an integer value and a value k, print all paths which sum upto this value k
- rahulm in United States for RCX| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Trees and Graphs - 0of 0 votes
AnswersQ. Given a singly link list. Tell if the word in the LL is a palindrome or not.
- rahulm in India for RCX| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer - 0of 0 votes
AnswersDesign Online movie ticket system. How can you make this website faster. What would would you cache?
- rahulm in United States for RCX| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Large Scale Computing - 0of 0 votes
AnswersQ. How will you implement the locker management system? Insertion and retrieval?
- rahulm in India for RCX
Q. Given 3 kind of lockers of size S,M,L. How will you store the data?
Q. A kidnapper wants to write a ransom note. He'll do so by cutting character/words from a magazine. Given a note and the magazine (both in form of strings), find out if the note can be formed from the magazine.
Q. Given a binary tree
struct Node {
Node* leftChild;
Node* rightChild;
Node* nextRight;
}
Populate the nextRight pointers in each node.
Q. Semaphores/Mutex/deadlocks
Q. Can you mention any issues that you debugged earlier and thought was tough?
Q. Polymorphism? object memory layout?
Q. Can you explain how the system works internally when user types www.amazon.com?
Q. Gave a puzzle - placed two robots and a sensor on the line, write code that will be executed on both machines and make them meet.
Q. Find the character that has maximum frequency in an array of characters.
Q. If n is small and dealing with unicode char-space, extra space for hashtable is overhead, can you avoid?
Q. O(n) is also long time if I am processing hugh amount of data, assume several TB. Can you improve the run time performance?
Q. Lets assume you have much more data to process and you have a server farm to process this. Data could be streaming as well.| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer