SDE - Intern

'N' boxes are placed on a table. Each box has an integer label on it. The labels present on each box are given in the array 'ARR'. Two different boxes may or may not have the same label value. You are given an integer 'M'. Your task is to remove any 'M' of the 'N' boxes such that after their removal, the number of distinct labels left on the table are minimum.

For example:

Consider M = 2 and the array ARR = [ 3, 4, 5, 3 ] 
If we remove the second and the third box, then all the boxes remaining on the table will have label 3. Hence, the minimum number of distinct labels left will be 1 in this case.

You are given a string ‘S’ representing a date in the “Day Month Year” format, where:

1. Day is represented as {"1st", "2nd", "3rd", "4th",”5th”, ...,”29th”, "30th", "31st"}.

2. Month is represented as {"Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"}.

3. Year is represented as {2020,2021 etc}

Your task is to convert the given date into “YYYY-MM-DD” format, where:

1. YYYY is a 4 digit year.

2. MM is a 2 digit month.

3. DD is a 2 digit day.

Note:

1. The given dates are guaranteed to be valid.

2. If you can’t represent a month in 2 digits then append  0 in front of the month. Eg: if the month is Jan, represent it as 01 and not as 1 in the answer.

3. If you can’t represent a day in 2 digits then append 0 in front of the day. Eg: if the day is 5, represent it as 05 and not as 5 in the answer.