We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Birthday cake candles hackerrank problem can be solved easily by using one for loop. The complexity of birthday cake candles hackerrank solution is O(n)
If interested to know more about the generic algorithm in details-
Birthday Cake Candles
You are viewing a single comment's thread. Return to all comments →
Hello friends,
Birthday cake candles hackerrank problem can be solved easily by using one for loop. The complexity of birthday cake candles hackerrank solution is O(n)
If interested to know more about the generic algorithm in details-
click here for the video explanation of generic algorithm with complexity analysis.
or you can click on the image too to follow youtube tutorial.
Here is the working solution:-
source code :
Would really appreciate your feedback like, dislike , comment etc. on my video.
Do not forget to upvote, if you find it useful.