Birthday Cake Candles in Algorithm | HackerRank Programming Solutions | HackerRank Problem Solving Solutions in Java [💯Correct]

Hello Programmers/Coders, Today we are going to share solutions of Programming problems of HackerRank, Algorithm Solutions of Problem Solving Section in Java. At Each Problem with Successful submission with all Test Cases Passed, you will get an score or marks. And after solving maximum problems, you will be getting stars. This will highlight your profile to the recruiters.

In this post, you will find the solution for Birthday Cake Candles in Java-HackerRank Problem. We are providing the correct and tested solutions of coding problems present on HackerRank. If you are not able to solve any problem, then you can take help from our Blog/website.

Use “Ctrl+F” To Find Any Questions Answer. & For Mobile User, You Just Need To Click On Three dots In Your Browser & You Will Get A “Find” Option There. Use These Option to Get Any Random Questions Answer.

Introduction To Algorithm

The word Algorithm means “a process or set of rules to be followed in calculations or other problem-solving operations”. Therefore Algorithm refers to a set of rules/instructions that step-by-step define how a work is to be executed upon in order to get the expected results. 

Advantages of Algorithms:

  • It is easy to understand.
  • Algorithm is a step-wise representation of a solution to a given problem.
  • In Algorithm the problem is broken down into smaller pieces or steps hence, it is easier for the programmer to convert it into an actual program.

Link for the ProblemBirthday Cake Candles – Hacker Rank Solution

Birthday Cake Candles – Hacker Rank Solution


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.


The maximum height candles are  units high. There are  of them, so return .

Function Description

Complete the function birthdayCakeCandles in the editor below.

birthdayCakeCandles has the following parameter(s):

  • int candles[n]: the candle heights


  • int: the number of candles that are tallest

Input Format

The first line contains a single integer, , the size of .
The second line contains  space-separated integers, where each integer  describes the height of .


Sample Input 0

3 2 1 3

Sample Output 0


Explanation 0

Candle heights are . The tallest candles are  units, and there are  of them.

Birthday Cake Candles – Hacker Rank Solution
import java.util.Scanner;

 * @author Techno-RJ
public class BirthdayCakeCandles {
	static int birthdayCakeCandles(int[] ar) {
		int maxCandleHeight = Integer.MIN_VALUE;
		int maxCandleFreqCount = 0;

		for (int i = 0; i < ar.length; i++) {

			if (ar[i] == maxCandleHeight) {

			if (ar[i] > maxCandleHeight) {
				maxCandleHeight = ar[i];
				maxCandleFreqCount = 1;

		return maxCandleFreqCount;


	public static void main(String[] args) {
		Scanner sc = new Scanner(;
		int M = sc.nextInt();
		int a[] = new int[M];
		for (int i = 0; i < M; i++) {
			a[i] = sc.nextInt();


22 thoughts on “Birthday Cake Candles in Algorithm | HackerRank Programming Solutions | HackerRank Problem Solving Solutions in Java [💯Correct]”

Leave a Comment

Ads Blocker Image Powered by Code Help Pro

Ads Blocker Detected!!!

We have detected that you are using extensions to block ads. Please support us by disabling these ads blocker🙏.

Powered By
Best Wordpress Adblock Detecting Plugin | CHP Adblock