Be a Good Techer and Tech for Good. www.goodtecher.com
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/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/regular-expression-matching/ Given an input string s and a pattern p, implement regular expression matching with support for ‘.’ and ‘*’ where: ‘.’ Matches any single character. ‘*’ Matches…
Description https://leetcode.com/problems/similar-rgb-color/ The red-green-blue color “#AABBCC” can be written as “#ABC” in shorthand. For example, “#15c” is shorthand for the color “#1155cc”. The similarity between the two…
Description https://leetcode.com/problems/flip-game/ You are playing a Flip Game with your friend. You are given a string currentState that contains only ‘+’ and ‘-‘. You and…
Description https://leetcode.com/problems/permutation-in-string/ Given two strings s1 and s2, return true if s2 contains a permutation of s1, or false otherwise. In other words, return true if one of s1‘s permutations is the substring…
Description https://leetcode.com/problems/remove-invalid-parentheses/ Given a string s that contains parentheses and letters, remove the minimum number of invalid parentheses to make the input…
Description https://leetcode.com/problems/read-n-characters-given-read4/ Given a file and assume that you can only read the file using a given method read4, implement a method to…
Description https://leetcode.com/problems/find-all-anagrams-in-a-string/ Given two strings s and p, return an array of all the start indices of p‘s anagrams in s. You may return the answer…
Description https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters/ Given a string s and an integer k, return the length of the longest substring of s that contains at most k distinct characters. Example 1: Input:…