https://leetcode.com/problems/longest-substring-without-repeating-characters/description/ Longest Substring Without Repeating Characters - LeetCode Longest Substring Without Repeating Characters - Given a string s, find the length of the longest substring without repeating characters. Example 1: Input: s = "abcabcbb" Output: 3 Explanation: The answer is "abc", with the length of 3. Example 2: In..

https://leetcode.com/problems/binary-tree-level-order-traversal/ Binary Tree Level Order Traversal - LeetCode Binary Tree Level Order Traversal - Given the root of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level). Example 1: [https://assets.leetcode.com/uploads/2021/02/19/tree1.jpg] Input: root = [ leetcode.com 문제 Given the root of ..

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[..