Problem

Submissions

Hints & solutions

Discuss

Number of Digits

Easy

0/40

Average time to solve is 8m

Contributed by

41 upvotes

Asked in companies

Problem statement

Ninja want to add coding to his skill set so he started learning it. On the first day, he stuck to a problem in which he has given a long integer ‘X’ and had to count the number of digits in it.

Ninja called you for help as you are his only friend. Help him to solve the problem.

EXAMPLE:

Input: 'X' = 2

Output: 1

As only one digit is ‘2’ present in ‘X’ so answer is ‘1’.

Detailed explanation ( Input/output format, Notes, Images )

Input Format :

The first line will contain the integer 'T', denoting the number of test cases.

Each test case contains a single long integer ‘X’.

Output format :

For each test case, print the number of digits in the given integer ‘X’.

Note :

You don't need to print anything. It has already been taken care of. Just implement the given function.

Constraints :

1 <= 'T' <= 1000
1 <= ‘X’ <= 10^18
Time Limit: 1 sec

Sample Input 1 :

2
89
870

Sample Output 1 :

2
3

Explanation Of Sample Input 1 :

In test case ‘1’. There are ‘2’ digits present in ‘89’ that is ‘8’ and ‘9’. So the answer is ‘2’.
In test case ‘2’. There are ‘3’ digits present in ‘870’ that is ‘8’, ‘7’ and ‘0’. So the answer is ‘3’.

Sample Input 2 :

2
240
1

Sample Output 2 :

3
1

Hint 1

Hint 2

How many times we can remove one digit from it?

Approaches (2)

Approach 1

Approach 2

Iterative Solution

Approach:

We will remove the least significant digit from the given integer by dividing it by 10 until the number does not become zero. The number of times we can perform the above operation is the answer.

Algorithm :

Maintain a variable ‘ANS’.
Now start a while loop
While ‘(‘X’ != ‘0’ )’
- ‘ANS+=1’
- ‘X’=X/10
Return ‘Ans’.

Time Complexity

O(log10(X)). Where ‘X’ is the input long integer.

As we are deleting ‘1’ digit every time when we enter in the while loop. So ‘number of digits’ will be the time complexity that will be O(log10(X)).

Space Complexity

O(1).

As we are maintaining a constant variable to store the answer, the space complexity will be O(1).

(100% EXP penalty)

Number of Digits

Console