Solved Q46 in Java

[SohamRatnaparkhi]

This is a template on how to fill out a PR properly.

Description

• Language Used: Java

• Approach Used: Recursively took each number of the given array and inserted them in the available positions between the already present elements in temp . Basically, this is a backtracking approach wherein after making a permutation we backtrack and remove the element from the temp list to avoid the same elements in it.

• Question(s) Solved: Q. 46

• Issue(s) Closes: [FEATURE]: Add solution to Q41 to Q50 of Leetcode #24

The code solves following question:

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

I choose the backtracking approach because it was more intuitive. A iterative approach will make the code much complex still keeping the space and time complexities same.

Related Issue

Acceptance Criteria

Type of Changes

	Type
✓	🐛 Bug fix
✓	✨ New feature
	🔨 Refactoring
	💯 Add tests
	🔗 Update dependencies
	📜 Docs

Testing Steps / QA Criteria

[DugarRishab]

I have updated the title of this PR. Please notice that this is the right way to write a title.

[DugarRishab]

Everything else seems fine. Merging your PR now.