摘要：
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 strings, find the longest common subsequence (LCS). Your code should return the length of LCS. Clarification What's the definition of Longes 阅读全文
摘要：
Given a string s, partition s such that every substring of the partition is a palindrome. Return the minimum cuts needed for a palindrome partitioning 阅读全文