일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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
- two pointers
- sorting
- recursive
- string
- 미디움
- 재귀
- backtracking
- 리트코드
- DP
- binary tree
- 문자열
- HashTable
- dfs
- linked list
- matrix
- hash table
- Depth-first Search
- math
- binary search
- list
- Array
- 이진트리
- 쉬움
- tree
- Binary
- leetcode
- Python
- easy
- 중간
- Today
- Total
목록binary search (8)
부부의 코딩 성장 일기
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/search-in-rotated-sorted-array-ii/ Search in Rotated Sorted Array II - LeetCode Can you solve this real interview question? Search in Rotated Sorted Array II - There is an integer array nums sorted in non-decreasing order (not necessarily with distinct values). Before being passed to your function, nums is rotated at an unknown pivot leetcode.com 2. 문제 설명 오..

1. 문제 링크 Search a 2D Matrix - LeetCode Search a 2D Matrix - LeetCode Can you solve this real interview question? Search a 2D Matrix - You are given an m x n integer matrix matrix with the following two properties: * Each row is sorted in non-decreasing order. * The first integer of each row is greater than the last integer leetcode.com 2. 문제 설명 주어진 m x n 행렬(matrix)에 대해 target이 행렬 내에 존재하는지 여부를 판단..
1. 문제 링크 https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/description/ Find First and Last Position of Element in Sorted Array - LeetCode Can you solve this real interview question? Find First and Last Position of Element in Sorted Array - Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target v..
1. 문제 링크 https://leetcode.com/problems/search-in-rotated-sorted-array/ Search in Rotated Sorted Array - LeetCode Can you solve this real interview question? Search in Rotated Sorted Array - There is an integer array nums sorted in ascending order (with distinct values). Prior to being passed to your function, nums is possibly rotated at an unknown pivot index k (1 int: # 회전된 배열에서 pivot(회전의 기준이 되..
1. 문제 링크 Sqrt(x) - LeetCode Sqrt(x) - LeetCode Can you solve this real interview question? Sqrt(x) - Given a non-negative integer x, return the square root of x rounded down to the nearest integer. The returned integer should be non-negative as well. You must not use any built-in exponent function or o leetcode.com 2. 문제 설명 음이 아닌 정수가 x가 주어졌을 때 루트x 보다 작거나 같은 정수 중 최대인 것을 구하기 예시) x=4이면 2≤√4<3이므로 2를..
1. 문제 링크 Search Insert Position - LeetCode Search Insert Position - LeetCode Can you solve this real interview question? Search Insert Position - Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. You must w leetcode.com 2. 문제 설명 정수가 오름차순으로 정렬된 리스트와 하나의 정수가 주어졌을 때 정수를 리스트에..