LeetCode Challenges (135)

Given an array of integers and a target value, return the indices of the two numbers that add up to the target. Exactly one valid answer exists and the same element may not be used twice.

prices[i] is the price of a stock on day i. Choose one day to buy and a later day to sell, and return the largest profit achievable, or 0 if no profit is possible.

Return true if any value appears at least twice in the array, and false if every element is distinct.

Return an array in which answer[i] is the product of every element of nums except nums[i]. Solve it without using division.

Find the contiguous subarray with the largest sum and return that sum.

Find the contiguous subarray with the largest product and return that product. The array may contain negative numbers and zeros.

A sorted array of unique values has been rotated an unknown number of times. Return its minimum element in O(log n) time.

A sorted array of distinct integers has been rotated at an unknown pivot. Return the index of the target value, or -1 if it is absent. Must run in O(log n) time.

Return all unique triplets in the array that sum to zero. The result must not contain duplicate triplets.

Each height[i] is a vertical line drawn at position i. Pick the two lines that together with the x-axis hold the most water, and return that area.