DoodledPassword.md

Doodled Password

---

Your friend has been doodling during the lecture and wrote down several digits in a circle. You're wondering if these digits might form the password to your friend's computer. You're planning to prank him some time in the future, and hacking into his computer will definitely help. If the digits written in the clockwise order indeed form a password, all you need to do is figure out which digit comes in it first.

Given a list of digits as they are written in the clockwise order, find all other combinations the password could possibly have.

Example

For digits = [1, 2, 3, 4, 5], the output should be

solution(digits) = [[1, 2, 3, 4, 5], [2, 3, 4, 5, 1], [3, 4, 5, 1, 2],
                           [4, 5, 1, 2, 3], [5, 1, 2, 3, 4]]

Here's what your friend wrote down:

Input/Output

• [execution time limit] 4 seconds (py3)

• [input] array.integer digits

  The list of digits your friend wrote down.

  Guaranteed constraints:
  1 ≤ digits.length ≤ 20,
  0 ≤ digits[i] ≤ 9.

• [output] array.array.integer

  All possible password combinations in the following order: first the combination starting with digits[0] should go, then the one starting with digits[1], etc. The last combination should start with digits[digits.length - 1]

---

Solution

from collections import deque

def solution(digits):
    n = len(digits)
    res = [deque(digits) for _ in range(n)]
    deque(map(lambda x: x[1].rotate(-x[0]), enumerate(res)), 0)
    return [list(d) for d in res]

---

See on app.codesignal.com