Search⌘ K

Challenge: Egg Dropping Problem

Explore how to apply dynamic programming to solve the egg dropping problem. This lesson guides you in determining the minimum number of trials needed to find the highest floor from which eggs can be dropped without breaking. You will understand the problem constraints, develop a step-by-step approach, and prepare to implement an efficient solution.

Problem Statement

Given a tall skyscraper and a few eggs, write a function to figure out how many tries it would take to figure out which floor of the skyscraper that the eggs can be safely dropped from without breaking. Here are some ...