DSAGeeks
Egg Dropping Problem Recursive
Hard

Problem Statement

Find the minimum number of attempts needed in the worst case to determine the highest floor from which an egg can be dropped without breaking, using a purely recursive approach.

Examples

1Example 1
Input:
{ "E": 1, "F": 5 }
Output:
5
2Example 2
Input:
{ "E": 2, "F": 5 }
Output:
3
3Example 3
Input:
{ "E": 2, "F": 6 }
Output:
3
Loading...

Sign in to Run Code and Submit