Implement an unbiased array shuffle

Q: Implement an unbiased array shuffle

This question evaluates understanding of randomization techniques, in-place array manipulation, probabilistic uniformity, and algorithmic complexity within the coding & algorithms domain.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Implement an in-place function shuffle(arr) in JavaScript that returns a uniformly random permutation of the input array. The algorithm must be unbiased (all n! permutations equally likely), run in O(n) time with O(

extra space, and handle empty or single-element arrays. Explain your approach, justify uniformity at a high level, and analyze time and space complexity.

Implement an unbiased array shuffle

Overview

Comments (0)