Round 1: SDET Director It wend pretty well. Interviewer was knowledgeable and asked the questions around past projects and managerial skill Round 2: SDE Director Focus was on algorithmic questions. 1. Print tree in zigzag manner 2. in 2D-array if elements are in increasing order in Row and column then find the particular element Interviewer was calm and cool. I couldn't give the answer for questions as I was not prepared well I was happy with the interview experience till this point Round 3 : Sr SDET Manager Was asked mainly around the processes followed in my company and couple of random questions. In this round interviewer was talking more than me. Round 4 : Sr SDET Manager Interviewer had some questions and was expecting the same answers which he had in mind. I was expecting maturity level for person with such designation And as usual no feedback from HR team.
Senior Development Engineer Interview Questions
1,591 senior development engineer interview questions shared by candidates
Basics of java and what ever is in your resume
Selenium questions Difference between driver.quit() and driver.close(). Difference between implicit wait() and explicit wait () in Java. Describe the Automation framework. what is the output of these two print statements in java? System.out.println("Hello, World!"+ 12 +150); System.out.println(12 + 150 "Hello, World!"); Replace or create a new json object in the array? Array [ { "name" : "bob", "status" : "Active" // change key "status" to output and "Active" to true -- something like that } ]
There was a deep set of questions on use of SQL indexes and working with large datasets. The challenges of working with large datasets was also covered .
What would be your first step to approach a given situation of a quality issue.
Do you know about Service virtualization tools and techniques
to write a tree traversal algorithm side to side
Describe your previous work experience
Flip the order of a Single linked list
Given two one directional linked list find if they merge and the node where they merge. Write a pseudo-code. Make solution with O(1) in space and O(n) in time where n is longest list length.
Viewing 231 - 240 interview questions