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
what you are doing in your current company, your passion, and some technical stuff.
Self Introduction Skills check Mostly introducing the company profile to applicant instead
Technical, fizecul, mathematics
I was asked if I went to go and see a Cleveland Indians game yet.
You work at a fruit factory. There are 3 crates in front of you. One crate contains only apples. One crate contains only oranges. The other crate contains both apples and oranges. And each crate is labeled. One reads "apples", one reads "oranges", and one reads "apples and oranges". But the labeling machine has gone crazy and is now labeling all boxes incorrectly. If you can only take out and look at just one of the pieces of fruit from just one of the crates, how can you label ALL of the crates correctly?
Conhece SCRUM?
The interviewer asked me if I could handle working with a variety of men where most probably didn't know how to act appropriately around women. Really? Yes, really!
About your project
3 videos were given, need to find the errors in them and note down the timing of the error in min & sec. and write the description.
Viewing 181 - 190 interview questions