You are given k sorted lists. Combine all of their elements into a single sorted list and return it.

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 a string containing parentheses is valid. A valid string has matching and properly nested opening and closing parentheses.