일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | |||
5 | 6 | 7 | 8 | 9 | 10 | 11 |
12 | 13 | 14 | 15 | 16 | 17 | 18 |
19 | 20 | 21 | 22 | 23 | 24 | 25 |
26 | 27 | 28 | 29 | 30 | 31 |
- SWIFT
- ios면접
- 클린코드
- 카카오맵클론
- Di
- firebase
- storekit2
- Safari Inspector
- css학습
- TDD
- five lines of code
- hackerrank
- Swift디자인패턴
- five lines of cdde
- Swift코딩테스트
- 리팩터링
- AutoLayout
- RxSwift
- 앱의생명주기
- mrc
- firestore
- ARC
- IOS
- 프로그래머스
- UIKit
- unittest
- RC
- algorithm
- alamofire
- 코딩테스트입문
- Today
- Total
목록Algorithm/HackerRank (12)
샘성의 iOS 개발 일지
문제 설명: Maria plays college basketball and wants to go pro. Each season she maintains a record of her play. She tabulates the number of times she breaks her season record for most points and least points in a game. Points scored in the first game establish her record for the season, and she begins counting from there. Example scores = [12, 24, 10, 24] Scores are in the same order as the games pla..
문제 설명: 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, ..
문제 설명: You are choreographing a circus show with various animals. For one act, you are given two kangaroos on a number line ready to jump in the positive direction (i.e, toward positive infinity). The first kangaroo starts at location x1 and moves at a rate of v1 meters per jump. The second kangaroo starts at location x2 and moves at a rate of v2 meters per jump. You have to figure out a way to ..