All Posts

Game Theory

Given an array of integers nums and a target integer target, find and return the indices of two distinct numbers in the array that sum up to the given target. The solution is guaranteed to exist for the given input. You can return the indices in any order.

Randomized

Given an array of integers nums and a target integer target, find and return the indices of two distinct numbers in the array that sum up to the given target. The solution is guaranteed to exist for the given input. You can return the indices in any order.

Reservoir Sampling

Given an array of integers nums and a target integer target, find and return the indices of two distinct numbers in the array that sum up to the given target. The solution is guaranteed to exist for the given input. You can return the indices in any order.

Shortest Path

Given an array of integers nums and a target integer target, find and return the indices of two distinct numbers in the array that sum up to the given target. The solution is guaranteed to exist for the given input. You can return the indices in any order.

Binary Indexed Tree

Given an array of integers nums and a target integer target, find and return the indices of two distinct numbers in the array that sum up to the given target. The solution is guaranteed to exist for the given input. You can return the indices in any order.

Segment Tree

Given an array of integers nums and a target integer target, find and return the indices of two distinct numbers in the array that sum up to the given target. The solution is guaranteed to exist for the given input. You can return the indices in any order.