MISSING VALUE Interview Questions

6,571,160 interview questions shared by candidates

How would you handle four tasks of equal priority? How did you cope with a difficult co-worker? Describe a situation/project you had to prepare a technical paper/presentation. Give an example of a time when you had to make a persuasive argument, how did you accomplish it and what was the outcome?
avatar

Patent Examiner

Interviewed at US Patent and Trademark Office

3.2
Dec 11, 2014

How would you handle four tasks of equal priority? How did you cope with a difficult co-worker? Describe a situation/project you had to prepare a technical paper/presentation. Give an example of a time when you had to make a persuasive argument, how did you accomplish it and what was the outcome?

What is your passion in life? Name a time you went above and beyond for a customer. Explain RAM, Hard Drive, and Processor. Why Apple? Where do you see yourself in 5 years? Name a time you had to deal with an unruly customer.
avatar

Specialist

Interviewed at Apple

4.1
Apr 3, 2015

What is your passion in life? Name a time you went above and beyond for a customer. Explain RAM, Hard Drive, and Processor. Why Apple? Where do you see yourself in 5 years? Name a time you had to deal with an unruly customer.

Given an input string S write a function which returns true if it satisfies S = nT. Basically you have to find if a given string can be represented from a substring by iterating it “n” times. n >= 2 An example would suffice – Function should return true if 1) S = “abab” 2) S = “abcdabcd” 3) S = “abcabcabc” 4) S = “zzxzzxzzx” Function should return false if 1) S = “abac” 2) S = “abcdabbd” 3) S = “abcabcefg” 4) S = “zzxzzyzzx” It would be easy to understand if you can give an algo instead of saying use kmp or suffix tree or… I came up with O(n*n) solution. Wondered how to do in O(n)
avatar

Software Engineer

Interviewed at Google

4.4
Mar 19, 2014

Given an input string S write a function which returns true if it satisfies S = nT. Basically you have to find if a given string can be represented from a substring by iterating it “n” times. n >= 2 An example would suffice – Function should return true if 1) S = “abab” 2) S = “abcdabcd” 3) S = “abcabcabc” 4) S = “zzxzzxzzx” Function should return false if 1) S = “abac” 2) S = “abcdabbd” 3) S = “abcabcefg” 4) S = “zzxzzyzzx” It would be easy to understand if you can give an algo instead of saying use kmp or suffix tree or… I came up with O(n*n) solution. Wondered how to do in O(n)

Viewing 181 - 190 interview questions

Glassdoor has 6,571,160 interview questions. Prepare for your interview. Get hired. Love your job.