Given an array of size n with values within a known range, write a method to find duplicates in O(1)
Test Engineer Ii Interview Questions
618 test engineer ii interview questions shared by candidates
Least common ancestor without using recursion
1) "yzca" <= inputStr = "abca", compareStr = "ab", replaceStr = "yz" string funcReplaceStr(string inputStr, string compareStr, string replaceStr) 2) Design a normalized datastore and t-sql for getting this problem: Get me the top 10 customers who have purchased the most products from my site.
Coding round: Setup a POM enabled framework from scratch and code an end to end scenario that they've given involving a bus booking page. Involves dropdowns, conditional select, list filtering, handling calendar to choose date, alert handling, extracting cheapest rate (integer) from list of strings, etc.
I had given a total of 5 rounds a) 2 coding/ds/automation framework related rounds b) 1 Qa manager round related to automation framework and basic a stuff c) 1 VP of engineering round related to Behaviour/Cultural fit/Past Experience d) 1 HR round of salary discussion. 1) Seggrate the arrays 1,2 with best/average complexity. 2) Find the duplets without using brute force and with best/average complexity. 3) API automation framework working and microservice architecture 4) Some Parsing Related to the Int and string problems 5) You should be thinking from the customer perspective as well. 6) They are more interested in seeing your Approach towards the problem. 7) Some interesting issues you came across in your product or project. 8) Opps, Collections. (They will ask you pretty good questions from this section which are unique) ex:- Hashmap implementations and why there is no duplicate key in this? can we design a new one?
Oops, db queries, api ui automation
Qué estudios posees aparte de tu carrera?
Tell me about yourself (introduction)
Backend microservice architecture and its advantage,deployment process
Api response code and diffrent scenarios on add to cart functionality
Viewing 301 - 310 interview questions