Dayumn! This is something I needed from long time. Even I do catogarize every problem in my excel sheet, but have not categorized all in one place. Thanks algo monster. Subscribed :)
Just a reminder : the flow chart on website is not so easy to read or copy, should consider to make it spreadsheet or pdf or infographics so that easy to carry or use.
KMP, BM, Robin-Karp, FA are too academic (took researches years to figure it out) and almost never expected in a real interview cuz it's just be memorization at that point. Check out end of this article about this topic: algo.monster/problems/stats LCS LIS are covered in the DP. LCS would fall into "multiple sequences", LIS in "max/min".
I feel like "one pass" is more of an implementation than approach cuz it could be anything from greedy to dp and things in between. And I would say postfix sum, and sufficient max algorithms are variations of prefix-sum with an implementation tweak. 2sum would fall into 'find or enumerate indexes'
You could try them in order, combined with time complexity to algo (ruclips.net/video/eB7SMsE6qEc/видео.html). The good thing about these coding problems is there are only a very limited pattern variations so you can try and error out most of the time.
When he was talking about Monotonic conditions the explanation from the text and what I know are different from what he said, he mentioned that you would look for properties that are always increasing or decreasing whilst it should be never increasing or decreasing. Am I missing something.
The visual here should make it clear: algo.monster/problems/binary-search-monotonic monotonic condition means it's either always increasing/decrease, not a mix of the two.
My only problem is how to type the code for that problem; I'm now starting LeetCode and I have my projects out of the way but I don't know which to type first like for, if/else statements, while, etc.
Hey, thanks so much! The flowchart, the explainations and examples are all here: algo.monster/flowchart click on a node to see the explanation and examples
![BLACK BAG - Official Trailer [HD] - Only in Theaters March 14](http://i.ytimg.com/vi/Du0Xp8WX_7I/mqdefault.jpg)
The flowchart: algo.monster/flowchart
Dayumn! This is something I needed from long time.
Even I do catogarize every problem in my excel sheet, but have not categorized all in one place.
Thanks algo monster.
Subscribed :)
Just a reminder : the flow chart on website is not so easy to read or copy, should consider to make it spreadsheet or pdf or infographics so that easy to carry or use.
have you made a copy of it...! can you share me...!
Make a Chrome Extension
@@PeterParker-ee6epdid u ever get it?
@@ultra_nerd no
I literally was creating a flow chart for my self this morning ! Can’t wait to see what yours looks like
Ya know what they say, great minds think like, lol!
I want to take a printout of this flow chat, Could I get a pdf?
Thank you! it's useful!
Are you guys still making the graph video?
This seems incredibly useful, Thanks a ton!
Can you also do ones for string-related problems with algorithmns like KMP, BM, FA, LCS, LIS, RABIN-KARP, AC, etc
KMP, BM, Robin-Karp, FA are too academic (took researches years to figure it out) and almost never expected in a real interview cuz it's just be memorization at that point. Check out end of this article about this topic: algo.monster/problems/stats
LCS LIS are covered in the DP. LCS would fall into "multiple sequences", LIS in "max/min".
Does this mean one has to memorize the flow chart completely?
what library it uses?
10:30 What about one pass, postfix sum, and sufficient max algorithmns? The two sum problems for instance typically also has a one pass approach
I feel like "one pass" is more of an implementation than approach cuz it could be anything from greedy to dp and things in between. And I would say postfix sum, and sufficient max algorithms are variations of prefix-sum with an implementation tweak. 2sum would fall into 'find or enumerate indexes'
Amazing!Thank you
hey can you provide an image link for that?
Great video guys.Your website is Gold and I am sharing it to my friends
Awesome, You rock! Thanks for sharing.
One piece of feedback is what to do when a question has multiple key phrases in it .
Which one do you go with at that point ?
You could try them in order, combined with time complexity to algo (ruclips.net/video/eB7SMsE6qEc/видео.html). The good thing about these coding problems is there are only a very limited pattern variations so you can try and error out most of the time.
@@algo.monster nice ! Can’t wait for the more in depth videos using the flow chart .
Hey it’s been 3 months. Where the heck is my follow up video ? 😢
when would you post qn solving with this cheetsheet
i love you guys. great vid
When he was talking about Monotonic conditions the explanation from the text and what I know are different from what he said, he mentioned that you would look for properties that are always increasing or decreasing whilst it should be never increasing or decreasing. Am I missing something.
The visual here should make it clear: algo.monster/problems/binary-search-monotonic
monotonic condition means it's either always increasing/decrease, not a mix of the two.
My only problem is how to type the code for that problem; I'm now starting LeetCode and I have my projects out of the way but I don't know which to type first like for, if/else statements, while, etc.
Go back to basics bruh
@@Gottastudyhard-m3b You're not better than anyone.
Hi and thank you so much for the content. Is there some way for me to get the slides of the video? I want the examples so I can go try them please.
Hey, thanks so much! The flowchart, the explainations and examples are all here: algo.monster/flowchart click on a node to see the explanation and examples
for graphs any flowchart?
added to algo.monster/flowchart