Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 967 with 24 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 967 # by problem number
lcpy gen -s numbers_with_same_consecutive_differences # by problem name
n and k, return an array of all the integers of length n where the difference between every two consecutive digits is k. You may return the answer in any order.
Note that the integers should not have leading zeros. Integers as 02 and 043 are not allowed.
Input: n = 3, k = 7
Output: [181,292,707,818,929]
Explanation: Note that 070 is not a valid number, because it has leading zeroes.
Input: n = 2, k = 1
Output: [10,12,21,23,32,34,43,45,54,56,65,67,76,78,87,89,98]
2 <= n <= 90 <= k <= 9class Solution:
# Time: O(2^n * n) over digit sequences of length n
# Space: O(2^n) for the answer
def nums_same_consec_diff(self, n: int, k: int) -> list[int]:
digits = list(range(1, 10))
for _ in range(n - 1):
nxt: list[int] = []
for num in digits:
last = num % 10
if last + k <= 9:
nxt.append(num * 10 + last + k)
if k and last - k >= 0:
nxt.append(num * 10 + last - k)
digits = nxt
return digits
| Time | Space |
|---|---|
| O(2^n * n) over digit sequences of length n | O(2^n) for the answer |