Видео

Why does it passes the 17th line when n = 1, instead of simply returning from the function?

Thanks Justin. This is one of the best solution on the internet. Keep creating.

Thanks, easy to understand solution.

1:08:14

1:06 What symbol are you using?

Great one clear understanding of the concept🎉

🎉

Oooooh! I dislike recursive programming...I don't find it intuitive at all. This video is very helpful for understanding it, though.

Finally someone who actually knows what they're doing.

I'm trying to understand all the operations in QuickSort. I was struggling, but with this video, everything makes sense. Thanks!

I don't get the difference, both your useMemo and useCallback are functions in your example

Keep going!

this algorithm is not insertion sort.

Thank you

Woow great explanation

bro i need to learn java script

I like the way you articulate everything, thanks fo rthe video!

awesome explanation thank you

Great Content!

Thank you sir

Thank you for the video, great explanation!

Appreciate you making these videos. Your clear explanations so helpful. FCC has the answers but they can't show every possible solution. You seem to think the same way I do. I knew I wanted to use the split method but was struggling with how to get rid of the redundant code. Thank ou so much!

Thank you! I didn't understand what the question was asking but you clarified it. Thank you so much. Also I loved when you said "but I don't care" and deleted the "only change code above/below this line." New sub based on this clear content.

I appreciate how you simplify it to enhance understanding. Thank you.

thanks for great video!

you hsvr bntoeing voice

bigint has lot of scope for web3

Excellent 👌👍🎉🎉

Hi! I absolutly love this pokedex! You are incredibly talented! is there any way you can do a tutorial on how you created the html and css?

Thank you for your videos, you make it so simple to understand every time

Man, please doing more and don't stop! You have some fantastic topics and go really into detail in all of them!! Just discovered your channel and damn man. I promise you keep going and you will have 500k :D

Love this video. It taught me a lot of things 🖤

function sym(...args) { const symDif = new Set() const argsSet = args.map((arr)=> new Set(arr)) for (const arr of argsSet){ for (const num of arr){ if (symDif.has(num)){ symDif.delete(num) } else { symDif.add(num) } } } return Array.from(symDif) }

🔥

Can you please share the slides as well cheers 🙌

Thank You

Man I'm getting my diploma in a month and these questions are making my brain hurt. We never really did practical runs with data structures and algorithms and man I'm glad I'm learning it now but ngl feel like an idiot haha

function symm(arg1, arg2) { const diff = [ ...arg1.filter(f => !arg2.includes(f)), ...arg2.filter(f => !arg1.includes(f)) ] return diff; } function sym(...args) { let arr = args.map(arg => [...new Set(arg)]); let res = arr[0] for(let i = 1; i < arr.length; i++) { res = symm(res, arr[i]); } return res.sort() } console.log(sym([1, 2, 3, 3], [5, 2, 1, 4]))

It's a real pity that such an excellent channel is abandoned (:

Awesome. But what happens when you have 30 elements... Call stack?

this is extremely informative! keep making such videos brother.

It is not sorted from least to greatest

🙏🙏🙏🙏🙏

Awesome!

This implementation does not sort this array [-1, -6, 5, 9, 2, 10, 67]

thank you so much for the video !!! i really appreciate this and for ppl who wants break down in the text here is my break down based on justin's video - g(3, [1, 2, 3]) - g(2, [1, 2, 3]) - g(1, [1, 2, 3]) - **Base case**: Push `[1, 2, 3]` to output - g(2, [1, 2, 3]) // First iteration of the loop - N === 2, so we swap [1, 2, 3] to [2, 1, 3] - g(1, [2, 1, 3]) - **Base case**: Push `[2, 1, 3]` to output - g(3, [1, 2, 3]) // Second iteration of the loop - N === 3, swap [2, 1, 3] to [3, 1, 2] - g(2, [3, 1, 2]) - g(1, [3, 1, 2]) - **Base case**: Push `[3, 1, 2]` to output - N === 2, swap [3, 1, 2] to [1, 3, 2] - g(1, [1, 3, 2]) - **Base case**: Push `[1, 3, 2]` to output - g(3, [1, 2, 3]) // Third iteration of the loop - N === 3, swap [1, 3, 2] to [2, 3, 1] - g(2, [2, 3, 1]) - g(1, [2, 3, 1]) - **Base case**: Push `[2, 3, 1]` to output - N === 2, swap [2, 3, 1] to [3, 2, 1] - g(1, [3, 2, 1]) - **Base case**: Push `[3, 2, 1]` to output

This video saved my life, thank you!

great content, do you have something on rtk/query?

Really good explanation! Thank you for your work!

This man really gives us very detailed explanation good job man because of this i understand how this shitty promises methods works thanks to you