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.

Determine if any value appears at least twice in an array of numbers. Return true if duplicates exist; otherwise, return false.

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