46. Permutations - https://leetcode.com/problems/permutations/

permutations.py

class Solution:
    def permute(self, nums: List[int]) -> List[List[int]]:
        
        list = []
        tempList = []
        
        def backtrack(list, tempList, nums):
            if len(tempList) == len(nums):
                list.append(tempList)
            else:
                for i in range(0, len(nums), 1):
                    if nums[i] in tempList:
                        continue
                    else:
                        tempList.append(nums[i])
                        backtrack(list, tempList, nums)
                        del tempList[(len(tempList)-1)]
                        
        backtrack(list, tempList, nums)

        return list