a huge matrix with 1 and 0, block the block of 1. elements could be "connected" by left, right, up or down side; but no diagonal. my answer, scan one by one, after getting the first 1, use stack walking to all neighour 1 and change them into 0, count++ then the interview asked how to make it parallel, ...
1. Implement queue using an array, in circular fashion (if end is reached, add to start of array if free) 2. Circular traversal of 2x2 matrix 3. Max continuous increasing sequence in a given Binary Tree 4. Designing a graph API 5. Designing API throttling. 6. Designing a multi-game, multi-player service using a single threaded machine. 7. Sort a big file of integers using limited memory
Some string manipulation problem like finding a substring.
Binary tree, array, greedy, design splitwise
SQL vs Nosql, authentication, db design
Which field you would like to join? A difficult question for a fresher.
1. I had two telephonic interviews, one by a senior engineer in Bangalore and another with a person from the team in the US, with a gap of a week. The first round covered the basics of Java, Web Applications, Linux, REST APIs and a brief overview on the products I had worked on so far. It was a pretty straightforward round. The Second round covered the work, my role and my contributions in detail along with some more questions on Java, Selenium framework, Automation, REST APIs. This round was more of a fit-check round for the role. 2. After the telephonic rounds, an onsite F2F interview was scheduled with 2 technical rounds and a managerial one. First round had 2-3 white board coding questions, a couple of SQL queries and intermediate questions on Core Java. Java questions covered topics ranging from oops, collections and a bit on Generics. The first question was to find largest element in an array with a single iteration (basically an O(n) solution), then a String reversal program and another question I don't recall, all questions expected a minimum time complexity solution with no use of libraries. The round wrapped up with some SQL queries and some questions on REST APIs. 3. The Second round was with an SDET and a SWE. This round picked off from the last round, had 2 more white board coding questions. One question to reverse each word in a string, then capitalize start and end characters in a string and finally a question on compressing a stream of characters with repetitions, wherein the returned string should drop all the extra characters while maintaining the order of the characters in the stream. All questions were expected to be solved without using any Java library, and I solved them all. SDET covered questions on Xpaths, Selenium framework, POM design pattern, REST API error codes, Challenges faced while automating Web Apps, a question to write code to test a login page on white board, Selenium Exceptions and some more standard QA questions. I personally felt QA related questions could have been covered in a bit more detail and follow ups. 3. The managerial round was more of a personality and role-fit check, with more questions on background, my role in previous organization, challenges faced and so on. Onsite round was a good experience, wrapped up on time without any delays and last minute changes. HR got back to me with an offer two weeks later, and I accepted it.
unix scripting
Of your self identified weaknesses, which has the greatest potential to have a negative impact on your performance
Basic questions on Rest assured API
Viewing 2241 - 2250 interview questions