You're given daily stock prices. Find the maximum profit you can make by buying and selling the stock once. You must buy before you sell.

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.

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