https://leetcode.com/explore/interview/card/top-interview-questions-easy/leetcode top interview questions - easy collection을 풀면서 기록ArrayRotate Imagehttps://leetcode.com/explore/interview/card/top-interview-questions-easy/92/array/770/ in-place, which means you have to modify the input 2D matrix directly. Do NOT allocate another 2D matrix and do the rotation.in-place algorithm은 input data structu..

문제 2. https://leetcode.com/problems/add-two-numbers/description/?envType=study-plan-v2&envId=top-interview-150 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 접근 문제에서 제시한 singly-linked list 구조에 맞춰 알고리즘을 풀어나가는 문제였다. 처음에 순서를 ..

문제 134. https://leetcode.com/problems/gas-station/description/?envType=study-plan-v2&envId=top-interview-150 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 135. https://leetcode.com/problems/candy/description/?envType=stud..

문제 https://leetcode.com/problems/product-of-array-except-self/description/?envType=study-plan-v2&envId=top-interview-150 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 접근 나누기를 하지 않고 O(n) 연산을 하라는 것에 아이디어가 안떠올랐다. Discussion ..

문제 링크 https://leetcode.com/problems/jump-game-ii/description/?envType=study-plan-v2&envId=top-interview-150 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 접근 $\bullet$ 마지막 인덱스에 도달할 수 없는 case는 없다. $\bullet$ 그래서, (마지막 인덱..

문제 https://leetcode.com/problems/jump-game/description/?source=submission-noac 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 접근 DP를 생각했다. $A_{n}$까지 점프할 수 있는 $A_{n-1}, A_{n-4}, A_{n-7} ....$ 이 있다면 $A_{n-1}$까지 점프할 수 있..

문제 https://leetcode.com/problems/best-time-to-buy-and-sell-stock/description/?envType=study-plan-v2&envId=top-interview-150 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 저점(buy), 고점(sell)을 변수로 두고 생각했는데 O(n^2) 밖에 안떠올랐고 Dis..