1. Exchange Digits Problem Description Compute nearest larger number by interchanging digits updated. Given 2 numbers a and b find the smallest number greater than b by interchanging the digits of a and if not possible print -1. Constraints 1 <= a,b <= 10000000 Input Format 2 numbers, a and b, separated by space. Output A single number, greater than than b. If not possible, print -1. Test Case Explanation Example 1 Input 459 500 Output 549 Example 2 Input 645757 457765 Output 465577 Example 3 Input 5964 9984 Output -1 2.Min Combinations Problem Description Alexander The great, while roaming the stretch of Turkey, came across a wise man. He asked the wise man, "Who is the greatest conqueror of all?". The wise man replied, "A person with great strength and intelligence. Whosoever can solve my puzzle will go on to become the greatest!". The puzzle is as follows; Given two integers 'n1' and...