Test engineering intern interview questions shared by candidates
You have a building with 100 stories. You also have two glass balls. You can drop the glass balls as many times as you want before they break. How can you find the floor at which they start breaking with the fewest number of drops?
Not truly a brain teaser because the answer is mathematical.
search for "two egg problem". its a minimization of maximum regret problem http://www.datagenetics.com/blog/july22012/index.html
If you have N stories, you use the first glass ball to increment by sqrt(N) stories. Once that ball breaks, you use your second to go to the level of sqrt(N) below where it broke, and increment floor by floor. You know it must break somewhere in that group of sqrt(N) stories. I believe this method gets you a runtime of O(n^0.5).
See Interview Questions for Similar Jobs
- Software Engineer Intern
- Software Engineer
- Software Development Engineer
- Software Development Engineer In Test
- Software Developer
- Software Engineering Intern
- Summer Analyst
- Software Development Engineer In Test (SDET)
- Technology Analyst
- Research Scientist
- Software Engineering
- QA Engineer