摘要：
Given an array nums of integers and an int k, partition the array (i.e move the elements in "nums") such that: All elements < k are moved to the left 阅读全文
摘要：
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 阅读全文
摘要：
Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. Example Gi 阅读全文
摘要：
Implement a function to check if a linked list is a palindrome. Example Given 1->2->1, return true Given 1->2->1, return true Given 1->2->1, return tr 阅读全文
摘要：
There are a row of n houses, each house can be painted with one of the three colors: red, blue or green. The cost of painting each house with a certai 阅读全文
摘要：
Given a set of n nuts of different sizes and n bolts of different sizes. There is a one-one mapping between nuts and bolts. Comparison of a nut to ano 阅读全文