일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- 파이썬 웹프로그래밍 장고
- til
- 타사인증
- 북마크앱
- passport.js
- 독립영화플랫폼
- 자바스크립트
- 장고
- Exercism
- MyPick31
- python
- mongodb
- join()
- Node.js
- Django
- 북마크만들기
- Django Blog
- 예술영화추천
- 개발
- 프로젝트
- Algorithm
- ART_Cinema
- 장고 개발 순서
- 장고 프로젝트 순서
- 알고리즘
- MYSQL
- 장고 프로젝트
- Blog
- Bookmark
- JavaScript
- Today
- Total
목록CodingTest (57)
Juni_Dev_log
▶ Hamming 🧬 📌 (Problem) Introduction Calculate the Hamming Distance between two DNA strands. Your body is made up of cells that contain DNA. Those cells regularly wear out and need replacing, which they achieve by dividing into daughter cells. In fact, the average human body experiences about 10 quadrillion cell divisions in a lifetime! When cells divide, their DNA replicates too. Sometimes duri..
▶ ETL (Problem) Introduction We are going to do the Transform step of an Extract-Transform-Load. ETL Extract-Transform-Load (ETL) is a fancy way of saying, "We have some crufty, legacy data over in this system, and now we need it in this shiny new system over here, so we're going to migrate this." (Typically, this is followed by, "We're only going to need to run this once." That's then typically..
▶ Triangle (Problem) Introduction Determine if a triangle is equilateral, isosceles, or scalene. An equilateral triangle has all three sides the same length. An isosceles triangle has at least two sides the same length. (It is sometimes specified as having exactly two sides the same length, but for the purposes of this exercise we'll say at least two.) A scalene triangle has all sides of differe..
▶ Collatz Conjecture (Problem) Introduction The Collatz Conjecture or 3x+1 problem can be summarized as follows: Take any positive integer n. If n is even, divide n by 2 to get n / 2. If n is odd, multiply n by 3 and add 1 to get 3n + 1. Repeat the process indefinitely. The conjecture states that no matter which number you start with, you will always reach 1 eventually. Given a number n, return ..