Review->Improve - 博客园

2017年8月26日

[Coding Made Simple] Palindrome Partition

摘要： Given a string, how many minimum splits would it take so that each partition after split is a palindrome. Same Problem Link [LintCode] Palindrome Part 阅读全文

posted @ 2017-08-26 04:56 Review->Improve 阅读(115) 评论(0) 推荐(0)

[Coding Made Simple] Minimum Edit Distance

摘要： Given two strings and operations edit, delete and add, how many minimum operations would it take to convert one string to another string. Same Problem 阅读全文

posted @ 2017-08-26 03:02 Review->Improve 阅读(101) 评论(0) 推荐(0)

[Coding Made Simple] Text Justification

摘要： Given a sequence of words, and a limit on the number of characters that can be put in one line(line width). Put line breaks in the given sequence such 阅读全文

posted @ 2017-08-26 02:51 Review->Improve 阅读(240) 评论(0) 推荐(0)

2017年8月25日

[Coding Made Simple] Box Stacking

摘要： Given boxes of different dimensions, stack them on top of each other to get maximum height such that box on top has strictly less length and width tha 阅读全文

posted @ 2017-08-25 12:17 Review->Improve 阅读(405) 评论(0) 推荐(0)

[Coding Made Simple] Maximum Sum Increasing Subsequence

摘要： 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 阅读全文

posted @ 2017-08-25 05:55 Review->Improve 阅读(236) 评论(0) 推荐(0)

2017年8月24日

[Coding Made Simple] Longest Palindromic Subsequence

摘要： 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 阅读全文

posted @ 2017-08-24 13:28 Review->Improve 阅读(191) 评论(0) 推荐(0)

[Coding Made Simple] Longest Increasing Subsequence

摘要： Given an array, find the longest increasing subsequence in this array. The same problem link. [LintCode] Longest Increasing Subsequence Related Proble 阅读全文

posted @ 2017-08-24 06:43 Review->Improve 阅读(127) 评论(0) 推荐(0)

[Coding Made Simple] Minimum jump to reach end

摘要： 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 阅读全文

posted @ 2017-08-24 06:39 Review->Improve 阅读(209) 评论(0) 推荐(0)

[LeetCode 115] Distinct Subsequences

摘要： 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 阅读全文

posted @ 2017-08-24 06:36 Review->Improve 阅读(182) 评论(0) 推荐(0)

2017年8月23日

[Coding Made Simple] String Interleaving

摘要： 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 阅读全文

posted @ 2017-08-23 12:09 Review->Improve 阅读(241) 评论(0) 推荐(0)

Push your limit!

Tell me and I will forget. Show me and I will remember. Involve me and I will understand!

公告