Given a list of positive integers `nums` and an int `target`, return indices of the two numbers such that they add up to a `target - 30`.\n\nConditions:\n* You will pick exactly 2 numbers.\n* You cannot pick the same element twice.\n* If you have muliple pairs, select the pair with the largest number.\n\n**Example 1:**\n```\nInput: nums = [1, 10, 25, 35, 60], target = 90\nOutput: [2, 3]\nExplanation:\nnums[2] + nums[3] = 25 + 35 = 60 = 90 - 30\n```\n\n**Example 2:**\n```\nInput: nums = [20, 50, 40, 25, 30, 10], target = 90\nOutput: [1, 5]\nExplanation:\nnums[0] + nums[2] = 20 + 40 = 60 = 90 - 30\nnums[1] + nums[5] = 50 + 10 = 60 = 90 - 30\nYou should return the pair with the largest number.\n```\n\n<details> \n  <summary>Solution</summary>\n \nJava solution using `HashMap`: https://leetcode.com/playground/RCtnVum7\nTime complexity: O(n).\nSpace complexity: O(n).\n</details>\n\nRelated problems:\n* https://leetcode.com/problems/two-sum

Given a list of positive integers nums and an int target, return indices of the two numbers such that they add up to a target - 30.\n\nConditions:\n You will pi