Find two numbers in a given array that add up to a specific target value, and return their indices. Essentially, you need to efficiently locate the pair that satisfies the sum requirement.

Given a set of distinct integers, your task is to generate all possible subsets (the power set). The solution should not contain duplicate subsets.

Find the length of the longest substring within a given string that contains no repeating characters. The substring must be contiguous.