일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- 장고 개발 순서
- Algorithm
- python
- passport.js
- Django
- 장고 프로젝트 순서
- til
- 타사인증
- 예술영화추천
- 자바스크립트
- 프로젝트
- 북마크앱
- MyPick31
- Django Blog
- 독립영화플랫폼
- 장고 프로젝트
- 파이썬 웹프로그래밍 장고
- 알고리즘
- MYSQL
- Node.js
- 장고
- ART_Cinema
- mongodb
- Bookmark
- 개발
- JavaScript
- Blog
- 북마크만들기
- join()
- Exercism
- Today
- Total
목록codingtest (2)
Juni_Dev_log
▶ Word Count 📌 Problem Introduction Given a phrase, count the occurrences of each word in that phrase. For the purposes of this exercise you can expect that a word will always be one of: A number composed of one or more ASCII digits (ie "0" or "1234") OR A simple word composed of one or more ASCII letters (ie "a" or "they") OR A contraction of two simple words joined by a single apostrophe (ie "..
▶ Bank Account (Problem) Introduction Simulate a bank account supporting opening/closing, withdrawals, and deposits of money. Watch out for concurrent transactions! A bank account can be accessed in multiple ways. Clients can make deposits and withdrawals using the internet, mobile phones, etc. Shops can charge against the account. Create an account that can be accessed from multiple threads/pro..