Domain round: Complete breakdown of your past experiences, and how you would approach certain test automation specific scenarios. Your CV is going to be picked apart word to word and scrutinized. No coding this round.
Sdet Interview Questions
4,403 sdet interview questions shared by candidates
DSPS Round: Perform string, patterns and array manipulation qns on your ide and then you'll be asked to tell how to optimize it further.
HR: Was asked about company, my reasons to join, value add I can provide, and my past accomplishments. Certifications are an add on here.
So they have totally 5 rounds and below are few things that were asked to me, and post all 5 rounds are completed then only the actual feedback will be provided which really helps a person to know exactly on which all areas they should work more. 1. DS/PS round - Optimised programs wrt stack, arrays 2. Domain round - Test cases, Test plans, Strategies, Approaches, and few more as per resume 3. Coding round - Complete framework for API automation along with automating few testing APIs 4. HM - More like culture fit and high level of technical things 5. HR - Completely a friendly call where they will ask on few doubts or concerns they want to be clear about as per resume At last a feedback call will be scheduled where feedback and also the finally we made it or not will be disclosed.
questions with areas covering selenium, java ,rest assured.
Write code and give test cases for the same (Implement grep in java]. write test plan for a given scenario. Delete specific files in a directory (it can be nested directories as well) whose TTL expired. (file name will have the timestamp on when it needs to be deleted)
no difficlt question.. all they want to test is your knowledge and grasp.. the questions i was asked were: 1. given a data structure .one node with 2 pointers.. determine whether it is a doubly linked list , tree or nothing 2. design an atoi function 3. implement stack using 2 queues 4. telll me about your project 5. basic os questions
Stack to queue
The most difficult question was, they gave me a puzzle and asked me to write an algorithm to solve it
In place, move the duplicates in an array to the end. [Hint: first define duplicate. Ex. 02155530. Move 55 to end, OR 55 and 55, resulting in moving 555 to end.]
Viewing 4291 - 4300 interview questions