Programador Web Interview Questions

Software Development Engineer

Interviewed at Amazon

3.5★

Jan 21, 2015

easy

Software Engineer

Interviewed at Amazon

3.5★

Mar 26, 2012

Find all prime numbers no bigger than x.

Software Development Engineer Intern

Interviewed at Amazon

3.5★

Sep 22, 2012

1) A puzzle to find 3 numbers in an array which summed to 0.

Software Development Engineer Intern

Interviewed at Amazon

3.5★

Mar 20, 2011

Given a list of n elements...every element has a duplicate except one...Find that lone number?

Software Developer - (Willing to Learn Perl)

Interviewed at Booking.com

4.1★

Aug 25, 2014

Write a function get_hops_from(page1, page2) that will determine the number of hyperlinks that you would need to click on to get from some page1 on the web to some other page2 on the web. For example, if each page below links to the pages that are indented below it, e.g. page 1 links to pages 2 and 5, and page 2 links to pages 3 and 4, and page 5 links to pages 3 and 7, then the get_hops_from(page1, page7) should return 2 (2 hops), since you have to hop once from page 1 to 5 and once more from page 5 to page 7. page1 : distance == 0 page2 : distance == 1 page3 : distance == 2 page4 : distance == 2 page5 : distance == 2 page3 : distance == 2 page7 : distance == 2 Assume that an API is available to: * get_links(a_page) will return an array/list of all pages that a_page links to

Software Developer – (Willing to Learn Perl)

Interviewed at Booking.com

4.1★

Sep 19, 2014

Can you optimize the algoritm which you wrote.

Software Development Engineer Intern

Interviewed at Microsoft

4★

Sep 10, 2014

Reverse the words in a sentence. For example, "Have a nice day" becomes "day nice a Have"

Software Development Engineer Intern

Interviewed at Microsoft

4★

Jul 6, 2012

string compression: aaabbbbcc ->a3b4c2

Software Development Engineer II

Interviewed at Microsoft

4★

Jul 1, 2012

You have two linked lists that merge at some node. The lists could be billions of nodes long. Find the node where the lists merge in the most optimal time while using a low amount of memory.

Software Engineer

Interviewed at Cisco

4.1★

Jan 29, 2011

You have 8 balls. All are identical except one is slightly heavier. You have a balance. What is the minimum number of weighings required to find the heavier ball?