Welcome to Day 4 of the DSA Coding Challenge:

Today's Goals (Backtracking) :

-Learn everything about Backtracking

Question 1: Permutations: Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order.

Question 2: Permutations 2: Given a collection of numbers, nums, that might contain duplicates, return all possible unique permutations in any order.

All the best !