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

https://leetcode.com/problems/jump-game/ Jump Game - 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 (Jump Game 문제는 위 링크에서 풀어보실 수 있습니다.) Jump Game 문제는 다음과 같다. You are given an integer array nums. You are initially positioned at the array's first index, and each ..

https://leetcode.com/problems/house-robber-ii/ House Robber II - 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 (House Robber II 문제는 위 링크에서 풀어보실 수 있습니다.) House Robber II 문제는 다음과 같다. You are a professional robber planning to rob houses along a street. Each..

https://leetcode.com/problems/house-robber/ House Robber - 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 (House Robber 문제는 위 링크에서 풀어보실 수 있습니다.) House Robber 문제는 다음과 같다. You are a professional robber planning to rob houses along a street. Each house has a ce..

https://leetcode.com/problems/unique-paths/ Unique Paths - 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 (Unique Paths 문제는 위 링크에서 풀어보실 수 있습니다.) Unique Paths 문제는 다음과 같다. There is a robot on an m x n grid. The robot is initially located at the top-left corner..

https://leetcode.com/problems/decode-ways/ Decode Ways - 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 (Decode Ways 문제는 위 링크에서 풀어보실 수 있습니다.) Decode Ways 문제는 다음과 같다. A message containing letters from A-Z can be encoded into numbers using the following mapping..

https://leetcode.com/problems/longest-increasing-subsequence/ Longest Increasing Subsequence - 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 (Longest Increasing Subsequence 문제는 위 링크에서 풀어보실 수 있습니다.) Longest Increasing Subsequence 문제는 다음과 같다..

https://leetcode.com/problems/longest-common-subsequence/ Longest Common Subsequence - 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 (Longest Common Subsequence 문제는 위 링크에서 풀어보실 수 있습니다.) Longest Common Subsequence 문제는 다음과 같다. Given two strings ..

https://leetcode.com/problems/coin-change/ Coin Change - 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 (Coin Change 문제는 위 링크에서 풀어보실 수 있습니다.) Coin Change 문제는 다음과 같다. You are given an integer array coins representing coins of different denominations and an int..