#### the **sum** of the **digits** of two-**digit number** is 9. if the **digits** are reversed, the new **number** if 63 **greater than** the original **number**. **find** the **number**. Answered by Penny Nom. A 7-**digit** odd **number**: 2008-06-26: From Godryk: I am **the smallest** 7-**digit** odd **number**. my ones **digit** is the **sum** of my thousands, and ten thousands **digits**. What **number** am I?. **Find the smallest number** with given **number** of **digits** and **sum** of **digits**. We are given two positive integers M and **N**. The task is to **find the smallest number** that has length M (**number** of **digits**) and **sum** of **digits as N**. We will solve this using a greedy approach in O (M) Abdelrahman wael. Algorithms. LeetCode: 200. **Number** of Islands (Medium) 130. Surrounded Regions (Medium) 128. Longest Consecutive Sequence (Hard) Given a set of **N** objects: Union command: replace components containing two objects with their union.

**A**function T(N) is O(F(N)) if for some constant c and for values of

**N**

**greater**

**than**some value n0: T(N) <= c * F(N) The idea is that T(N) is the exact complexity of a procedure/function/algorithm as a function of the problem size

**N**, and that F(N) is an upper-bound on that complexity (i.e., the actual time/space or whatever for a problem of size. We set that

**digit**to "0" and all other unknown

**digits**to "1". Because the

**digit**to be probed is the most significant of the unknown

**digits**,

**the**resulting

**number**is the largest possible

**number**

**with**that

**digit**being a "0". If this

**number**is less or equal the input, the

**digit**being probed must be a "1". On the other hand, the resulting

**number**is. Answer (1 of 4): largest 7

**digit**

**number**= 9999999 ——— 1 equation and

**smallest**7

**digit**

**number**is = 1000000 ——————2 equation so 1 + 2 on adding both equation we get as

**sum**10999999.