MISSING VALUE Interview Questions

6,571,160 interview questions shared by candidates

In front of you are three light switches. Only one does anything, and it turns on the light downstairs. From here you can't see the light, and it makes no sound. You must determine which switch operates the light, BUT you can only go check it once. How do you figure out which switch is for the light?
avatar

Software Engineer

Interviewed at RTX

3.8
Mar 12, 2010

In front of you are three light switches. Only one does anything, and it turns on the light downstairs. From here you can't see the light, and it makes no sound. You must determine which switch operates the light, BUT you can only go check it once. How do you figure out which switch is for the light?

Not much difficult questions, when talked with principal, just like chatting, but she would ask you very detailed information about your background and how you got visa and came to the U.S. The other part of interview in English was just like regular interview, just asked me a couple of very regular questions.
avatar

Administrative Assistant

Interviewed at Asian-American Coalition For Education

3.5
May 31, 2013

Not much difficult questions, when talked with principal, just like chatting, but she would ask you very detailed information about your background and how you got visa and came to the U.S. The other part of interview in English was just like regular interview, just asked me a couple of very regular questions.

suppose you have a perfectly round disk. You put three legs randomly on this disk to form a table. Supposing the legs are perfectly perpendicular to the disk and are attached to the disk firmly, what is chance that the table will not fall when you flip the disk or in other word when you put the table to stand on its legs?
avatar

Quant

Interviewed at Jane Street

4.4
Nov 23, 2010

suppose you have a perfectly round disk. You put three legs randomly on this disk to form a table. Supposing the legs are perfectly perpendicular to the disk and are attached to the disk firmly, what is chance that the table will not fall when you flip the disk or in other word when you put the table to stand on its legs?

want you to write me a simple spell checking engine. The query language is a very simple regular expression-like language, with one special character: . (the dot character), which means EXACTLY ONE character (it can be any character). So, for example, 'c.t' would match 'cat' as the dot matches any character. There may be any number of dot characters in the query (or none). Your spell checker will have to be optimized for speed, so you will have to write it in the required way. There would be a one-time setUp() function that does any pre-processing you require, and then there will be an isMatch() function that should run as fast as possible, utilizing that pre-processing. There are some examples below, feel free to ask for clarification. Word List: [cat, bat, rat, drat, dart, drab] Queries: cat -> true c.t -> true .at -> true ..t -> true d..t -> true dr.. -> true ... -> true .... -> true ..... -> false h.t -> false c. -> false */ // write a function // Struct setup(List<String> list_of_words) // Do whatever processing you want here // with reasonable efficiency. // Return whatever data structures you want. // This function will only run once // write a function // bool isMatch(Struct struct, String query) // Returns whether the query is a match in the // dictionary (True/False) // Should be optimized for speed
avatar

Data Engineer

Interviewed at Meta

3.6
May 22, 2020

want you to write me a simple spell checking engine. The query language is a very simple regular expression-like language, with one special character: . (the dot character), which means EXACTLY ONE character (it can be any character). So, for example, 'c.t' would match 'cat' as the dot matches any character. There may be any number of dot characters in the query (or none). Your spell checker will have to be optimized for speed, so you will have to write it in the required way. There would be a one-time setUp() function that does any pre-processing you require, and then there will be an isMatch() function that should run as fast as possible, utilizing that pre-processing. There are some examples below, feel free to ask for clarification. Word List: [cat, bat, rat, drat, dart, drab] Queries: cat -> true c.t -> true .at -> true ..t -> true d..t -> true dr.. -> true ... -> true .... -> true ..... -> false h.t -> false c. -> false */ // write a function // Struct setup(List<String> list_of_words) // Do whatever processing you want here // with reasonable efficiency. // Return whatever data structures you want. // This function will only run once // write a function // bool isMatch(Struct struct, String query) // Returns whether the query is a match in the // dictionary (True/False) // Should be optimized for speed

Viewing 191 - 200 interview questions

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