We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Practice
  2. Algorithms
  3. Warmup
  4. Birthday Cake Candles
  5. Discussions

Birthday Cake Candles

  • rishavtandon93 + 1 comment

    Try This

    static int birthdayCakeCandles(int[] ar) {

        int count =0;
    Arrays.sort(ar);
    int maxHeight = ar[(ar.length)-1];
    for(int i=0;i<ar.length;i++)
    {
        if(ar[i]==maxHeight)
        {
            count++;
        }
    }

    return count;

}
    • Kanahaiya + 2 comments

      Hi,

      Your solution is good but it will take O(nlogn) time due to sorting which can be optimized to O(n)

      Here is the video explanation of my solution in O(n) time -

      https://youtu.be/1gxFE9EfanE

      Any comments and feedback will be appreciated.

      • wdodman + 1 comment

        Thanks for that. I worked out a solution where I do it in O(n) time. Posted on your video.

        • Kanahaiya + 0 comments

          most welcome. :)

          If you dont mind can you please provide a feedback on my video by commenting or liking & disliking. It will help me and others too to find the solution over internet.

      • munnidivya93 + 2 comments

        thanks

        • Kanahaiya + 0 comments

          most welcome. :)

          If you dont mind can you please provide a feedback on my video by commenting or liking & disliking. It will help me and others too to find the solution over internet.

        • Kanahaiya + 0 comments
          [deleted]