from collections import deque

class Solution:
  def findPermutations(self, nums):
  
    def backtrack(index, result, path, seen):
      if len(path) == len(nums):
        result.append(path[:])
        return 

      for i, num in enumerate(nums):
        if i not in seen:
          seen.add(i)
          path.append(num)
          backtrack(i, result, path, seen)
          seen.remove(i)
          path.pop()
    
    result = []
    backtrack(0, result, [], set())

    return result