1.- Group anagramas 2.- Given an input string, reverse the string word by word. For example, given s = "the sky is blue", return "blue is sky the". 3.-Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For "bbbbb" the longest substring is "b", with the length of 1.
Check out your Company Bowl for anonymous work chats.