Відео

Hey Team AlgoDaily, You are a great teacher. I like that you take your time and explain things in detail. Question, I understand that traditional two pointer (the pointers are in opposite ends) require the array to the sorted for the traditional two pointer to work. How about the sliding window, a variation of the two pointers? Does sliding window require the array like data structure to be sorted?

my mind was blown

nah

make more videos

nice video

I think the two-pointer technique is the same concept I recently read about in Cracking the Coding Interview, called the 'Runner Technique.'

this solution has a few big bugs. splitting on a "," delim doesn't work as a way to split key:value pairs in an object, because it's possible for strings and lists to contain commas. also, valid JSON can have any amount of whitespace between symbols. this solution assumes a uniform style. e.g. parse("{ "key" : [1, 2, 3]}") is broken, even though it's valid JSON otherwise, nice solution!

Good introduction!

The goat

Goat tutorial

Your explanation is so on point! Thank you for a great video.

how do you handle the usecase of '-.' which should be an invalid string.

Thanks for the video. I haven't come across the cycle problem yet, so it's good to know how it works for when I encounter it. Great explanations and visuals!

Such a great explaination!

I don't usually leave comments but your explanation is so on point. Not too much not too little. Well done! I subscribed to the channel just by watching this video

The program u showed for solving two sum doesn't work correctly as it fails to pass the second test on the leetcode platform because all combinations are not tried.

Great video

If you cant explain it to a 3rd grade student then you dont understand it. This guy gets it! Great tutorial!

you need to return the input at the end of the funtion to make sure the value is returned if it doesn't go through any of the if condition, say parseJSON(2) should return 2

Great video and example thank you

awesome video.

✨ "PromoSM"

Thanks for the video your way of teaching is amazing

You are an amazing teacher thanks for this

Nice content!

gave you a follow brah

Absolutely excellent explanations. Thank you!

The Java solution looked more like recursion that two pointers. It should have taken in a char[] instead of a string. That would have allowed the algo to focus on traversing arrays and two pointers.

Commenting for the algorithm, goodjob!

Great video

What about self taught

So glad I ran into your channel; your way of making concepts visually understandable is a skill in its own right.

The preparation seems kinda extreme, who is this technical interview advice aimed at? Is this for young people who are hoping to break into an industry?

thankyou for explaining in a very easy manner that even a newbie to programming can understand the problem and its solution pretty well. Although I've two questions regarding the two problem examples you discussed. 1) do two pointer technique on TwoSum only work on a sorted array? I don't see accurate results on unsorted arrays. 2) in your problem # 2, will your solution work on a link list with a cycle hoping for more than 1 node?

Whoa, it just ends!

Great video, thank you for the clear explanation :) My question is regarding using the 'two pointer' technique to check for cycles within the linked list, which you present towards the end of the video. Would using more pointers solve the question faster? So if we used 3 pointers, i.e, pointer 1 has a speed of x, pointer 2 -> 2x and pointer 3 -> 3x would we solve the question faster?

Great Work!!!

is there any reason why the while loop condition cant be while the sum of the two pointers != target ?

It can be easily solved with hashMap O(N) time & space. But nice video and solution.

Thank u so much.

stop explaining the theory and get into the practical syntax because none of this works

thank you my brother this is a really good tutorial!

Thank you really you are so helpful instant subscribe

Good job on your presentation! This helped me understand the basic two-pointer concept. My only suggestion would be to make a linked follow "suggested video" discussing what a "cycle" is. You are referring to this "cycle" as if it is a specific concept or data structure, as opposed to base/generic understanding of a cycle being anything that repeats in circular manner. Saying something like "A cycle in Python [or whatever language this is] is where you ping a database connection multiple times until you get a handshake. This can be the source of many headaches and hard to troubleshoot" ... Something like that. I just made that up, but you would of course give the actual explanation of what you are calling a #cycle AND a quick synopsis of why we care about finding one.

Thank you so much for explaining this concept in a clear manner. It was evident that you made an effort to communicate and impart knowledge. And yeah, I sure did learn. Thanks again for this charitable endeavor. Salute!!!

Awesome!

Amazing explanation, very clean and concise. Keep up the great work!

So for the first example the two sum, would this one only applied to sorted array?

Your 1000th Sub !!

two pointers only work ,if it is a sorted array