string compression: aaabbbbcc ->a3b4c2
Softwareentwickler I Interview Questions
512,977 softwareentwickler i interview questions shared by candidates
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.
How many unique paths are there from B-L point to the T-R point of a chess table? What would be your approach to calculate this?
Reverse the words in a sentence. For example, "Have a nice day" becomes "day nice a Have"
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
Can you optimize the algoritm which you wrote.
Given an integer array, write a program that returns an array with elements = product of the integers in input array except the one in its position. Ex: Given input: [2, 3, 10, 4, 5], output: [600, 400, 120, 300, 240] What is the complexity of your program? When will your program not work? Below is what I presented (O(n)), but it did not qualify me for the next round.
If a batsman given super powers so that he can hit any run[6,4 ,etc] and he wants to score highest run for himself , how he'll do that in 50 over game?
Given a collection of numbers, it has two functions: insert() and getMedian(). Choose a data structure to construct this collection and design the insert() and getMedian() function. Explain the time complexity of each function.
This round consists of 6 competitive coding questions and you need to solve at least 4 to get you through.
Viewing 611 - 620 interview questions