Problem Statement

Given a number in the form of a string S , find the greatest number that can be formed within K swaps

Solution

Code

1. Lets take an example.

   Suppose

Previous

Problems with Backtracking

Next