3

Introduction
This challenge consists in finding the greatest number removing y digits from the original number n which has x digits.
Assuming x=4 y=2 n=5263, the possible numbers removing y=2 digits are:
[52, 56, 53, 26, 23]
So, the greater number is 56 which must be the output for this exam...