Count Ones in 11^N | Dataford Interview Questions

Given an integer N, find how many digits of 11^N are 1, using O(n) space and time.

Implement count_ones_in_power(n), where n is a non-negative integer. Return the number of occurrences of the decimal digit 1 in the exact decimal representation of 11^n. The output is an integer, and leading zeroes are not included.

Constraints

0 <= n <= 1000
The power is interpreted and represented in base 10
Return an integer count

Function Signature

def count_ones_in_power(n):

Your question is Count Ones in 11^N. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Given an integer N, find how many digits of 11^N are 1, using O(n) space and time.

Constraints

0 <= n <= 1000
The power is interpreted and represented in base 10
Return an integer count

Function Signature

def count_ones_in_power(n):

Your question is Count Ones in 11^N. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.