摘要：
Given a string s, cut s into some substrings such that every substring is a palindrome. Return the minimum cuts needed for a palindrome partitioning o 阅读全文
posted @ 2017-08-26 11:20
Review->Improve
阅读(439)
评论(0)
推荐(0)
摘要：
Given a string and a dictionary, return true if the string can be split into multiple words such that each word is in dictionary. If not return false. 阅读全文
posted @ 2017-08-26 07:19
Review->Improve
阅读(153)
评论(0)
推荐(0)
摘要：
Given a 2 dimensional matrix, find minimum cost path to reach bottom right from top left provided you can only from down and right. For a 5 * 5 matrix 阅读全文
posted @ 2017-08-26 06:47
Review->Improve
阅读(232)
评论(0)
推荐(0)
摘要：
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
阅读(116)
评论(0)
推荐(0)
摘要：
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
阅读(104)
评论(0)
推荐(0)
摘要：
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
阅读(245)
评论(0)
推荐(0)
浙公网安备 33010602011771号