A disguised topological sort problem. I was given a list of app actions like ["Swipe up to Home", "Search 'Photos'", "Tap on Search Bar", "Click Download", "Launch App"] and a set of order constraints like ["Launch App, Tap on Search Bar", "Tap on Search Bar, Search 'Photos'", "Click Download, Swipe up to Home"]. The task was to return any valid sequence of the actions that satisfied all the given constraints, outputting them as a single string joined by " - ".
In F2F round interviewer asked questions basically on Java,Selenium,TestNG,Framework architecture,Roles & responsibilities in current project etc.
Ask to write a program
Technical: (45 mins) Webtable, Array and datatables- with live coding with explanations Project framework, tool evaluation, QC, challenges and resolutions Manager: (45 mins) Implementing the project automation, ALM, Macros, Selenium, asked resolutions for few issues,All the scenarios in very high level for project automation in all aspects
General questions about work experience etc
They asked me to code
Selenium and Java questions, oops concepts etc
Tell me about your framework. How to get data from an excel sheet. Where you have used OOPS concept in your project
30 basic and advanced selenium questions and 2 program questions
Collections, reverse a string program, difference between hashmap and hashtable, code for hashmap, define S.O.P, Interfaces in Selenium, TestNG annotations, Windows handler, abstract class, Final and Static keyword
Viewing 2291 - 2300 interview questions