Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target

TwoSum

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.

Example 1

Output: [0,1]
Output: Because nums[0] + nums[1] == 9, we return [0, 1].

Example 2:

Input: nums = [3,2,4], target = 6
Output: [1,2]

Example 3:

Input: nums = [3,3], target = 6
Output: [0,1]

MaximumSubArray

Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.

Example 1

Output: 14.

GitHub

View Github