Round one had two coding questions, one was based on hashmaps and matrices (30 minutes), and the other was about combinations (20 minutes). Both were not too difficult, but the time constraint was a problem. They were scenario based questions. There also were technical aptitude questions and quants, about 25 of them in total. Since they had negative marking, I did not attend a few questions, and was able to pass 3 test cases in the 20 minute question, and was able to complete the other question. Got selected to the next round, which was the technical interview. Questions were: Boundary traversal of a tree, Kth last node in a Linked list, Searching in a sorted, rotated array, heaps, and a bit about my projects on my resume. Didn't do well in this round because I panicked. But it was average overall. They expect you to know a lot beyond your curriculum.
Software Development Engineer Test Interview Questions
5,412 software development engineer test interview questions shared by candidates
Distinct Networks with minclients and minServers with upto K-nodes
It was a toposort+dp problem similar to parallel schedule 3.
Virtual functons in c++?
what is binary search? Explain worst case and avg case complexity of it? How will you modify it to handle circularly sorted array?
What is the difference between an abstract class and an interface?
Write a function to merge two linked lists.
Merge two sorted link list
Questions on binary search tree. How to insert into tree. State big O.
Q) Given a list of strings how would you find the prefix of each string? What is the complexity? How will you sort the string?
Viewing 4251 - 4260 interview questions