일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- algorithm
- 깊이 우선 탐색
- 알고리즘
- 이진탐색
- Interval
- Depth-First Search
- bitwise operation
- dynamic programming
- linked list
- Array
- 동적계획법
- union-find
- 탐욕알고리즘
- hash table
- 비트 연산
- Greedy
- 비트 조작
- Sort
- graph
- LeetCode
- C++
- CPP
- DFS
- binary search
- binary
- unordered_map
- bit manipulation
- 배열
- 메모이제이션
- Sorting
- Today
- Total
목록2022 Algorithm Study(by leetcode)/Array (10)
공대생 공부노트(Notes for Engineering Studies)

https://leetcode.com/problems/maximum-subarray/ Maximum Subarray - 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 (Maximum Subarray 문제는 위 링크에서 풀어보실 수 있습니다.) Maximum Subarray 문제는 다음과 같다. Given an integer array nums, find the contiguous subarray (containin..

https://leetcode.com/problems/3sum/ 3Sum - 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 (3Sum 문제는 위 링크에서 풀어보실 수 있습니다.) 3Sum 문제는 다음과 같다. Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[..

https://leetcode.com/problems/maximum-product-subarray/ Maximum Product Subarray - 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 (Maximum Product Subarray 문제는 위 링크에서 풀어보실 수 있습니다.) Maximum Product Subarray 문제는 다음과 같다. Given an integer array nums,..

https://leetcode.com/problems/container-with-most-water/ Container With Most Water - 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 (Container With Most Water 문제는 위 링크에서 풀어보실 수 있습니다.) Container With Most Water 문제는 다음과 같다. You are given an intege..

https://leetcode.com/problems/search-in-rotated-sorted-array/ Search in Rotated Sorted Array - 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 (Search in Rotated Sorted Array 문제는 위 링크에서 풀어보실 수 있습니다.) Search in Rotated Sorted Array 문제는 다음과 같다..

https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/ Find Minimum in Rotated Sorted Array - 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 (Find Minimum in Rotated Sorted Array 문제는 위 링크에서 풀어보실 수 있습니다.) Find Minimum in R..

https://leetcode.com/problems/product-of-array-except-self/ Product of Array Except Self - 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 (Product of Array Except Self 문제는 위 링크에서 풀어보실 수 있습니다.) Product of Array Except Self 문제는 다음과 같다. Given an..

https://leetcode.com/problems/contains-duplicate/ Contains Duplicate - 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 (Contains Duplicate 문제는 위 링크에서 풀어보실 수 있습니다.) Contains Duplicate 문제는 다음과 같다. Given an integer array nums, return true if any value appe..