일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- Medium
- easy
- binary search
- leetcode
- 재귀
- binary tree
- 이진트리
- list
- 미디움
- Depth-first Search
- 쉬움
- sorting
- tree
- Array
- HashTable
- Python
- 리트코드
- dfs
- string
- backtracking
- math
- two pointers
- 중간
- 문자열
- hash table
- linked list
- Binary
- matrix
- recursive
- DP
- Today
- Total
목록easy (39)
부부의 코딩 성장 일기
1. 문제 링크 https://leetcode.com/problems/guess-number-higher-or-lower/ Guess Number Higher or Lower - LeetCode Can you solve this real interview question? Guess Number Higher or Lower - We are playing the Guess Game. The game is as follows: I pick a number from 1 to n. You have to guess which number I picked. Every time you guess wrong, I will tell you whether the leetcode.com 2. 문제 설명 1에서 부터 n까지 ..

1. 문제 링크 https://leetcode.com/problems/valid-perfect-square/description/ Valid Perfect Square - LeetCode Can you solve this real interview question? Valid Perfect Square - Given a positive integer num, return true if num is a perfect square or false otherwise. A perfect square is an integer that is the square of an integer. In other words, it is the product o leetcode.com 2. 문제 설명 양의 정수 num이 주어졌..
1. 문제 링크 https://leetcode.com/problems/power-of-three/ LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 2. 문제 설명 정수 n이 주어졌을 때, 3의 거듭제곱이라면 True를 그렇지 않다면 False를 반환 즉, n에 대하여 n == 3^x 가 되는 정수 x가 존재한다면 True를 반환한다. 예시1) n= 27이면, ..
1. 문제 링크 https://leetcode.com/problems/word-pattern/description/ LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 2. 문제 설명 pattern과 문자열 s가 주어졌을 때, s가 같은 pattern을 따르는지를 True or False로 반환 여기서 같은 패턴이다의 의미는, pattern과 s가 "bijecti..
1. 문제 링크 https://leetcode.com/problems/move-zeroes/description/ Move Zeroes - LeetCode Can you solve this real interview question? Move Zeroes - Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 2. 문제 설명 정수로 구성된 array nums가 있을 때, 값이 0인 elements를 뒤로 옮기기. (그 외의 elements들은 상대적 순서를 유지해야 한다.) 여기서 ..
1. 문제 링크 https://leetcode.com/problems/add-digits/description/ LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 2. 문제 설명 정수 num이 주어졌을 때, 반복해서 각 자릿수를 더하여, 더한 값이 한자리가 될 때까지 반복하여, 해당 값을 반환 예시) num=38이라면, 3과 8을 더하면 11. 11은 두자리수이..
1. 문제 링크 https://leetcode.com/problems/valid-anagram/description/ LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 2. 문제 설명 문자열 s와 t가 주어졌을 때, 만약 t가 s의 Anagram이라면 True를 반환, 아니라면 False를 반환 여기서 Anagram이란, 일반적으로 모든 원래 문자를 정확히 한..
1. 문제 링크 https://leetcode.com/problems/implement-stack-using-queues/ LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 2. 문제 설명 queue를 활용하여 stack을 구현하라. 여기서 stack은 last-in-first-out (LIFO)를 의미 일반적인 stack은 push, top, pop, empt..