https://leetcode.com/problems/subtree-of-another-tree/description/ Subtree of Another Tree - LeetCode Subtree of Another Tree - Given the roots of two binary trees root and subRoot, return true if there is a subtree of root with the same structure and node values of subRoot and false otherwise. A subtree of a binary tree tree is a tree that consists of a n leetcode.com 문제 Given the roots of two ..

https://leetcode.com/problems/non-overlapping-intervals/ Non-overlapping Intervals - LeetCode 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. Example 1: Input: intervals = [[1,2],[2,3 leetcode.com 문제 Given an array of intervals interv..

https://leetcode.com/problems/merge-intervals/description/ Merge Intervals - LeetCode Merge Intervals - Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input. Example 1: Input: intervals = [[1,3],[2 leetcode.com 문제 Given an array of intervals where intervals[..

https://leetcode.com/problems/insert-interval/description/ Insert Interval - LeetCode Insert Interval - You are given an array of non-overlapping intervals intervals where intervals[i] = [starti, endi] represent the start and the end of the ith interval and intervals is sorted in ascending order by starti. You are also given an interval new leetcode.com 문제 You are given an array of non-overlappi..

https://leetcode.com/problems/longest-consecutive-sequence/description/ Longest Consecutive Sequence - LeetCode Longest Consecutive Sequence - Given an unsorted array of integers nums, return the length of the longest consecutive elements sequence. You must write an algorithm that runs in O(n) time. Example 1: Input: nums = [100,4,200,1,3,2] Output: 4 Explanati leetcode.com 문제 Given an unsorted ..