Skip to content

feat: updated #84

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Jun 7, 2023
Merged

feat: updated #84

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
17 changes: 17 additions & 0 deletions src/hackerrank/problem-solving/algorithms-004-010.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -129,6 +129,7 @@ function staircase(n) {
staircase(6);

/**
* 008
* Given five positive integers,
* find the minimum and maximum values that can be calculated by summing exactly four of the five integers.
* Then print the respective minimum and maximum values as a single line of two space-separated long integers.
Expand Down Expand Up @@ -165,3 +166,19 @@ function miniMaxSum(arr) {

const miniMaxSumArray = [1, 2, 3, 7, 5, 9];
miniMaxSum(miniMaxSumArray);

/**
* 008
* 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.
*
* Complete the 'birthdayCakeCandles' function below.
* The function is expected to return an INTEGER.
* The function accepts INTEGER_ARRAY candles as parameter.
*/

function birthdayCakeCandles(candles) {
// Write your code here
}