Shuffle an Array – LeetCode Solution Java , Python 3, Python 2 , C , C++, Best and Optimal Solutions , All you need.

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]

C++ Shuffle an Array LeetCode Solution

class Solution {
public:
    vector<int>temp;
    vector<int>temp2;

    
    Solution(vector<int>& nums) {
        temp=nums;
        temp2=nums;
        
    }
    
    vector<int> reset() {
        return temp;
    }
    
    vector<int> shuffle() {
        
        int random=rand()%temp.size();
        swap(temp2[random],temp2[0]);
        return temp2;
    }
};

Java Shuffle an Array LeetCode Solution

    int[] nums;
    Random r;
    int[] orig;
    public Solution(int[] nums) {
        orig = nums.clone();
        r = new Random();
        this.nums = nums;
    }
    
    public int[] reset() {
        return orig;
    }

    public int[] shuffle() {
        for(int i = 0; i < nums.length; i++) {
            int random = getRand(i, nums.length - 1);
            int tmp = nums[i];
            nums[i] = nums[random];
            nums[random] = tmp;
        }
        return nums;
    }
    //get a random number among [i, j].
    private int getRand(int i, int j) {
        return i + r.nextInt(j - i + 1);
    }
 

Python 3 Shuffle an Array LeetCode Solution

class Solution(object):

    def __init__(self, nums):
        self.nums_array = nums
        self.shuffle_nums_array = nums[:]
        
    def reset(self):
        return self.nums_array
        
    def shuffle(self):
        random.shuffle(self.shuffle_nums_array)
        return self.shuffle_nums_array

Array-1180
String-562
Hash Table-412
Dynamic Programming-390
Math-368
Sorting-264

Greedy-257
Depth-First Search-256
Database-215
Breadth-First Search-200
Tree-195

Binary Search-191
Matrix-176
Binary Tree-160
Two Pointers-151
Bit Manipulation-140

Stack-133
Heap (Priority Queue)-117
Design-116
Graph-108
Simulation-103
Prefix Sum-96

Backtracking-92
Counting-86
Sliding Window-73
Linked List-69
Union Find-66

Ordered Set-48
Monotonic Stack-47
Recursion-43
Trie-41
Binary Search Tree-40
Divide and Conquer-40

Enumeration-39
Bitmask-37
Queue-33
Memoization-32
Topological Sort-31

Geometry-30
Segment Tree-27
Game Theory-24
Hash Function-24
Binary Indexed Tree-21

Interactive-18
Data Stream-17
String Matching-17
Rolling Hash-17
Shortest Path-16

Number Theory-16
Combinatorics-15
Randomized-12
Monotonic Queue-9
Iterator-9
Merge Sort-9

Concurrency-9
Doubly-Linked List-8
Brainteaser-8
Probability and Statistics-7
Quickselect-7

Bucket Sort-6
Suffix Array-6
Minimum Spanning Tree-5
Counting Sort-5
Shell-4

Line Sweep-4
Reservoir Sampling-4
Eulerian Circuit-3
Radix Sort-3

Strongly Connected Componen-t2
Rejection Sampling-2
Biconnected Component-1

Leave a comment below

Related posts:

Remove Duplicates from Sorted Array – LeetCode Solution Find First and Last Position of Element in Sorted Array – LeetCode Solution Search in Rotated Sorted Array – LeetCode Solution Find Minimum in Rotated Sorted Array – LeetCode Solution Two Sum II – Input Array Is Sorted – LeetCode Solution Patching Array – LeetCode Solution