HackerRank

HackerRank: PlusMinusGiven an array of integers, calculate the ratios of its elements that are positive, negative, and zero. Print the decimal value o

\[HackerRank] Mini-Max SumGiven five positive integers, find the minimum and maximum values that can be calculated by summing exactly four of the five

\[HackerRank] TimeConversionGiven a time in -hour AM/PM format, convert it to military (24-hour) time.Note: - 12:00:00AM on a 12-hour clock is 00:00:0

\[HackerRank] LonelyIntegerGiven an array of integers, where all elements but one occur twice, find the unique element.unique한 원소 찾기 문제이다.정렬해준 후, 각 원소

\[HackerRank]Diagonal DifferenceGiven a square matrix, calculate the absolute difference between the sums of its diagonals.For example, the square mat

\[HackerRank]CountingSort1설명은 quicksort부터 뭐 성능이 좋지만 어쩌구 하지만결국 요약하면 counting sort구현하라는 얘기이다.

\[HackerRank]CountingSort1설명은 quicksort부터 뭐 성능이 좋지만 어쩌구 하지만결국 요약하면 counting sort구현하라는 얘기이다.

\[HackerRank]ZigZagSequenceIn this challenge, the task is to debug the existing code to successfully execute all provided test file처음보는 유형의 문제다. 함수를 구

\[HackerRank]Tower BreakersTwo players are playing a game of Tower Breakers! Player always moves first, and both players always play optimally.The ru

\[HackerRank]CaesarCipherJulius Caesar protected his confidential information by encrypting it using a cipher. Caesar's cipher shifts each letter by a

\[HackerRank]Grid ChallengeGiven a square grid of characters in the range asciia-z, rearrange elements of each row alphabetically, ascending. Determin

\[HackerRank]RecursiveDigitSumWe define super digit of an integer using the following rules:Given an integer, we need to find the super digit of the

개요 [HackerRank]NewYearChaos 접근 방식 반례는 123654 5가 정상적인 인덱스라 탐지가 안됨 그냥 6만 움직인거로 두번째 접근 반례는 25134 2를 옮기면 5가 첫번째인덱스로가는데 5를 탐지하지않음 세번째 접근

\[HackerRank]MergeTwoSortedLinkedListGiven pointers to the heads of two sorted linked lists, merge them into a single, sorted linked list. Either head

\[HackerRank] TheCoinChangeProblemGiven an amount and the denominations of coins available, determine how many ways change can be made for amount. The