given the output from the first question write a algorithm to calculate how many possible inputs could have created that output. for example. "1211" could be interpreted as one two and one one || one hundred and twenty one ones.
Software Developer Engineer Interview Questions
466,349 software developer engineer interview questions shared by candidates
Implement a function to compute cubic root what is the time complexity?
You are given an integer N and an integer M. You are supposed to write a method void findBestCoinsThatMinimizeAverage(int N, int M) that prints the best collection of N coins that minimize the average number of minimum coins needed to generate values from 1 to M. So, if M = 100, and N = 4, then if we use the set {1, 5, 10, 25} to generate each value from 1 to 100, so that for each value the number of coins are minimized, i.e. 1 = 1 (1 coin), 2 = 1 + 1 (2 coins),..., 6 = 1 + 5 (2 coins), ..., 24 = 5 + 5 + 5 + 5 + 1 + 1 + 1 + 1 (8 coins), and we take the average of these coins, we would see that the average comes out to ~5.7. But if we instead use {1, 5, 18, 25}, the average would come out to be 3.7. We are to find that set of N coins, and print them, that produce the minimum average.
Interview question was given a grid of 9x9 sudoku with numbers filled in already, you have to check if it's a valid suoku.
Basically the interview questions were data structure. The first one was just a simple data structure question, but the second one was mathematical question. I hadn't expected that kind of questions would be asked, so I got really confused. The questions was to prove that Y is a multiple of six, where there are consecutive three numbers X, Y, Z and X and Z are a prime number. I was totally stuck at the point and couldn't make it.
Given a coin with probability x (= U[0, 1] showing head at each flip, what is the probability that you got a second head after getting the first one.
Die Frage, mit der ich die meisten Schwierigkeiten hatte (die zweite Frage war wahrscheinlich noch ): Finden Sie die zehn meistbesuchten URLs in einem großen Netzwerk von Computern, in dem jeder einzelne die Logfiles der besuchten URLs speichert. (zum Beispiel nehmen Sie viele lange <string (url) -> int (Besuche)> Maps, berechnen Sie die eingeschlossene <string (url) -> int (Summe der Besuche über alle verteilten Maps), und erhalten Sie so die zehn meistbesuchten URLs in der kombinierten Map) Die Ergebnisliste muss genau sein und die Maps sind zu umfangreich, um sie über das Netzwerk zu übermitteln (vor allem ist es nicht erlaubt, sie alle an den zentralen Server zu senden oder direkt mit MapReduce zu arbeiten)
Find the integer pairs in an integer array, so that they sum up to a specific number n.
Design a vector that can grow with the size with time complexity of O(1)
Given a list of strings, write a function to calculate the longest common prefix (LCP) of all those strings.
Viewing 231 - 240 interview questions