Oooooh! I dislike recursive programming...I don't find it intuitive at all. This video is very helpful for understanding it, though.
@d.lindstrom7130Ай бұрын
Finally someone who actually knows what they're doing.
@williamsouza6760Ай бұрын
I'm trying to understand all the operations in QuickSort. I was struggling, but with this video, everything makes sense. Thanks!
@VisoBoard2 ай бұрын
I don't get the difference, both your useMemo and useCallback are functions in your example
@francescoPace272 ай бұрын
Keep going!
@Takatou__Yogiri3 ай бұрын
this algorithm is not insertion sort.
@alexgolomb3634 ай бұрын
Thank you
@amancca5 ай бұрын
Woow great explanation
@user-dg9ov7gf8u6 ай бұрын
bro i need to learn java script
@N1rOx7 ай бұрын
I like the way you articulate everything, thanks fo rthe video!
@rebinabdollahi34837 ай бұрын
awesome explanation thank you
@devishasingh98177 ай бұрын
Great Content!
@JH-bw9lu7 ай бұрын
Thank you sir
@foodfairyshi8 ай бұрын
Thank you for the video, great explanation!
@learningwithmichelle19088 ай бұрын
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!
@learningwithmichelle19088 ай бұрын
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.
@bishnuthapako9 ай бұрын
I appreciate how you simplify it to enhance understanding. Thank you.
@daeseokdarcyyu15409 ай бұрын
thanks for great video!
@daanbanaan36799 ай бұрын
you hsvr bntoeing voice
@amansinghchauhan11429 ай бұрын
bigint has lot of scope for web3
@mrajkishor3319 ай бұрын
Excellent 👌👍🎉🎉
@user-zf9uz8xp6s10 ай бұрын
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?
@poudlardo10 ай бұрын
Thank you for your videos, you make it so simple to understand every time
@Koko-pg8wu10 ай бұрын
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
@ebubesunday488010 ай бұрын
Love this video. It taught me a lot of things 🖤
@juanferrer588510 ай бұрын
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) }
@dimahinev10 ай бұрын
🔥
@subhashmalireddy821111 ай бұрын
Can you please share the slides as well cheers 🙌
@meditationrelaxationmusic645411 ай бұрын
Thank You
@thinBillyBoy11 ай бұрын
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
@prabeshregmi337211 ай бұрын
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]))
@evgeniy337011 ай бұрын
It's a real pity that such an excellent channel is abandoned (:
@AngleCoding11 ай бұрын
not abandoned! Just dealing with work and two babies currently :D . I do plan on getting back into it soon
@devishasingh98177 ай бұрын
Please make more videos soon! Love your videos
@johnkortis9799 Жыл бұрын
Awesome. But what happens when you have 30 elements... Call stack?
@w__h Жыл бұрын
this is extremely informative! keep making such videos brother.
@angelochristiancabbab7145 Жыл бұрын
It is not sorted from least to greatest
@mearn_ctaftsman Жыл бұрын
🙏🙏🙏🙏🙏
@ahmed-shamim Жыл бұрын
Awesome!
@mamthavenkatesh9990 Жыл бұрын
This implementation does not sort this array [-1, -6, 5, 9, 2, 10, 67]
@Mario_Speedwagon7 ай бұрын
It does for me - check your code
@suzu6165 Жыл бұрын
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
@RoldyWins Жыл бұрын
This video saved my life, thank you!
@samucancld Жыл бұрын
great content, do you have something on rtk/query?
@eneiarestivan Жыл бұрын
Really good explanation! Thank you for your work!
@andreidublas7229 Жыл бұрын
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
@sologuitardeshchatterjee Жыл бұрын
Great explanation, concept clear. Thanks!
@abduqnauy5434 Жыл бұрын
You are so intelligent, thank you
@abhishekbharti704 Жыл бұрын
The title of this video should be "Insertion Sort Made Ez"...love the way he explained 🤓
@lucasdamasceno7068 Жыл бұрын
Thanks bro They easy but it's Very hard to get
@lucasdamasceno7068 Жыл бұрын
thanks bro. am i really gonna learn seing other peoples logitic ?