Time: 7 ms (98.89%), Space: 31.9 MB (52.78%) - LeetHub

Author: hogan-tech

3577-count-the-number-of-computer-unlocking-permutations/3577-count-the-number-of-computer-unlocking-permutations.py

@@ -0,0 +1,24 @@
+# time complexity: O(n)
+# space complexity: O(1)
+from typing import List
+
+
+class Solution:
+    def countPermutations(self, complexity: List[int]) -> int:
+        MOD = 10 ** 9 + 7
+        n = len(complexity)
+        base = complexity[0]
+        for i in range(1, n):
+            if complexity[i] <= base:
+                return 0
+
+        result = 1
+        for i in range(2, n):
+            result = result * i % MOD
+        return result
+
+
+complexity = [1, 2, 3]
+print(Solution().countPermutations(complexity))
+complexity = [3, 3, 3, 4, 4, 4]
+print(Solution().countPermutations(complexity))