Master Data Structures & Algorithms for FREE at AlgoMap.io/
@umeshchaudhari52583 ай бұрын
Thanks greg for your explanations for the problems ❤ it helps me a lot while learning new approaches to solve a problem.
@GregHogg3 ай бұрын
Glad to hear it 😊😊
@stareditz79605 күн бұрын
Thanks Greg
@lakshyabhardwaj21463 ай бұрын
You are a genius greg
@technicallytechnical13 ай бұрын
nice and clean explanation
@JoeTan-nq4fq2 ай бұрын
Thank you for the video explanation. You make the solution so simple. Just a comment - we dun have to keep track of count if we evaluate nums[i] != nums[j-1]. If this is evaluated to be True, then increase j and make nums[j] = nums[i].
@kitaolivia3 ай бұрын
Great solution. However, I found the title and description of this Leetcode problem quite misleading. It asks to remove the duplicates in-place, then return the number of unique values. Most of the solutions I have found do not actually remove duplicates in-place.
@TasCashGr3 ай бұрын
Shorts are underestimating your teaching skills...do videos instead!! Great explanation.
@meetpatel.473 ай бұрын
Can you make video on find missing and duplicate in array?