Geeksforgeeks

Error

×

Leaderboard

Showing:

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

@Ibrahim Nash | 5725 |

@blackshadows | 5685 |

@akhayrutdinov | 5111 |

@mb1973 | 4989 |

@Quandray | 4908 |

@saiujwal13083 | 4156 |

@sanjay05 | 3762 |

@marius_valentin_dragoi | 3511 |

@sushant_a | 3453 |

@KshamaGupta | 3318 |

@the_coder95 | 3302 |

Complete Leaderboard | |

Handle | Score |

@avaiesshaik782 | 786 |

@arpitsatnalika | 777 |

@tujhekya | 602 |

@prakharxyz | 601 |

@code_it_ | 591 |

@iamronak | 505 |

@imnm | 500 |

@pradeepkumarjad | 488 |

@satyam0460 | 481 |

@nitesha125 | 476 |

@Rahul Jadhav 1 | 466 |

Complete Leaderboard |

Given two numbers '**N**' and '**S**' , find the **largest number** that can be formed with '**N**' digits and whose sum of digits should be equals to '**S**'.

**Example 1:**

**Input:** N = 2, S = 9
**Output:** 90
**Explaination:** It is the biggest number
with sum of digits equals to 9.

**Example 2:**

**Input:** N = 3, S = 20
**Output:** 992
**Explaination:** It is the biggest number
with sum of digits equals to 20.

**Your Task:**

You do not need to read input or print anything. Your task is to complete the function **findLargest()** which takes N and S as input parameters and returns the largest possible number. Return -1 if no such number is possible.

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

**Exepcted Auxiliary Space:** O(N)

**Constraints:**

1 ≤ N ≤ 10^{4}

1 ≤ S ≤ 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
Largest number possible

...

Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.