Given two string A and B which represents two integers, the task is to print the maximized value of A after replacing 0 or more digits of A with any digit of B.
Note: A digit in B can only be used once.
Input: A = “1234”, B = “4321”
1 can be replaced with 4 and 2 can be replaced with 3.
Input: A = “1002”, B = “100”
The first 0 can be replaced with a 1.
Approach: Since the value of A has to maximized, any digit will be replaced by only digits of greater value. The digits on the left have more significance in contributing to the value, so they should be replaced with as large values as possible. Sort B and iterate from left to right in A and try replacing the current digit with the maximum of available options if possible.
Below is the implementation of the above approach:
- Maximize the given number by replacing a segment of digits with the alternate digits given
- Count of numbers between range having only non-zero digits whose sum of digits is N and number is divisible by M
- Minimum number of digits to be removed so that no two consecutive digits are same
- Program to find last two digits of 2^n
- Pairs whose concatenation contain all digits
- Absolute difference between the first X and last X Digits of N
- Smallest odd digits number not less than N
- Print numbers with digits 0 and 1 only such that their sum is N
- First N terms whose sum of digits is a multiple of 10
- Check if a number has digits in the given Order
- Maximum possible time that can be formed from four digits
- Given count of digits 1, 2, 3, 4, find the maximum sum possible
- Count changes in Led Lights to display digits one by one
- Smallest number with sum of digits as N and divisible by 10^N
- Next higher palindromic number using the same set of digits
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.