Getting maximum and minimun number was not difficult but getting less than n comparison was tricky.
Software Developer 4 Interview Questions
710,126 software developer 4 interview questions shared by candidates
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.
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.
Implement a function to validate whether a given binary tree is a BST (i.e. write an isBST() function).
What would you do if minutes before your shift your computer wouldn't turn on?
print a pattern 012345678910987654321
What is your dream job ?
You have a 64bit interger counter set to 0. How long it will take to overflow the counter given that you are incrementing it at 4Ghz speed.
Given an unsorted array of integers, find first two numbers in the array that equal a given sum.
Interviewer ask me to solve some permutation related problems. 1) Algorithm to get Index of a permutation when all permutations arranged in lexicographical order and its complexity
Viewing 211 - 220 interview questions