CareerCup

  • Questions
  • Forum
  • Resume Tips
  • RSS
  • Sign In

Amazon Interview Question for Software Engineer / Developers


Team: Kindle-Periodicals
Country: India
Interview Type: In-Person
More Questions from This Interview



Comment hidden because of low score. Click to expand.
1
of 1 vote

Using link list while keeping one pointer at tail
InsertAtTail and GetTail will be in O(1)

While DeleteNodeAtPosition will take O(n) time in worse case.

The benefit of using link list over array is to get dynamic size

- NaiveCoder March 18, 2012 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 votes

We can delete at position "i" in O(1) time...

ptr = head + (i-1)*sizeof(node);

now delete ptr->next node....
have to do some error checking also

- Rajx March 20, 2012 | Flag
Comment hidden because of low score. Click to expand.
0
of 0 votes

I think position here refers to the address of the node. Hence deletenodeatposition will also take O(1).

- mariner March 23, 2012 | Flag
Comment hidden because of low score. Click to expand.
0
of 0 vote

We can use combination of linked list and Hashtable ?

- Anonymous March 18, 2012 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 votes

Hash table can only delete nodes with a specific value -- not nodes at a specific position.

- eugene.yarovoi March 22, 2012 | Flag
Comment hidden because of low score. Click to expand.
0
of 0 vote

I think it's wrong, deleting at position N can't take O(1). The reason since struct nodes are not continous memory
ptr = head +(i-1)*sizeof(node);
will not give the ith node pointer .

- Invincible April 01, 2012 | Flag Reply


Add a Comment
Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Learn More

Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.

Learn More

Resume Review

Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.

Learn More

Mock Interviews

Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.

Learn More