# LeetCode 444. Sequence Reconstruction

Description https://leetcode.com/problems/sequence-reconstruction/ Check whether the original sequence org can be uniquely reconstructed from the sequences in seqs. The org sequence is a permutation of the…

# LeetCode 702. Search in a Sorted Array of Unknown Size

Description https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size/ This is an interactive problem. You have a sorted array of unique elements and an unknown size. You do not have an…

# LeetCode 261. Graph Valid Tree

Description https://leetcode.com/problems/minimum-size-subarray-sum/ You have a graph of n nodes labeled from 0 to n – 1. You are given an integer n and a list…

# LeetCode 209. Minimum Size Subarray Sum

Description https://leetcode.com/problems/minimum-size-subarray-sum/ Given an array of positive integers nums and a positive integer target, return the minimal length of a contiguous subarray [numsl, numsl+1, …,…

# LeetCode 1095. Find in Mountain Array

Description https://leetcode.com/problems/find-in-mountain-array/ (This problem is an interactive problem.) You may recall that an array arr is a mountain array if and only if: arr.length >=…

# LeetCode 76. Minimum Window Substring

Description https://leetcode.com/problems/minimum-window-substring/ Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is included in the window. If…

# LeetCode 1146. Snapshot Array

Description https://leetcode.com/problems/snapshot-array/ Implement a SnapshotArray that supports the following interface: SnapshotArray(int length) initializes an array-like data structure with the given length.  Initially,…

# LeetCode 279. Perfect Squares

Description https://leetcode.com/problems/perfect-squares/ Given an integer n, return the least number of perfect square numbers that sum to n. A perfect square is an integer that…

# LeetCode 1087. Brace Expansion

Description https://leetcode.com/problems/brace-expansion/ You are given a string s representing a list of words. Each letter in the word has one or more…

# LeetCode 1047. Remove All Adjacent Duplicates In String

Description https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/ You are given a string s consisting of lowercase English letters. A duplicate removal consists of choosing two adjacent and equal letters and removing them. We…