일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- 중간 평균값 구하기
- SWEA
- 카카오
- 코딩테스트
- 프로그래머스
- 코딩
- stack
- java
- 배열
- 자바
- js
- 알고리즘
- 그리디알고리즘
- NestJS
- spring
- array
- 삼성
- 코테준비
- AtoZ0403
- 인프런
- 콜백지옥
- 정렬
- 자료구조
- 스텍
- 백준
- 삼성소프트웨어아카데미
- 자바스크립트
- javascript
- mybatis
- 코테
- Today
- Total
목록set (2)
개발에 AtoZ까지
1. 문제 Every email consists of a local name and a domain name, separated by the @ sign. For example, in alice@leetcode.com, alice is the local name, and leetcode.com is the domain name. Besides lowercase letters, these emails may contain '.'s or '+'s. If you add periods ('.') between some characters in the local name part of an email address, mail sent there will be forwarded to the same address ..
1. 문제 You're given strings J representing the types of stones that are jewels, and S representing the stones you have. Each character in S is a type of stone you have. You want to know how many of the stones you have are also jewels. The letters in J are guaranteed distinct, and all characters in J and S are letters. Letters are case sensitive, so "a" is considered a different type of stone from..