Thanks, Shiran. This is by far the best explanation I've seen in whole youtube. Believe me I have watched literally all the popular coding solutions channel. You countered the obvious question so simply & logically, it's just amazing.
Shiran, I absolutely love the way you explain things, you have an excellent thought process that seems logical and incremental. Please don't stop making videos you are amazing!
im only half way through but i have to thank you for making such a clear video. everything is on point. i love how you start from the other possible solutions and pointing out how to improve on them etc. you're amazing!
Very helpful, really love the illustrations through your explanation in the video, makes understanding the topic so much easier , please keep uploading these types of 'LeetCode problem explanations' videos.
The sum from 1 to n can be calculated by a simple formula - n(n+1)/2. Subtracting this sum from the overall sum of the array would give us the duplicate number right? A much simpler algorithm fulfilling all requirements
great insights,but I would rather take the slow and fast pointer approach for Floyd's algorithm,that will also give the same output,even in linkedlist we use this same formula😃
Hii! I'm Amit from India.Your solution viedeos are really fascinating. I like the most in your videos is that first you describe the naive approach and then do the optimal way to solve it. It would be really helpful if you provide the solution of leetcode problem 31. Next permutation and 79.word search.
Great thing about your videos are , you just don’t talk about the brute force approach instead you write that solution and dry run then also solves using the optimal solution, I have watched many RUclips channels but no one has the patience like you or explain. Because they never much focus on the brute force. That becomes difficult to learner to come up with the optimal solution.
We all sometimes read a solution and think “how in the world was I supposed to come up with that??” so that’s why I want to explain the whole process from naive to optimal. I’m glad you enjoy it :)
![Google Coding Interview Question and Answer - Min Cost To Hire K Workers [LeetCode 857]](http://i.ytimg.com/vi/o8emK4ehhq0/mqdefault.jpg)
![LeetCode 1010. Pairs of Songs with Total Durations Divisible by 60 [Coding Question Explained]](http://i.ytimg.com/vi/gMtxNQHy388/mqdefault.jpg)
Thanks, Shiran. This is by far the best explanation I've seen in whole youtube. Believe me I have watched literally all the popular coding solutions channel. You countered the obvious question so simply & logically, it's just amazing.
Shiran, I absolutely love the way you explain things, you have an excellent thought process that seems logical and incremental. Please don't stop making videos you are amazing!
Thank you! what a lovely comment 😊
Wow! that thought process Loved it please keep posting more of leetcode
This channel is pure gold.
😊😊
im only half way through but i have to thank you for making such a clear video. everything is on point. i love how you start from the other possible solutions and pointing out how to improve on them etc. you're amazing!
😊😊 Thank you! I’m glad you enjoyed it
@@ShiranAfergan not only that but your visuals, production quality, and editing is amazing! :👍🏻😆
Why don't you create videos? Really good explanation
thankyou shiran for this lucid explanation
Thanks! I’m glad you liked it 🙂
Very helpful, really love the illustrations through your explanation in the video, makes understanding the topic so much easier , please keep uploading these types of 'LeetCode problem explanations' videos.
How you come up with so logical way of moving to approach with intuition. Can you help to statr thinking that way with some resources
You are a worthy Fang engineer
😆Thanks :)
great explanation all over youtube.
Ma'am, you teach really well. Please don't stop making videos.😊😊
Thank you this is much needed 💗
The sum from 1 to n can be calculated by a simple formula - n(n+1)/2. Subtracting this sum from the overall sum of the array would give us the duplicate number right? A much simpler algorithm fulfilling all requirements
Notice that the duplicate can appear more than twice. For example [1,2,2,2]
@@ShiranAfergan oh I see. Missed that. Makes sense. Great explanation
great insights,but I would rather take the slow and fast pointer approach for Floyd's algorithm,that will also give the same output,even in linkedlist we use this same formula😃
Hii! I'm Amit from India.Your solution viedeos are really fascinating. I like the most in your videos is that first you describe the naive approach and then do the optimal way to solve it. It would be really helpful if you provide the solution of leetcode problem 31. Next permutation and 79.word search.
Hey Amit! Really glad you’re enjoying my videos :) I’ll look into those questions you requested
Great thing about your videos are , you just don’t talk about the brute force approach instead you write that solution and dry run then also solves using the optimal solution, I have watched many RUclips channels but no one has the patience like you or explain. Because they never much focus on the brute force. That becomes difficult to learner to come up with the optimal solution.
We all sometimes read a solution and think “how in the world was I supposed to come up with that??” so that’s why I want to explain the whole process from naive to optimal. I’m glad you enjoy it :)
Mam ur way of explaining is awesome 👌 keep going and keep making videos ..thank you