Shuffle an Array Python Solution with Tests

lcpy gen -n 384   # by problem number
lcpy gen -s shuffle_an_array   # by problem name

Input
["Solution", "shuffle", "reset", "shuffle"]
[[[1, 2, 3]], [], [], []]
Output
[null, [3, 1, 2], [1, 2, 3], [1, 3, 2]]

Explanation
Solution solution = new Solution([1, 2, 3]);
solution.shuffle();    // Shuffle the array [1,2,3] and return its result.
                       // Any permutation of [1,2,3] must be equally likely to be returned. Example: return [3, 1, 2]
solution.reset();      // Resets the array back to its original configuration [1,2,3]. Return [1, 2, 3]
solution.shuffle();    // Returns the random shuffling of array [1,2,3]. Example: return [1, 3, 2]

import random


class Solution:
    # Time: O(n) for __init__, reset and shuffle
    # Space: O(n)
    def __init__(self, nums: list[int]) -> None:
        self.original = list(nums)
        self.array = list(nums)

    def reset(self) -> list[int]:
        self.array = list(self.original)
        return list(self.array)

    def shuffle(self) -> list[int]:
        shuffled = list(self.array)
        for i in range(len(shuffled) - 1, 0, -1):
            j = random.randrange(i + 1)
            shuffled[i], shuffled[j] = shuffled[j], shuffled[i]
        return shuffled


# Your Solution object will be instantiated and called as such:
# obj = Solution(nums)
# param_1 = obj.reset()
# param_2 = obj.shuffle()