WebJan 29, 2024 · Birthday Cake Candles Solution Explanation First, we have to sort the array for sorting we are using vector array and sort function for minimizing the time or we can do the same thing by using a sorting … WebI am trying to solve the following problem from HackerRank: 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. Example. candles = [4, 4, 1, 3]
Birthday Cake Candles Discussions Algorithms
WebJan 5, 2024 · In this article, you will make the birthday cake candles hackerrank solution in C++ programming. Example Enter the size of the array:: 5 Enter the 5 elements of the array:: 2 5 1 3 5 TALLEST CANDLES:: 2 You should have knowledge of the following topics in c++ programming to understand these programs: C++ main () function C++ while loop WebFeb 26, 2024 · Input: candles = [4, 4, 1, 3] Output: 2. Let us try to understand the problem statement and its test case first. You are in charge of candles on a birthday cake for a child. However, the child can only blow out the tallest candles. There could be one or more candles on the cake that are tallest. Hence, you need to return the number of tallest ... iran internet access
hackerrank birthday cake (I almost got but something wrong)
WebFunction Description. Complete 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 ... WebProblem 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. Webdef birthdayCakeCandles (candles): # Write your code here 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 0 Permalink yashparihar729 16 hours ago orcwort tree