Java code

with explanation of complexity and efficency

1) Two Sum Given an array of integers nums and an integer target, return indices of the nwo numbers such that they add up to targe: You may assume that each input would have exactly one solution, and you may not use the same element twice. You can retum the answer in any order. Example 1: Input: nuass =(2,7,11,15), target =9 output: [0,1] Explanation: Because nuas [0], nums {1]=9, ve return [0,1]. Example 2: Input: nume ={3,2,4}, target 6 output: [1,2] Example 3: Input: nuns =(3,3], target 6 Output: (0,1) Constraints: - 2 nums - Length 104 - 104= nusu (1)