String - Michael's Blog

String

A collection of 9 posts

Minimum Window Substring

76. Minimum Window Substring [https://leetcode.com/problems/minimum-window-substring/] LintCode-32.Minimum Window Substring [http://www.lintcode.com/en/problem/minimum-window-substring/] Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). For example, S = "ADOBECODEBANC"

License Key Formatting

482. License Key Formatting [https://leetcode.com/problems/license-key-formatting/] Now you are given a string S, which represents a software license key which we would like to format. The string S is composed of alphanumerical characters and dashes. The dashes split the alphanumerical characters within the string into groups. (i.

Text Justification

68. Text Justification [https://leetcode.com/problems/text-justification/] Given an array of words and a length L, format the text such that each line has exactly L characters and is fully (left and right) justified. You should pack your words in a greedy approach; that is, pack as many words

ZigZag Conversion

6. ZigZag Conversion [https://leetcode.com/problems/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

Longest Palindromic Substring

5. Longest Palindromic Substring [https://leetcode.com/problems/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: "bb" public class

Longest Words

LintCode-133.Longest Words [http://www.lintcode.com/en/problem/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", "yes" } > the longest words are ["like", "love", "hate"]. > Challenge > It's easy

Anagrams

LintCode-171.Anagrams [http://www.lintcode.com/en/problem/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", "ba", "cd", "dc", "e"], return ["ab", "ba", "cd", "dc"

Compare Strings

LintCode-55.Compare Strings [http://www.lintcode.com/en/problem/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

Two Strings Are Anagrams

LintCode-158.Two Strings Are Anagrams [http://www.lintcode.com/en/problem/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