LTIMindtree Stage 03: Hands-on Coding Challenge

Given an array of integers `nums` and an integer `target`, return the indices of the two numbers such that they add up to `target`. You may assume that each input would have exactly one solution, and you may not use the same element twice. You must return the two indices sorted in ascending order. ### Constraints - `2 <= nums.length <= 10^4` - `-10^9 <= nums[i] <= 10^9` - `-10^9 <= target <= 10^9` - Exactly one valid answer exists. ### Input Format First line contains space-separated integers representing the array `nums`. Second line contains a single integer `target`. ### Output Format Print two space-separated indices sorted in ascending order.