Mike and Mobile Problem Statement

Mike, a little boy who loves solving math problems, was playing with his mom's mobile phone. The mobile keypad includes 12 buttons: 10 digit buttons (0-9) and 2 non-digit buttons ('*' and '#'). Mike wants to find out how many unique numbers he can generate by pressing exactly 'N' buttons. He follows these rules:

  1. Mike only presses the digit buttons, ignoring '*' and '#'.
  2. After pressing a button, he can either press the same button or a button adjacent to it next.
  3. Initially, he can press any of the digit buttons.
Calculate the number of possible numbers modulo 10^9 + 7.

Input:

The input consists of multiple test cases:
  • The first line contains a single integer 'T', representing the number of test cases.
  • Each test case consists of a single positive integer N, denoting the number of button presses.

Output:

For every test case, print the number of distinct numbers achievable by pressing exactly N buttons. Output each result on a new line.

Example:

Input:
2
1
2
Output:
10
36
Explanation:

For N=1, he can press any of the 10 digits, resulting in 10 numbers.
For N=2, starting from any digit, he can either repeat the digit or move to an adjacent one, yielding more combinations.

Constraints:

  • 1 <= T <= 10
  • 1 <= N <= 5 * 10^4
Note:
The function should be implemented to solve the problem; printing is handled automatically.
Be the first one to answer
Add answer anonymously...
Standard Chartered Software Developer Interview Questions
Stay ahead in your career. Get AmbitionBox app
qr-code
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+

Reviews

4 L+

Interviews

4 Cr+

Salaries

1 Cr+

Users/Month

Contribute to help millions

Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.

Follow us
  • Youtube
  • Instagram
  • LinkedIn
  • Facebook
  • Twitter