본문 바로가기

hackerrank

[HackerRank] Subarray Division
TIL/Algorithm 2021. 2. 22. [HackerRank] Subarray Division 뒤에서 부터 합산하는방식으로 구현하려고했는데, 특정부분이 자꾸 걸려서 앞에서부터 합산하는 방식으로 바꾸었다 #!/bin/python3 import math import os import random import re import sys # Complete the birthday function below. def birthday(s, d, m): result = 0 for i in range(0, n-m+1): if sum(s[i:i+m]) == d: result += 1 return result if __name__ == '__main__': fptr = open(os.environ['OUTPUT_PATH'], 'w') n = int(input().strip()) s = list(map(int, inp..
[Algorithm] Hackerrank - Counting Valleys
TIL/Algorithm 2019. 8. 12. [Algorithm] Hackerrank - Counting Valleys 문제: Gary is an avid hiker. He tracks his hikes meticulously, paying close attention to small details like topography. During his last hike he took exactly steps. For every step he took, he noted if it was an uphill, , or a downhill, step. Gary's hikes start and end at sea level and each step up or down represents a unit change in altitude. We define the following terms: A mountain is a sequence ..
[Algorithm] Hackerrank - Repeated String
TIL/Algorithm 2019. 8. 12. [Algorithm] Hackerrank - Repeated String 문제: Lilah has a string, s, of lowercase English letters that she repeated infinitely many times. Given an integer, n, find and print the number of letter a's in the first letters of Lilah's infinite string. For example, if the string s = 'abcac' and n = 10, the substring we consider is abcacabcac, the first 10 characters of her infinite string. There are 4 occurrences of 'a' in the substring. Fu..
[Algorithm] Hackerrank - Sock Merchant
TIL/Algorithm 2019. 8. 11. [Algorithm] Hackerrank - Sock Merchant 문제: John works at a clothing store. He has a large pile of socks that he must pair by color for sale. Given an array of integers representing the color of each sock, determine how many pairs of socks with matching colors there are. For example, there are socks with colors . There is one pair of color and one of color . There are three odd socks left, one of each color. The number of pairs is . F..
[Algorithm] Hackerrank - Jumping on the Clouds
TIL/Algorithm 2019. 8. 11. [Algorithm] Hackerrank - Jumping on the Clouds 알고리즘(코딩 시험이 걱정인건 함정)이 너무 약해서... 공부좀 해야지... 문제 Emma is playing a new mobile game that starts with consecutively numbered clouds. Some of the clouds are thunderheads and others are cumulus. She can jump on any cumulus cloud having a number that is equal to the number of the current cloud plus or . She must avoid the thunderheads. Determine the minimum number of jumps it will take Emma to jump from..

티스토리툴바