{"group":{"id":1,"name":"Community","lockable":false,"created_at":"2012-01-18T18:02:15.000Z","updated_at":"2026-05-26T00:16:20.000Z","description":"Problems submitted by members of the MATLAB Central community.","is_default":true,"created_by":161519,"badge_id":null,"featured":false,"trending":false,"solution_count_in_trending_period":0,"trending_last_calculated":"2026-05-26T00:00:00.000Z","image_id":null,"published":true,"community_created":false,"status_id":2,"is_default_group_for_player":false,"deleted_by":null,"deleted_at":null,"restored_by":null,"restored_at":null,"description_opc":null,"description_html":null,"published_at":null},"problems":[{"id":44713,"title":"The Google Interview: Two Eggs Problem","description":"Consider the following problem, a popular Google interview question:\r\n\r\nA firm has invented a super-strong egg. For publicity purposes, it wants to determine the highest floor in a story building of _n_ floors from which such an egg can fall without breaking. The firm has given a tester two identical eggs to experiment with. The same egg can be dropped multiple times unless it breaks. \r\n\r\nFor a _n_ floor story building, what is the minimum number of droppings _d_ that is guaranteed to determine the highest safe floor in all cases?\r\n","description_html":"\u003cp\u003eConsider the following problem, a popular Google interview question:\u003c/p\u003e\u003cp\u003eA firm has invented a super-strong egg. For publicity purposes, it wants to determine the highest floor in a story building of \u003ci\u003en\u003c/i\u003e floors from which such an egg can fall without breaking. The firm has given a tester two identical eggs to experiment with. The same egg can be dropped multiple times unless it breaks.\u003c/p\u003e\u003cp\u003eFor a \u003ci\u003en\u003c/i\u003e floor story building, what is the minimum number of droppings \u003ci\u003ed\u003c/i\u003e that is guaranteed to determine the highest safe floor in all cases?\u003c/p\u003e","function_template":"function d = Google(h)\r\n  \r\nend","test_suite":"%%\r\nassert(isequal(Google(1),1))\r\n\r\n%%\r\nassert(isequal(Google(5),3))\r\n\r\n%%\r\nassert(isequal(Google(20),6))\r\n\r\n%%\r\nassert(isequal(Google(50),10))\r\n\r\n%%\r\nassert(isequal(Google(75),12))\r\n\r\n%%\r\nassert(isequal(Google(100),14))\r\n\r\n%%\r\nassert(isequal(Google(120),15))\r\n\r\n%%\r\nassert(isequal(Google(180),19))\r\n\r\n%%\r\nassert(isequal(Google(250),22))\r\n\r\n%%\r\nassert(isequal(Google(320),25))\r\n\r\n%%\r\nassert(isequal(Google(360),27))\r\n\r\n%%\r\nassert(isequal(Google(410),29))\r\n\r\n%%\r\nassert(isequal(Google(500),32))\r\n\r\n%%\r\nassert(isequal(Google(610),35))\r\n\r\n%%\r\nassert(isequal(Google(1000),45))","published":true,"deleted":false,"likes_count":2,"comments_count":0,"created_by":178544,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":23,"test_suite_updated_at":"2018-09-07T17:47:50.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2018-08-03T21:41:09.000Z","updated_at":"2026-05-30T00:33:10.000Z","published_at":"2018-08-04T01:39:07.000Z","restored_at":"2018-10-10T14:58:01.000Z","restored_by":null,"spam":false,"simulink":false,"admin_reviewed":true,"description_opc":"{\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"targetMode\":\"\",\"relationshipId\":\"rId1\",\"target\":\"/matlab/document.xml\"},{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/output\",\"targetMode\":\"\",\"relationshipId\":\"rId2\",\"target\":\"/matlab/output.xml\"}],\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"relationship\":[],\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\\n\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eConsider the following problem, a popular Google interview question:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eA firm has invented a super-strong egg. For publicity purposes, it wants to determine the highest floor in a story building of\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:i/\u003e\u003c/w:rPr\u003e\u003cw:t\u003en\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e floors from which such an egg can fall without breaking. The firm has given a tester two identical eggs to experiment with. The same egg can be dropped multiple times unless it breaks.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eFor a\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:i/\u003e\u003c/w:rPr\u003e\u003cw:t\u003en\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e floor story building, what is the minimum number of droppings\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:i/\u003e\u003c/w:rPr\u003e\u003cw:t\u003ed\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e that is guaranteed to determine the highest safe floor in all cases?\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\"},{\"partUri\":\"/matlab/output.xml\",\"contentType\":\"text/xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\" ?\u003e\u003cembeddedOutputs\u003e\u003cmetaData\u003e\u003cevaluationState\u003emanual\u003c/evaluationState\u003e\u003clayoutState\u003ecode\u003c/layoutState\u003e\u003coutputStatus\u003eready\u003c/outputStatus\u003e\u003c/metaData\u003e\u003coutputArray type=\\\"array\\\"/\u003e\u003cregionArray type=\\\"array\\\"/\u003e\u003c/embeddedOutputs\u003e\"}]}"}],"problem_search":{"problems":[{"id":44713,"title":"The Google Interview: Two Eggs Problem","description":"Consider the following problem, a popular Google interview question:\r\n\r\nA firm has invented a super-strong egg. For publicity purposes, it wants to determine the highest floor in a story building of _n_ floors from which such an egg can fall without breaking. The firm has given a tester two identical eggs to experiment with. The same egg can be dropped multiple times unless it breaks. \r\n\r\nFor a _n_ floor story building, what is the minimum number of droppings _d_ that is guaranteed to determine the highest safe floor in all cases?\r\n","description_html":"\u003cp\u003eConsider the following problem, a popular Google interview question:\u003c/p\u003e\u003cp\u003eA firm has invented a super-strong egg. For publicity purposes, it wants to determine the highest floor in a story building of \u003ci\u003en\u003c/i\u003e floors from which such an egg can fall without breaking. The firm has given a tester two identical eggs to experiment with. The same egg can be dropped multiple times unless it breaks.\u003c/p\u003e\u003cp\u003eFor a \u003ci\u003en\u003c/i\u003e floor story building, what is the minimum number of droppings \u003ci\u003ed\u003c/i\u003e that is guaranteed to determine the highest safe floor in all cases?\u003c/p\u003e","function_template":"function d = Google(h)\r\n  \r\nend","test_suite":"%%\r\nassert(isequal(Google(1),1))\r\n\r\n%%\r\nassert(isequal(Google(5),3))\r\n\r\n%%\r\nassert(isequal(Google(20),6))\r\n\r\n%%\r\nassert(isequal(Google(50),10))\r\n\r\n%%\r\nassert(isequal(Google(75),12))\r\n\r\n%%\r\nassert(isequal(Google(100),14))\r\n\r\n%%\r\nassert(isequal(Google(120),15))\r\n\r\n%%\r\nassert(isequal(Google(180),19))\r\n\r\n%%\r\nassert(isequal(Google(250),22))\r\n\r\n%%\r\nassert(isequal(Google(320),25))\r\n\r\n%%\r\nassert(isequal(Google(360),27))\r\n\r\n%%\r\nassert(isequal(Google(410),29))\r\n\r\n%%\r\nassert(isequal(Google(500),32))\r\n\r\n%%\r\nassert(isequal(Google(610),35))\r\n\r\n%%\r\nassert(isequal(Google(1000),45))","published":true,"deleted":false,"likes_count":2,"comments_count":0,"created_by":178544,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":23,"test_suite_updated_at":"2018-09-07T17:47:50.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2018-08-03T21:41:09.000Z","updated_at":"2026-05-30T00:33:10.000Z","published_at":"2018-08-04T01:39:07.000Z","restored_at":"2018-10-10T14:58:01.000Z","restored_by":null,"spam":false,"simulink":false,"admin_reviewed":true,"description_opc":"{\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"targetMode\":\"\",\"relationshipId\":\"rId1\",\"target\":\"/matlab/document.xml\"},{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/output\",\"targetMode\":\"\",\"relationshipId\":\"rId2\",\"target\":\"/matlab/output.xml\"}],\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"relationship\":[],\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\\n\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eConsider the following problem, a popular Google interview question:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eA firm has invented a super-strong egg. For publicity purposes, it wants to determine the highest floor in a story building of\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:i/\u003e\u003c/w:rPr\u003e\u003cw:t\u003en\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e floors from which such an egg can fall without breaking. The firm has given a tester two identical eggs to experiment with. The same egg can be dropped multiple times unless it breaks.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eFor a\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:i/\u003e\u003c/w:rPr\u003e\u003cw:t\u003en\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e floor story building, what is the minimum number of droppings\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:i/\u003e\u003c/w:rPr\u003e\u003cw:t\u003ed\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e that is guaranteed to determine the highest safe floor in all cases?\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\"},{\"partUri\":\"/matlab/output.xml\",\"contentType\":\"text/xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\" ?\u003e\u003cembeddedOutputs\u003e\u003cmetaData\u003e\u003cevaluationState\u003emanual\u003c/evaluationState\u003e\u003clayoutState\u003ecode\u003c/layoutState\u003e\u003coutputStatus\u003eready\u003c/outputStatus\u003e\u003c/metaData\u003e\u003coutputArray type=\\\"array\\\"/\u003e\u003cregionArray type=\\\"array\\\"/\u003e\u003c/embeddedOutputs\u003e\"}]}"}],"errors":[],"facets":[[],[{"value":"medium","count":1,"selected":false}]],"term":"tag:\"google interview\"","page":1,"per_page":50,"sort":"map(difficulty_value,0,0,999) asc"}}