Q3) Few questions on design patterns(Interpreter/ Observer/State) etc.
Engineer Interview Questions
935,577 engineer interview questions shared by candidates
1) Given an array of numbers where each number has a duplicate except one, write a program to return the lone number.
What is binary search tree? Whats the time complexity of inserting? deleting? seaching? What's the time complexity for the worse case?
Given two (huge) sets, what is an efficient way to find their intersection?
Test if a Binary tree is BST or not
You need to design a system to provide answers to factorials for between 1 and 100. You can cache 10 numbers. How would you arrange/manage that cache, and what is the worst case for lookup on a cache miss?
Given an integer N and an array of unsorted integers A find all pairs of numbers within A which add up to N. (This is the only question I can remember and I had trouble thinking of an answer at the time)
During the phone interview, the coding question was done on a google doc and asked: In Java, given a String of [a-z] characters, find and return the first character that appears only once. I implemented it using a counting array and in the end the manager asked if I could implement it in another way, which I mentioned I could do it using a HashMap.
Given a string, can you remove all duplicate characters in the string.
Given a string, remove subsequent duplicate characters until we get a unique set of characters. Ex: input ==> apple ; expected output ==> ale Ex: input ==>appapple; expected output ==>le The input will be in char array. char[] removeDupes(Char[] inputString){ }
Viewing 1681 - 1690 interview questions