摘要：
Given an array, find maximum sum increasing subsequence in this array. Solution 1. Recursion For arr[0....n], the max sum increasing subsequence can b 阅读全文
摘要：
Given a string, find longest palindromic subsequence in this string. lps[start, end] = lps[start + 1, end - 1] + 2, if s.charAt(start) == s.charAt(end 阅读全文
摘要：
Given an array, find the longest increasing subsequence in this array. The same problem link. [LintCode] Longest Increasing Subsequence Related Proble 阅读全文
摘要：
Given an array, find minimum number to jumps to reach end of array, given you can jump at max as much as value at position in array. The same problem 阅读全文
摘要：
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 three strings, return true if third string is interleaving of first and second string. By running some examples, it seems that as long as s1.len 阅读全文
摘要：
Given a matrix of 0s and 1s. Find biggest sub-square matrix entirely of 1s in this matrix. The same problem link is as follows. Maximal Square 阅读全文
摘要：
Given a binary search tree with the following tree node definition. next points to a node's inorder successor. Populate inorder successor for all node 阅读全文
摘要：
Given a binary tree, get all nodes that don't have sibling node, excluding the root node. Level order and pre order solutions. 阅读全文
摘要：
Given an array of positive number, find maximum sum subsequence such that elements in this subsequence are not adjacent to each other. Recursive formu 阅读全文