Implement a class that can calculate the running average of a stream of input numbers up to a maximum of N numbers.
Engineers Interview Questions
842,663 engineers interview questions shared by candidates
Intersection of n sets without using a hash table.
Get numeric number out of a roman string, linear time Given: mapping I = 1, V = 5, X = 10, L = 50, C = 100, D = 500, M = 1000 Input/Output: II = 2, III = 3, IV = 4 VI, VII, VIII IX = 9 XL = 40, XLIX = 49
The initial question (writing a function to calculate a square root) ended up being the most difficult because it threw me off. I knew there was a good iterative method for doing so, but could not recall Newton's method in the moment, and I sadly let this nagging thought get in the way of my ability to work through the problem. My failure to perform well on that question set a negative tone for the rest of the interview, since each interviewer after the first can see notes from the previous interviewers.
Getting maximum and minimun number was not difficult but getting less than n comparison was tricky.
Implement a function to validate whether a given binary tree is a BST (i.e. write an isBST() function).
Given an integer set of numbers, print all the subsets. For some reason the interviewer asked to print the supersets, but what he means is subsets.
in a boat on a lake with a rock, throw the rock in the water which way does the water level move? here is a memory card- what is it made out of and how was it made?
what is the HD?
Why are you interested in Network Rail and the graduate scheme?
Viewing 231 - 240 interview questions