CareerCup

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

Amazon Interview Question for Senior Software Development Engineers


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



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

Use Rope data structure and do searching with any string searching algorithm like KMP.

- googlybhai April 03, 2013 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 votes

how to search ?

- Rounak March 01, 2014 | Flag
Comment hidden because of low score. Click to expand.
0
of 0 vote

I think we can do it by using double linked-list, which is hold pointers pointing a fix-size of buffer. Insertion\Delete\Edit may have O(1) complexity(),also could add hash_map whose key is line number and value is pointers belong to the linked-list.
About search forward or backwards, firstly we must locate the current position and using KMP to finishing searching, and the complexcity is O(L*N), L is line size and N is charcter number average.

- will April 02, 2013 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 votes

What is the size of buffer and how we can handle the insert a text in between of 2 buffer and in-between of 2 text in a single buffer.

How to handle the in/out of the page from memory to disk.

- Manoj Singhal April 02, 2013 | Flag
Comment hidden because of low score. Click to expand.
0
of 0 vote

How about using a two dimensional array...we can move to a particular location in O(1),also we have flexibility of deviding it in number of lines of RAM compatibility

- Anonymous August 20, 2013 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 votes

Correct, but it will not help to add/edit the element in middle of a particular line. while doing this we need to move the entire data's.

- Manoj Singhal August 20, 2013 | Flag
Comment hidden because of low score. Click to expand.
0
of 0 vote

Colors day for holi

- Rajat February 05, 2019 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

_ _ _ _ __ __ _ _ _
| | | | ___| | | ___ \ \ / /__ _ __| | __| | |
| |_| |/ _ \ | |/ _ \ \ \ /\ / / _ \| '__| |/ _` | |
| _ | __/ | | (_) | \ V V / (_) | | | | (_| |_|
|_| |_|\___|_|_|\___( ) \_/\_/ \___/|_| |_|\__,_(_)
|/

- Anonymous March 05, 2019 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

RCB

- Anonymous April 25, 2019 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

Hh

- Anonymous September 01, 2019 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

Sanju

- Sanju December 01, 2019 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

To be a singer❤️❤️

- Anonymous January 14, 2020 | 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