두 손 안 작은 공간 두 손 안 작은 공간

https://leetcode.com/problems/non-overlapping-intervals/description/ Non-overlapping Intervals - LeetCode Can you solve this real interview question? Non-overlapping Intervals - Given an array of intervals intervals where intervals[i] = [starti, endi], return the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping. leetcode.com 문제 간격의 정보가 들어있는 배열 inte..

https://leetcode.com/problems/lru-cache/description/ LRU Cache - LeetCode Can you solve this real interview question? LRU Cache - Design a data structure that follows the constraints of a Least Recently Used (LRU) cache [https://en.wikipedia.org/wiki/Cache_replacement_policies#LRU]. Implement the LRUCache class: * LRUCache(int c leetcode.com 문제 Least Recentry Used (LRU) cache(https://en.wikipedi..

https://leetcode.com/problems/add-two-numbers-ii/description/ Add Two Numbers II - LeetCode Can you solve this real interview question? Add Two Numbers II - You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first and each of their nodes contains a single digit. Add the two numbers an leetcode.com 문제 모든 노드가 양수이고 비어있지 않은 LinkedList가 2..

https://leetcode.com/problems/smallest-sufficient-team/description/ Smallest Sufficient Team - LeetCode Can you solve this real interview question? Smallest Sufficient Team - In a project, you have a list of required skills req_skills, and a list of people. The ith person people[i] contains a list of skills that the person has. Consider a sufficient team: a leetcode.com 문제 프로젝트를 하기위해 필요한 기술이 나열되..

https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended-ii/description/ Maximum Number of Events That Can Be Attended II - LeetCode Can you solve this real interview question? Maximum Number of Events That Can Be Attended II - You are given an array of events where events[i] = [startDayi, endDayi, valuei]. The ith event starts at startDayi and ends at endDayi, and if you atte..

https://leetcode.com/problems/longest-arithmetic-subsequence-of-given-difference/description/ Longest Arithmetic Subsequence of Given Difference - LeetCode Can you solve this real interview question? Longest Arithmetic Subsequence of Given Difference - Given an integer array arr and an integer difference, return the length of the longest subsequence in arr which is an arithmetic sequence such th..

https://leetcode.com/problems/course-schedule/description/ Course Schedule - LeetCode Can you solve this real interview question? Course Schedule - There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, bi] indicates that you must take co leetcode.com 문제 주어지는 정수 numCourses 만큼의 강의가 존재한다. 각 강의는 ..

https://leetcode.com/problems/find-eventual-safe-states/description/ Find Eventual Safe States - LeetCode Can you solve this real interview question? Find Eventual Safe States - There is a directed graph of n nodes with each node labeled from 0 to n - 1. The graph is represented by a 0-indexed 2D integer array graph where graph[i] is an integer array of nodes leetcode.com 문제 0번 부터 n-1번까지 숫자가 메겨져..