題目： Given a set of distinct integers, S, return all possible subsets. Note: Elements in a subset must be in non-descending order. ...

引言 Coding 問題中有時會出現這樣的問題：給定一個集合，求出這個集合所有的子集(所謂子集，就是包含原集合中的一部分元素的集合)。 或者求出滿足一定要求的子集，比如子集中元素總和為定值，子集元 ...

題目： Given a collection of numbers that might contain duplicates, return all possible unique permut ...

題目： Given a collection of candidate numbers (C) and a target number (T), find all unique combinati ...

題目： Given two words (start and end), and a dictionary, find all shortest transformation sequence(s ...

題目： Given a string s and a dictionary of words dict, add spaces in s to construct a sentence wher ...

題目： Given a string s, partition s such that every substring of the partition is a palindrome. R ...

題目： Given an array of integers, every element appears three times except for one. Find that single ...