One fragment of a given integer N can be selected and its digits reversed (replaced with a right to left version of them
Posted: Tue Jul 05, 2022 10:26 am
One fragment of a given integer N can be selected and its digitsreversed (replaced with a right to left version of themselves).What is the maximum number that can be obtained this way frominteger N?
In python 3 pls
Write a function:
class Solution { public int solution(int N); }
that, given an integer 1 <= N <= 1,000,000,000, returnsthe greatest integer that can be created by reversing a subset ofits digits.
Examples:
Assumptions:
In python 3 pls
Write a function:
class Solution { public int solution(int N); }
that, given an integer 1 <= N <= 1,000,000,000, returnsthe greatest integer that can be created by reversing a subset ofits digits.
Examples:
Assumptions: