How many people flew out of Chicago last year?
Desarrollador De Software Ii Interview Questions
4,359 desarrollador de software ii interview questions shared by candidates
Given an large list of unsorted numbers, find the smallest number. You can access the list only 3 numbers at a time, and keep moving forward 1 number at a time.
You have 2 jars and 50 black beads and 50 white beads. How many would you put of each color in each jar so that if a bead was randomly selected from both jars, you had the greatest chance they would match? You have to put all of the beads in the jars.
Jim has 42 cents and has 8 coins, and Jack has 56 cents and has 6 coins. Which has more nickels than the other?
How would you find a duplicate number in a very large unsorted array of ints.
Given a set of strings. Check if a new string is equal to any of them. Here equal means the letters are the same, like abbc=bacb
How can you solve n^m efficiently only using +, -, *, /.
Phone Interview 1: (1)Find maximum height of BST. This is easy using recursion. Then he asked me to do it iteratively, which I somehow managed to solve. (2)The Dutch flag problem. This was not tough. But the next question was tough. It was about finding particular keys in a dictionary. They have a custom function that tells you if a key is in the dictionary and you to find out if for given input, you get required output. For example -- The dictionary is like: {hi,hello,sir,how, are, you} And you have a function isWord(x) that tells you if a particular word is in that dictinary. So if the input is hisirhowareyou the output must be hi sir how are you I couldn't solve this problem. :(
Expectation for coding Questions: Must be sort of analytical questions testing knowledge of DS/Algos and problem-solving skills, that could be done in 65-70 minutes. Reality: Problem Solving tricky questions, I would say they are not really checking candidate's Data Structures knowledge. Standard DS/Algos can be used to come up with the sol, but again coming up with the optimised sol. is the challenging part, I feel. I though it could only be done in the given time frame with most optimised approach, only if candidate had gone through that kind of question in the past. Brute Force or Semi-optimised approach can be thought of, but coming up with most optimised approach in the given time frame, needs some serious practice and some luck too😅. According to me, either questions' difficulty level should be reduced or time can be increased.
Given a set of intervals(time in seconds) find the set of intervals that overlap
Viewing 1 - 10 interview questions