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 " - ".
They asked questions about Java and selenium, some code snippets related to core java concepts.
Challenges on the last project?
They asked a lot about my experiences and HR questions (3 défauts)
Explica o que é um loop como se fosse para alguém que não é da área.
What is a variable and a 2 types of it.
Given a Bank class java code, list all the test cases you would come up with. Given a tree, decide if it's a binary tree. Given a tree node and integer number, write a method that returns true/false if any path from that node sums up to that number. Given a matrix of 0 and 1, return a set of connected unions of 1s. More code on recursion, Stack, Queue
In F2F round interviewer asked questions basically on Java,Selenium,TestNG,Framework architecture,Roles & responsibilities in current project etc.
NDA. Questions ranged from : QA methodologies, how would I QA a given feature, and code on board for a BST problem.
How do you write a Java class for the room we are sitting in?
Viewing 2531 - 2540 interview questions