largest-integer-with-given-digit-sum

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given two non-negative integers <code>n</code> and <code>s</code>.

Return the largest integer that has at most <code>n</code> digits and whose sum of digits is <code>s</code>. If no such integer exists, return -1.

&nbsp;
Example 1:

<div class="example-block">
Input: n = 2, s = 9

Output: 90

Explanation:

The largest integer with at most 2 digits that has a sum of digits of 9 is 90.
</div>

Example 2:

<div class="example-block">
Input: n = 2, s = 19

Output: -1

Explanation:

There is no integer with at most 2 digits that has a sum of digits of 19, so the answer is -1.
</div>

Example 3:

<div class="example-block">
Input: n = 5, s = 0

Output: 0

Explanation:

The only non-negative integer whose digits sum to 0 is 0.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= n &lt;= 5</code></li>
	<li><code>0 &lt;= s &lt;= 100</code></li>
</ul>