摘要：
Integer to Roman Given an integer, convert it to a roman numeral. The number is guaranteed to be within the range from 1 to 3999. Integer to Roman Giv 阅读全文
摘要：
Given a string S and a string T, count the number of distinct subsequences of T in S. A subsequence of a string is a new string which is formed from t 阅读全文
摘要：
Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.) You have 阅读全文
摘要：
The code base version is an integer start from 1 to n. One day, someone committed a bad version in the code case, so it caused this version and the fo 阅读全文
摘要：
Given a string source and a string target, find the minimum window in source which will contain all the characters in target. Notice If there is no su 阅读全文
摘要：
Print numbers from 1 to the largest number with N digits by recursion. Notice It's pretty easy to do recursion like: recursion(i) { if i > largest num 阅读全文
摘要：
Given an array of strings, return all groups of strings that are anagrams. Notice All inputs will be in lower-case Given an array of strings, return a 阅读全文
摘要：
Add Two Numbers I You have two numbers represented by a linked list, where each node contains a single digit. The digits are stored in reverse order, 阅读全文