WebBirthday Cake Candles Problem Statement : You are in charge of the cake for a child's birthday. You have decided the cake will have one candle for each year of their total age. They will only be able to blow out the tallest of the candles. Count how many candles are tallest. candles = [4,4,1,3] There are of 2 them, so return 2. WebSep 5, 2024 · easy solution const birthdayCakeCandles = candles => { let max = 0; candles.forEach (candle => candle > max ? max = candle : max); //find max number const result = candles.filter (candle => candle === max); //filter the same number as max console.log (result.length); } birthdayCakeCandles ( [3,2,1,3]); //result : 2

Birthday-Cake-Candles-Hackerrank/Solution at master ... - Github

WebBirthday Cake Candles. res = [] maxi = 0 for i in candles: try: if i >= maxi: maxi = i res.append (maxi) except: pass res1 = max (res) fin = res.count (res1) return fin. Here is my solution in java, python, c++, C, javascript, C# HackerRank Birthday Cake Candles Problem Solution. WebYou can find the challenge on HackerRank. Note: Before reading forward, I'd recommend that you solve the challenge on your own first. Than you can take a peak 👀 on my solutions. First solution - the cleaner way. For this … ifo september 2022

Hackerrank Solution of Birthday Cake Candles in …

Webbirthday cake candles hackerrank C++ solution for the problem-solving challenge. In this challenge, we count how many candles are tallest. 1M views Don’t miss out Get 1 week of 100+ live... WebBirthday cake candles hackerrank problem can be solved easily by using one for loop. The complexity of birthday cake candles hackerrank solution is O(n) whic... WebComplete the function birthdayCakeCandles in the editor below. It must return an integer representing the number of candles she can blow out. birthdayCakeCandles has the following parameter (s): ar: an array of integers representing candle heights Input Format The first line contains a single integer, , denoting the number of candles on the cake. ifos fiber optic