Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6420 |

@blackshadows | 6376 |

@mb1973 | 5594 |

@Quandray | 5231 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 4510 |

@sanjay05 | 3762 |

@kirtidee18 | 3673 |

@marius_valentin_dragoi | 3522 |

@sushant_a | 3459 |

@verma_ji | 3412 |

Complete Leaderboard | |

Handle | Score |

@codersgroup18 | 783 |

@Manikanta punnam | 605 |

@sriramgoparaju99 | 594 |

@rdakka | 538 |

@praveenbgp6 | 529 |

@prankursharma31 | 518 |

@yashkaril4 | 517 |

@purohitmn02 | 467 |

@sonamnigam1999 | 443 |

@sonamkumari63928 | 441 |

@shubhamstudent5 | 433 |

Complete Leaderboard |

Given a number **N**, write a program to find a maximum number that can be formed using all of the digits of this number.

**Note: **The given number can be very large, so the input is taken as a **String.**

**Example 1:**

Input:N ="38293367"Output:98763332Explanation:98763332 is the largest number that can be formed by rearranging the digits of N.

**Example 2:**

Input:N ="1203465"Output:6543210Explanation:6543210 is the largest number that can be formed by rearranging the digits of N.

**Your Task:**

You don't need to read input or print anything. Your task is to complete the function **findMax()** which takes a String N as input and returns the answer.

**Expected Time Complexity:** O(|N|)

**Expected Auxiliary Space:** O(constant)

**Constraints:**

1 <= |N| <= 10^{5}

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes
Find maximum number

...