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

  • wdodman + 1 comment

    Mine fails on that too. ar.sort(); ar.reverse(); let m = 0; let k = ar[0]; while (parseInt(ar[m]) === parseInt(k)){ m++; } return m; }

    • Kanahaiya + 0 comments

      Hi,

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

      https://youtu.be/1gxFE9EfanE

      Any comments and feedback will be appreciated.