| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
Tags
- unordered_map
- Sort
- 알고리즘
- 배열
- 이진탐색
- union-find
- binary search
- Interval
- LeetCode
- Greedy
- algorithm
- 비트 연산
- 탐욕알고리즘
- CPP
- 동적계획법
- binary
- 메모이제이션
- graph
- bitwise operation
- dynamic programming
- hash table
- Array
- 깊이 우선 탐색
- bit manipulation
- DFS
- 비트 조작
- Sorting
- linked list
- C++
- Depth-First Search
Archives
- Today
- Total
목록2022 Algorithm Study(by leetcode)/Array (10)
공대생 공부노트(Notes for Engineering Studies)
https://leetcode.com/problems/two-sum/ Two Sum - LeetCode 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 (Two Sum 문제는 위 링크에서 풀어보실 수 있습니다.) Two Sum 문제는 다음과 같다. Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to..
2022 Algorithm Study(by leetcode)/Array
2022. 2. 1. 14:43
https://leetcode.com/problems/best-time-to-buy-and-sell-stock/ Best Time to Buy and Sell Stock - LeetCode 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 (Best Time to Buy and Sell Stock 문제는 위 링크에서 풀어보실 수 있습니다.) Best Time to Buy and Sell Stock 문제는 다..
2022 Algorithm Study(by leetcode)/Array
2022. 1. 30. 18:53