일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- ReactorKit UnitTest
- iOS앱 디버깅
- ios면접
- 시험에자주나오는것만
- unittest
- firebase
- 코딩테스트입문
- AutoLayout
- Safari Inspector
- IOS
- HackersRank
- algorithm
- Swift디자인패턴
- Bubble Search
- 앱의생명주기
- TDD
- RC
- ARC
- alamofire
- 반응형프레임워크
- hackerrank
- firestore
- 프로그래머스
- SWIFT
- 카카오맵클론
- Di
- UIKit
- mrc
- RxSwift
- Swift코딩테스트
- Today
- Total
목록hackerrank (4)
샘성의 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, ..
문제 설명: Staircase detail This is a staircase of size : n = 4 # ## ### #### Its base and height are both equal to n. It is drawn using # symbols and spaces. The last line is not preceded by any spaces. Write a program that prints a staircase of size n. 내 풀이: func staircase(n: Int) -> Void { for i in 1...n { // 띄어쓰기 먼저 반복 후, 마지막에 #가 출력되야 함 print(String(repeating: " ", count: n - i) + String(repeati..