Programming Question: Jay has N friends, there are M different type of tickets. Jay & his friend, each have some tickets ticket[i]. ticket[N] is the number of tickets Jay has. WAP to return the number of friends who's number of tickets are different from jay's ticket count with 'k'. input: 1. N - number of Jay's friends 2. M - different type of tickets 3. k - difference required 4. Array of tickets
Write code to ignore duplicates in a string of characters. The interviewer was very specific with the language i was supposed to use(Java)
WAP to find duplicate char in string
About my previous experience, few sql questions, testing questions, few selenium questions like broken links finding and the process of clicking on all the available links on the page etc and few behavioral questions.
How to change a response using Charles?
java, selenium and appium questions
What is a test plan?...
What is Interruption Test? Difference b/w Hard & soft Assert? How can you view API in Mobile? How to test application version, how to switch to new version? How to handle Mobile OS alerts? One question on TouchAction Class and how to set up Jenkins Job.
What is your feeling about gaming and how you can fit in?
Give a 20 minute presentation with an overview of your background as well as a detailed analysis of a previous project that showcases your technical skills.
Exibindo 1 a 10 perguntas de entrevista