Shuffle an Array | Fisher Yates Algorithm | Leetcode 384 | Live coding session 💯💯💯

preview_player
Показать описание
Here is the solution to "Shuffle an Array" leetcode question. Hope you have a great time going through it.

Chapters
1) 0:00 Explaining the problem out loud
2) 1:10 Question walkthrough
3) 2:00 Building the algorithm
4) 10:00 Coding it up

For discussion/feedback

PS : Please increase the speed to 1.25X
Рекомендации по теме
Комментарии
Автор

I Appreciate your work !!
You Always Teach something New !!

adarshsharmanit
Автор

randomly solved a question based on this algorithm a few days ago, was really surprised when I saw this similar question today !

LegitGamer
Автор

tnx a lot for posting, quick question, Does your tutorials helps you land a job?

nathann
Автор

In the basic method we can use random.sample so that we don't have to keep an account of already generated index

ShivangiSingh-wcgk
Автор

Very good explanation! . Btw which macbook do you use ? What are the specs sufficient for a software dev?

akhilkhubchandani
Автор

Wondering how random method works? How is this picking a ranodom value in the given range?

yogeshsarasraam
Автор

Hi, I wanted to ask that clone method creates shallow or deep copy? Is it deep here because it's not altering original array?

abhishekahlawat
Автор

Is it possible to do it using unordered_set? Can we push all elements in the set then push in a vector and return it?

sangamkumar
Автор

bro, Waiting for push dominos question

vicky_s
visit shbcf.ru