Editorial for Problem - Reverse Maximization (REVMAX)

[sh16011993]

I could not find the editorial for Reverse Maximization problem. Is it posted yet?

[kukreja_vlk]

REMMAX - EDITORIAL

PROBLEM LINK: Practice Contest: Division 1 Contest: Division 2 Setter: Abdullah Aslam Tester: Michael Nematollahi Editorialist: Taranpreet Singh DIFFICULTY: Easy. PREREQUISITES: Case-based Implementation. PROBLEM: Given a number N of at most 10000 digits, find 1 \leq X \leq N such that Reverse(X) is maximum possible for all 1 \leq X \leq N where Reverse(X) denotes the decimal number obtained by reversing the decimal representation of X (without leading zeroes). EXPLANATION Since after r…