Be a Good Techer and Tech for Good. www.goodtecher.com
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…
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…
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, …,…
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 >=…
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…
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,…
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…
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…
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…
Description https://leetcode.com/problems/shortest-distance-to-target-color/ You are given an array colors, in which there are three colors: 1, 2 and 3. You are also given some queries. Each…