Arnab is given a number N, he is asked to remove one digit and print the largest possible number.Help Arnab find the number.
For Example :
5 1234 2945 9273 3954 19374 234 945 973 954 9374
Since only one digit is to be removed, on referring the fundamentals of data structures in c++, brute force will be a sufficient approach here.
Iterate through the length of the given number(the number of digits is the length) and keep removing digits one by one.
Take the maximum of all the number obtained .