Notice
Recent Posts
Link
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
Tags
- firestore
- hackerrank
- unittest
- RC
- 프로그래머스
- ios면접
- UIKit
- 시험에자주나오는것만
- 코딩테스트입문
- algorithm
- RxSwift
- Swift코딩테스트
- 카카오맵클론
- Safari Inspector
- ReactorKit UnitTest
- TDD
- alamofire
- ARC
- Di
- firebase
- HackersRank
- AutoLayout
- Swift디자인패턴
- mrc
- iOS앱 디버깅
- 반응형프레임워크
- 앱의생명주기
- SWIFT
- Bubble Search
- IOS
Archives
- Today
- Total
목록HackersRank (1)
샘성의 iOS 개발 일지
[Implementation] Sales by Match
문제 설명: There is a large pile of socks that must be paired by color. Given an array of integers representing the color of each sock, determine how many pairs of socks with matching colors there are. Example n = 7, ar = [1, 2, 1, 2, 1, 3, 2] There is one pair of color 1 and one of color 2. There are three odd socks left, one of each color. The number of pairs is 2. Function Description Complete th..
Algorithm/HackerRank
2023. 7. 12. 13:38