You are given an array representing the heights of vertical lines. Find two lines that, together with the x-axis, form a container that holds the most water.

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.

You are given a graph where each node has a value. Find the maximum possible 'quality' of a path that starts and ends at node 0, visiting any node at most once per path, given a maximum time limit for the path.