Design the game of connect 4
Engineer Ii Interview Questions
9,766 engineer ii interview questions shared by candidates
Technical interview: >> How would you count the number of 1's in an integer. The question was not as simple as this. Lot of follow-up questions on how I would test this function, edge cases, different types of binary representations etc. On site questions: >> Linked list - reverse ONLY from nodes begin to end (begin, end) will be integer values >> Next right pointers. Did it with both single queue and with two queues q1 and q2 and swapping them. Follow up - how do you cut down on memory. >> All positive integers on left, negative on the other side - follow up was to modify it to a templated function >> Given a string "Hello World", split all words. This was a programming session on the interviewer's computer (not whiteboard). There will be ONLY space as delimiter. If a service can be called up to max of 5 times, how do you make sure it is handled. I answered "sempahores".
Round 1: 2 interviewers in the panel, one was asking questions other was making notes on his laptop Asked about my past projects, as soon as I mentioned “NoSQL/Cassandra” he asked: • What’s NoSQL? • Why you chose it over RDBMS? • What can NoSQL achieve that RDBMS can not? • Write code to find max sum subarray in a given array. • Given a sorted array of integers with size n, find if there exists a number that is repeated at least n/4 times, n is length of array. Time complexity should be less than O(n). Explain approach and write code. Initially I was asked to code in any language but later they kept me from writing scala code and ask me to write in other language, I wrote in Java. Round 2: A senior guy from PowerPoint mobile app team interviewed me. • Given a circular LinkedList which is sorted, Given a node of this LL and an integer, WAP to insert the item in the LL so that the LL remains sorted after insertion, handle all edge cases. • One more question that I forgot. Round 3: A lady (very senior) from Excel online team interviewed me. • Same questions about NoSQL as in round 1. • Given a list of train schedules (arrival and departure time), find the minimum number of platforms required to run the trains. Write a program. • Design a phone book. Follow up: how do you store and retrieve data in Trie data structure? Lunch Break! Round 4 (HM round): Very senior guy working on a instant messenger product. • How have your other rounds been? • Asked about my past projects, as I mentioned “NoSQL/Cassandra” he asked the same questions as in round 1. • OO design of an elevator. Write interfaces and implementation and logic. Some questions on testing. • Why you want to leave your current job? • Why Microsoft? • He told me about how they decide which team to deploy a new joiner in?
$(“#objectId”) === $(“#objectId”) Would this be true?
1. reverse a sentence 2. a variation of sorting of k-sorted arrays. 3. prefix trees, search, ranking. 4. puzzle...on probability. there is a village where couples keep having boys until they have a girl child. I was asked to find boys : girls children ration in that village. 5. In a windowing system, given window size of m * n pixels and a set of different size rectangles...how to find shortest area rectangle for a mouse click. (it's algorithmic + design problem) Design round ----------------- 1. there is a company who has everything in OS X. They have a file server. Microsoft wants to offer them Windows NT servers for this. How can microsoft do the needful without affecting users. - Before jumping to solution, I would suggest to ask as many questions to understand what actually needed to do. The problem looks like microsoft has to implement the back-end server but exact amount of work depends on existing tech choices + design. We should be able to reuse a lot of existing implementation. 2. Cortana wants to display reminders for users. The overall architecture. -Ask as many questions as you can and understand the problem.
As per Resume and project
All QA related technical interview questions and some behavioral
Mathematically prove "Birthday paradox".
how to find the closest predecessor of a node in binary by doing inorder traversal.
Code a solution to rotate bitmap by 90 degrees given a structure definition representing the bitmap and a function prototype for the function to do the rotation.
Viewing 811 - 820 interview questions