CareerCup

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

Amazon Interview Question for Software Engineer / Developers


More Questions from This Interview



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

I think solution lies with creating adjacency list of two matrix and then using O(L1*L2)
loop over them to calculate new non-zero element which results from multiplying them where L1 and L2 are no. of non-zero element in two matrices respectively.
This is the simplest solution we can achive i hope someone post more faster way.

- Anonymous June 10, 2010 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 votes

Look at Strassen algorithm. Big Oh(n).

- Mayank June 15, 2010 | Flag
Comment hidden because of low score. Click to expand.
0
of 0 votes

@mayank Strassen's is not O(n), its O(n^2.8) and it is still considered as the lower bound for matrix multiplication.

Strassen's is definitely better than the standard matrix mmultiplication which is (n^3)

- TheRandomGuy June 15, 2010 | Flag
Comment hidden because of low score. Click to expand.
0
of 0 votes

watch out Coppersmith, Winograd solution takes O(n^2.38)

- surender June 24, 2010 | Flag
Comment hidden because of low score. Click to expand.
0
of 0 vote

these are standard algorithm, what these companies are trying to see if you remember the algorithm or how you try to solve it ?

- aditya August 01, 2010 | 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