First round is pattern based question like.. n=1 n=2 n=3 * * * *** *** *** * * * * ***** ***** * * * *******
Software Interview Questions
747,653 software interview questions shared by candidates
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?
Division without divide operator
The logic part was not that easy for me
easy
Find all prime numbers no bigger than x.
1) A puzzle to find 3 numbers in an array which summed to 0.
Can you think of an example of a scenario where you would want to use a tree with more degrees of branching than a binary tree?
Given a list of n elements...every element has a duplicate except one...Find that lone number?
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
Viewing 721 - 730 interview questions