1306. Jump Game III - medium 문제 Given an array of non-negative integers arr, you are initially positioned at start index of the array. When you are at index i, you can jump to i + arr[i] or i ...
OS - 프로세스 동기화
프로세스 동기화 배경 임계영역 문제 피터슨의 해결안 동기화 하드웨어 Mutex Locks 세마포 모니터 배경 이번 챕터에선 프로세스가 병행 또는 병렬로 실행될 때 여러 프로세스가 공유하는 데이터의 무결성 에 대하여 설명한다. ...
LeetCode - 300. Longest Increasing Subsequence
300. Longest Increasing Subsequence - medium 문제 Given an unsorted array of integers, find the length of longest increasing subsequence. 제한사항 There may be more than one LIS combination, it ...
LeetCode - 322. Coin Change
322. Coin Change - medium 문제 You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up ...
LeetCode - 55. Jump Game
55. Jump Game - medium 문제 Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length a...
LeetCode - 17. Letter Combinations of a Phone Number
17. Letter Combinations of a Phone Number - medium 문제 Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. A mapping of...
LeetCode - 559. Maximum Depth of N-ary Tree
559. Maximum Depth of N-ary Tree - easy 문제 Given a n-ary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest l...
LeetCode - 841. Keys and Rooms
841. Keys and Rooms - medium 문제 There are N rooms and you start in room 0. Each room has a distinct number in 0, 1, 2, …, N-1, and each room may have some keys to access the next room. Formal...
LeetCode - 108. Convert Sorted Array to Binary Search Tree
108. Convert Sorted Array to Binary Search Tree - easy 문제 Given an array where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height-balanced ...
LeetCode - 98. Validate Binary Search Tree
98. Validate Binary Search Tree - medium 문제 Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is defined as follows: The left subtree of a node contain...