Building logic for the problem

#1

I have understood the question but Iā€™m unable to build an approach for this problem

#2

hello @vketan182

approach is simple
read a number as string (say s) .
if left most character is ā€˜9ā€™

  • then leave the leftmost character as it is and for other characters simpl replace s[i] with min(s[i],ā€˜9ā€™-s[i])

else:

  • for each i replace s[i] with min(s[i],ā€˜9ā€™-s[i])

print s