JavaScript Challenge - Egg Dropper

This community-built FAQ covers the “Egg Dropper” code challenge in JavaScript. You can find that challenge here, or pick any challenge you like from our list.

Top Discussions on the JavaScript challenge Egg Dropper

There are currently no frequently asked questions or top answers associated with this challenge – that’s where you come in! You can contribute to this section by offering your own questions, answers, or clarifications on this challenge. Ask a question or post a solution by clicking reply (reply) below.

If you’ve had an “aha” moment about the concepts, formatting, syntax, or anything else with this challenge, consider sharing those insights! Teaching others and answering their questions is one of the best ways to learn and stay sharp.

Join the Discussion. Help a fellow learner on their journey.

Ask or answer a question about this exercise by clicking reply (reply) below!
You can also find further discussion and get answers to your questions over in #get-help.

Agree with a comment or answer? Like (like) to up-vote the contribution!

Need broader help or resources? Head to #get-help and #community:tips-and-resources. If you are wanting feedback or inspiration for a project, check out #project.

Looking for motivation to keep learning? Join our wider discussions in #community

Learn more about how to use this guide.

Found a bug? Report it online, or post in #community:Codecademy-Bug-Reporting

Have a question about your account or billing? Reach out to our customer support team!

None of the above? Find out where to ask other questions here!

I’ve tried to approach this challange with binary search alghoritm, but then I realised when the egg breaks on 50th floor we have 49 more possible floors, so I needed some other way around.
So after some reading on the net, because I wasn’t quite sure how to do it, I’ve managed to write this simple solution for this challange: explanation

function eggDrop(n, d = 1){ // Write your code here if (n <= 0) { return d-1; } else if (n => 1) { return eggDrop(n-d, ++d); } } console.log(eggDrop(2)); // Leave this here so we can test your code module.exports = eggDrop;
1 Like

For 2 eggs.

function eggDrop(n){
  return Math.round(Math.sqrt(n / 2) * 2);
}