String - Michael's Blog

ZigZag Conversion

6. ZigZag Conversion The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility) P A H N A P L S I I G Y I R

LeetCode

Longest Palindromic Substring

5. Longest Palindromic Substring Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example: Input: "babad" Output: "bab" Note: "aba" is also a valid answer. Example: Input: "cbbd" Output:

LintCode

Longest Words

LintCode-133.Longest Words Given a dictionary, find all of the longest words in the dictionary. Example Given { "dog", "google", "facebook", "internationalization", "blabla" } the longest words are(is) ["internationalization"]. Given { "like", "love", "hate"

LintCode

Anagrams

LintCode-171.Anagrams Given an array of strings, return all groups of strings that are anagrams. Notice: All inputs will be in lower-case. Example Given ["lint", "intl", "inlt", "code"], return ["lint", "inlt", "intl"]. Given ["ab"

LintCode

Compare Strings

LintCode-55.Compare Strings Compare two strings A and B, determine whether A contains all of the characters in B. The characters in string A and B are all Upper Case letters. Notice: The characters of B in A are not necessary continuous or ordered. Example: For A = "ABCD"

LintCode

Two Strings Are Anagrams

LintCode-158.Two Strings Are Anagrams Write a method anagram(s,t) to decide if two strings are anagrams or not. Clarification: What is Anagram? Two strings are anagram if they can be the same after change the order of characters. Example: Given s = "abcd", t = "dcab"