Coding
-
[HackerRank] counting sort 1 c++Coding Test/HackerRank 2022. 7. 20. 10:29
Problem Quicksort usually has a running time of n x log(n), but is there an algorithm that can sort even faster? In general, this is not possible. Most sorting algorithms are comparison sorts, i.e. they sort a list just by comparing the elements to one another. A comparison sort algorithm cannot beat n x log(n) (worst-case) running time, since n x log(n) represents the minimum number of comparis..
-
[HackerRank] Between Two Sets c++Coding Test/HackerRank 2022. 7. 19. 23:18
Problem There will be two arrays of integers. Determine all integers that satisfy the following two conditions: The elements of the first array are all factors of the integer being considered The integer being considered is a factor of all elements of the second array These numbers are referred to as being between the two arrays. Determine how many such numbers exist. Example a = [2, 6] b = [24,..
-
[HackerRank] Grading Students c++Coding Test/HackerRank 2022. 7. 18. 19:32
Problem HackerLand University has the following grading policy: - Every student receives a grade in the inclusive range from 0 to 100 . - Any grade less than 40 is a failing grade. Sam is a professor at the university and likes to round each student's grade according to these rules: - If the difference between the and the next multiple of 5 is less than 3, round grade up to the next multiple of ..
-
[HackerRank] Compare the Triplets c++Coding Test/HackerRank 2022. 7. 18. 13:57
Problem Alice and Bob each created one problem for HackerRank. A reviewer rates the two challenges, awarding points on a scale from 1 to 100 for three categories: problem clarity, originality, and difficulty. The rating for Alice's challenge is the triplet a = (a[0], a[1], a[2]), and the rating for Bob's challenge is the triplet b = (b[0], b[1], b[2]). The task is to find their comparison points..
-
[HackerRank] Time Conversion c++Coding Test/HackerRank 2022. 7. 18. 13:30
Problem Given a time in 12 -hour AM/PM format, convert it to military (24-hour) time. Note: - 12:00:00AM on a 12-hour clock is 00:00:00 on a 24-hour clock. - 12:00:00PM on a 12-hour clock is 12:00:00 on a 24-hour clock. Example - s = '12:01:00PM' Return '12:01:00'. - s = '12:01:00AM' Return '00:01:00'. Constraints All input times are valid Sample Input 07:05:45PM Sample Output 19:05:45 Solutions..
-
[HackerRank] Birthday Cake Candles c++Coding Test/HackerRank 2022. 7. 18. 11:34
Problem 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] The maximum height candles are 4 units high. There are 2 of them, so return 2. Constraints 1