Given a binary tree with the usual left and right pointers on each node, and additionally a parent pointer, make an algorithm to discover the closest ancestor to 2 nodes on the tree.
Engineer Interview Questions
933,739 engineer interview questions shared by candidates
design a full adder with 2-1 mux
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.
Question 1: # Complete a function that returns the number of times a given character occurs in the given string # For example: # - input string = "mississippi" # - char = "s" # # - output : 4 """
Implement a simple store class with set(Node, value), get(Node) and has(Node) methods, which store a given Nodes with corresponding values.
You're in a row boat, which is in a large tank filled with water. You have an anchor on board, which you throw overboard. Does the water level in the tank rise or fall?
why Halliburton?
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.
Viewing 381 - 390 interview questions