Given a large number in form of string str. The task is to find the smallest odd number whose sum of digits is even by removing zero or more characters from the given string str, where the digits can be rearranged.
Input: str = “15470”
Two smallest odd digits are 1 & 5. Hence the required number is 15.
Input: str = “124”
There is no smallest odd digit other than 1. Hence the required number can’t be form.
On observing closely, by intuition, it can be understood that the number of digits in the smallest odd number possible is 2. And every digit in this number is odd because the sum of two odd digits is always even. Therefore, the idea to solve this problem is to iterate through the given string and store every odd number in an array. This array can be sorted and the first two digits together form the smallest odd number whose sum of its digits is even.
Below is the implementation of the above approach.
Time Complexity: O(N) where N = length of string.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.