Java Challenge - Egg Dropper

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

Top Discussions on the Java 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 Language Help.

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

Need broader help or resources? Head to Language Help and Tips and Resources. If you are wanting feedback or inspiration for a project, check out Projects.

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 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!

public class EggDrop {
  public static void main(String[] args){
    System.out.println(eggDrop(100));
  }
  public static int eggDrop(int n){
    // Write your code here

    return (int) Math.ceil(Math.sqrt(2*n+1) - 1);
  }
}

Great reference article here:

public class EggDrop {
  public static void main(String[] args){
    System.out.println(eggDrop(100));
  }
  public static int eggDrop(int n){
    int i = 0;
    int sum = 0;
    while(n > sum) {
      i++;
      sum += i;
    }
    return i;
  }
}

/The method is by dividing the floors into divide floors in such a way that the last portion has one drop and continuously increase the drops by one in the before portions
5+4+3+2+1
/

public class EggDrop {
public static void main(String args){
System.out.println(eggDrop(100));
}
public static int eggDrop(int n){
// Write your code here
int sum=0;
int steps=1;
while(sum<n)
{
sum+=steps;
steps++;
}
return steps-1;
}
}