Array shuffle with equal probability of each permutation | JavaScript Machine Coding
Hello Everyone,
In this video, we have discussed the problem generally asked in the JavaScript Coding/ Machine Coding round at the Frontend interview.
Problem Statement: Implement Array Shuffle with Equal Probability of each permutation ie. All element orders should have an equal probability.
For instance, [1,2,3] can be reordered as [1,2,3] or [1,3,2] or [3,1,2] etc, with equal probability of each case.
We have approached the solution using:
1. Sort method
2. Fisher-Yates Algorithm
We have discussed the following problem areas:
1. Problem Statement
2. Approach the Solution
3. Solution Implement
Let's Connect:
Github: https://github.com/mkdudeja
Topmate: https://topmate.io/mkdudeja
Twitter: / mkdudeja
LinkedIn: / mkdudeja
Facebook: / mkdudeja
Instagram: / mkdudeja
Thanks,
Manish K. Dudeja
#javascript #reactjs #frontendinterview #interviewquestion