Birthday Cake Candles - HackerRank || HackerRank Birthday Cake Candles Solution
Problem Name: Birthday Cake Candles
Judge: HackerRank
Problem link: Birthday Cake Candles
HackerRank Birthday Cake Candles Solution in C
#include <stdio.h>
int main()
{
int n, i, count = 0;
scanf("%d", &n);
int array[n];
for (i = 0; i < n; i++)
{
scanf("%d", &array[i]);
}
int maximum = array[0];
for (i = 0; i < n; i++)
{
if (maximum < array[i]) maximum = array[i];
}
for (i = 0; i < n; i++)
{
if (maximum == array[i]) count++;
}
printf("%d\n", count);
return 0;
}
HackerRank Birthday Cake Candles Solution in C++/Cpp
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, i, count = 0;
cin >> n;
int array[n];
for (i = 0; i < n; i++)
{
cin >> array[i];
}
int maximum = array[0];
for (i = 0; i < n; i++)
{
if (maximum < array[i]) maximum = array[i];
}
for (i = 0; i < n; i++)
{
if (maximum == array[i]) count++;
}
cout << count << endl;
return 0;
}
HackerRank Birthday Cake Candles Solution in Java
import java.util.Scanner;
public class Birthday_Cake_Candles {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int n, i;
n = input.nextInt();
int[] array = new int[n];
for (i = 0; i < n; i++) {
array[i] = input.nextInt();
}
int max = array[0];
for (i = 0; i < n; i++) {
if (array[i] > max) max = array[i];
}
int count = 0;
for (i = 0; i < n; i++) {
if (max == array[i]) count++;
}
System.out.println(count);
}
}
