Showing 3 of 4 questions
Given a list of words, group together all the anagrams. Anagrams are words that contain the same letters rearranged.
#1. Group Anagrams
Given a number 'n', generate all possible well-formed (balanced) parentheses strings of length 2*n. For instance, if n=3, you need to create all valid combinations like '((()))', '(()())', etc.
#2. Generate Parentheses
Find the length of the longest substring within a given string that contains no repeating characters. The substring must be contiguous.
#3. Longest Substring Without Repeating Characters
Page 1 of 1 · 4 total