題目: Given an array of integers, find two numbers such that they add up to a specific target number ...

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

the sum of zero. Note: Elements in a triplet (a,b,c) ...

題目： Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given ...

題目： Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. For example: Given the below binary ...

題目： Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three ...

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

題目： Given a binary tree, find the maximum path sum. The path may start and end at any node in the tree. For example: Given the below binary ...