Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set is: We can use the …
Given a string S, remove the vowels ‘a’, ‘e’, ‘i’, ‘o’, and ‘u’ from it, and return the new string. Example 1: Input: “leetcodeisacommunityforcoders” Output: “ltcdscmmntyfrcdrs” Example 2: Input: …
Given a set of keywords words and a string S, make all appearances of all keywords in S bold. Any letters between and tags become bold. The returned string …
For strings S and T, we say “T divides S” if and only if S = T + … + T (T concatenated with itself 1 or more times) …
Given a balanced parentheses string S, compute the score of the string based on the following rule: () has score 1 AB has score A + B, where A …
