Software Engineer 2 Interview Questions

Software Engineer

Interviewed at Thoughtworks

4★

Jul 8, 2012

A box is divided into 4 boxes which is further subdivided into 4 boxes and so on. What is the best Data structure suitable for this scenario?

Software Developer Engineer Intern

Interviewed at Amazon

3.5★

Aug 17, 2017

Division without divide operator

Software Engineer

Interviewed at Amazon

3.5★

Mar 26, 2012

Find all prime numbers no bigger than x.

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 Engineer Intern

Interviewed at NVIDIA

4.4★

Feb 10, 2012

There is a singly linked list of ints, write a function that takes the head pointer, and prints the list in reverse order

Software Engineer

Interviewed at Meta

3.6★

Jun 7, 2010

Code a program to check if a given string is matching a given regular expression

Software Engineer

Interviewed at Meta

3.6★

Sep 17, 2013

How do you print all elements of a linked list.

Software Engineer

Interviewed at Meta

3.6★

Oct 4, 2013

Given two unsorted arrays, one with event start times and one with end times, find out if any two events overlap.

Front End Developer

Interviewed at Meta

3.6★

Feb 13, 2014

Given an array where each entry can be another array, and so forth, flatten the array. [4, [3, 6, [9, 1, 9, [5, 1]]], 8] -> [4, 3, 6, 9, 1, 9, 5, 1, 8]