Your videos are best value for time. To the point, with all the necessary details and visuals making it easy to understand and visualize, and no rambling, and wastage of time in writing/typing.
Hi, your videos helped me a lot when I was looking for a job! I know it takes a lot of effort for these, just wanted to let you know we appreciate it! I think if you made videos every week or 2 you would explode, but understand you're probably busy with your full time commitments. Thanks
That's great! Congrats on scoring a job! I wish I could pump out a new video every couple of weeks... But you would not believe how many hours it takes me to make one. I am sure I'll get more efficient at the whole editing/recording/animations/etc. as I go, but for now, it's a slow process =)
boah, ur videos burn through the matter. Pure delight. I hope u can keep the quality up. Are u planning on doin a video on global alignment? Since u already covered the string matching it would fit (imo).
@@stablesort Maybe I'm confusing it with sequence alignment..? As I understoud global alignment deals with finding the overall difference between two strings and is the generalization of "longest common subsequence" (LCS), and algorithms like the Levensthein-distance as well as the Needleman-Wunsch-Algorithm fall into it. I sadly have no outstanding online sources except for wiki :/
Neat. By delaying the update of the parent index for as long as possible, you can deduplicate work. Some values will have some parts of their paths compressed for free, provided that union operations are frequent enough. As well it's a very simple representation. In a worst case scenario though, you could imagine that every time two sets are merged, every single element of the resulting set has the find operation performed on it. For this kind of input, it would be no better(asymptotically) than a naive solution. The naive solution that comes to mind for me is that you can have a hashmap which maps values to the id of the hashset they belong to, have a hashmap which maps set id's to hashsets, and the find and union implementation would be obvious. That being said, the data structure you present would have far less overhead in comparison to two hashmaps and many hashsets.
Hi Vadim! Right, right, you could juggle hashsets, allocate IDs for them, then when merging have another hashmap that can look up an IDs of a hashset given some other IDs, etc. etc. It's possible to take this route but it gets complicated =) By the way, the implementation shown in the video is also not the *most* efficient. But I went with it as I think it's the most readable. Anyway, I feel like this is a good data structure to keep in the "tool box" and it can certainly make your life a lot easier in an interview situation.
Thank you for your effort on the algorithm video. I wanted to share that I found the background music quite distracting, to the point where it was impossible for me to focus on the content.
Hi Andrev, What quality content u have‼‼‼ I'm ammmmazed‼‼‼ There are many yt channels with amazing DS ALGO content, but I guess u r having the best presentation -- graphics, animations, etc I would love to know, if u r interested to share, how u make ur videos. May be u can make a video on this aspect. I will deeply appreciate. And, please don't stop making videos on programming concepts (DS, ALGO, problem solving techniques). Please make millions of them. I became ur fan. I'm gonna watch every videos of yours. Cheers Madhukiran 《btw, did I write ur name correctly❓ -- Andrev》
Thank you for such warm words! To answer your question, I use my cell phone for filming and I use PowerPoint for creating the animations/presentation. I am sure there are better tools out there but hey, this does the job =) Cheers! Andre
Thank you for the video!, Please try avoid using catchy music in the videos, it makes it hard to concentrate (if you have to use music please try use very subtle or barely noticeably)
I'll make you a deal - watch my kids for a few hours while I write up the script and shoot them video :) Life has gotten a bit more complicated here but more vids are on their way. Just need to find some free time!
