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
Mobile Qa Interview Questions
95 mobile qa interview questions shared by candidates
Write code to ignore duplicates in a string of characters. The interviewer was very specific with the language i was supposed to use(Java)
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.
WAP to find duplicate char in string
How to change a response using Charles?
java, selenium and appium questions
What degree did you study?
The interviewers are clearly diversity hires, the “manager” had no clue what she was doing and the other interviewer couldn’t even be bothered to make his bed.
What is your feeling about gaming and how you can fit in?
If I can work at the office
Viewing 1 - 10 interview questions