- Видео 6
- Просмотров 26 334
AlgoMasterIO
Индия
Добавлен 31 янв 2024
Master Coding, DSA and System Design with Byte Sized Videos.
Reverse a Linked List In-Place | LeetCode Pattern
Master DSA Patterns: algomaster.io/
In this video, I talk about how to reverse a linked list in-place without using extra space.
GitHub repository: github.com/ashishps1/awesome-leetcode-resources
If you want more practice using this algorithm, check out the practice section at algomaster.io
Get a FREE System Design Interview Handbook in your inbox by subscribing to our free newsletter: blog.algomaster.io
In this video, I talk about how to reverse a linked list in-place without using extra space.
GitHub repository: github.com/ashishps1/awesome-leetcode-resources
If you want more practice using this algorithm, check out the practice section at algomaster.io
Get a FREE System Design Interview Handbook in your inbox by subscribing to our free newsletter: blog.algomaster.io
Просмотров: 810
Видео
Kadane's Algorithm in 2 minutes | LeetCode Pattern
Просмотров 2,7 тыс.19 часов назад
Master DSA Patterns: algomaster.io/ In this video, I talk about Kadane's algorithm which is used to solve the Maximum Subarray Problem. If you want more practice using this algorithm, check out the practice section at algomaster.io Get a FREE System Design Interview Handbook in your inbox by subscribing to our free newsletter: blog.algomaster.io
Level Order Traversal of Binary Tree (in 2 minutes)
Просмотров 1,3 тыс.2 месяца назад
Master DSA Patterns: algomaster.io/ In this video, I talk about Level Order Traversal of Binary Tree. Practice problems: Binary Tree Level Order Traversal II: leetcode.com/problems/binary-tree-level-order-traversal-ii/ Binary Tree Zigzag Level Order Traversal: leetcode.com/problems/binary-tree-zigzag-level-order-traversal/description/ Binary Tree Right Side View: leetcode.com/problems/binary-tr...
Prefix Sum in 4 minutes | LeetCode Pattern
Просмотров 14 тыс.2 месяца назад
Master DSA Patterns: algomaster.io/ In this video, I talk about Prefix Sum LeetCode Pattern. More problems using this pattern: blog.algomaster.io/p/692e9d8a-358e-4d47-9a9b-df78b1ac4695 If you want more practice using this pattern, check out the practice section at algomaster.io Get a FREE System Design Interview Handbook in your inbox by subscribing to our free newsletter: blog.algomaster.io
Fast and Slow Pointers in 6 Minutes | LeetCode Pattern
Просмотров 3,5 тыс.2 месяца назад
Master DSA Patterns: algomaster.io/ In this video, I talk about Fast and Slow Pointers LeetCode Pattern. Using this pattern, you can solve multiple arrays and linked lists problems efficiently. More problems using this pattern: blog.algomaster.io/p/bac48ab3-5fb5-45df-a9e0-c3258c1483e2 GitHub code link: github.com/ashishps1/awesome-leetcode-resources/tree/main/patterns If you want more practice ...
Top K Elements in 6 minutes | LeetCode Pattern
Просмотров 4,6 тыс.2 месяца назад
Master DSA Patterns: algomaster.io/ In this video, I talk about Top K Elements LeetCode Pattern. Using this pattern, you can solve problems that involve finding K largest, K smallest or K most frequent elements in a dataset. More problems using this pattern: blog.algomaster.io/p/816c02af-9661-4319-aea0-adfcd65ddcaa GitHub code link: github.com/ashishps1/awesome-leetcode-resources/tree/main/patt...
Bro perfect video❤
super sir
Bhaia mujh dsa samaj nahi aa raha hain main kaise padhu lectures dekhne ke baad aab main kya steps follow karun
I love your videos, but I dont think this is a good explanation. I dont see what is the point of rushing. The core of the problem is understanding why do we use [left - 1], and I dont think just remembering the formula will do any good. Here is my explanation Problem 303: nums = 1 2 3 4 5 prefix= 1 3 6 10 15 prefix[4] = 15, this represents the SUM from index 0 to (including) index 4 prefix[2] = 6, this represents the SUM from index 0 to (including) index 2 lets look at the indexes of prefix array right now: 0 1 2 -> prefix[2] encompasses all of these indexes 0 1 2 3 4 5 -> prefix[4] encompasses all of these indexes visualise this as a two lines of specific length. if you subtract 2 lines (think of it as simple vector subtraction) you are left with 3 4 5. So in the result index 2 is NOT included. But for your result you need to indlude index 2 because of how the problem is defined. Find the sum between two indexes! Hence [left - 1]
we need remaining patterns also sir....pleasee...🤌🤌🤌🤌
keep uploading these videos sir
Thanks for watching guys! If you want to practice more patterns and problems, check out algomaster.io
Good One .. Keep Rocking
The best of alls
Hi sir can create projects on DSA concept it will help to easy understand and as well as real uses
Great video, it was short and clear and very well explained in animated way which stands out from other YT videos, please make more videos like this for algomaster 75, 150 then 300 surely it will help us and you as the code animation is in SYNCs with actual code
Thanks, will do!
Please upload more frequently, thanks.
❤
Nice video sir.
Excellent video sir. Love your way of teaching. Keep uploading remaining pattern videos as soon as possible sir. It would be great help from your side. Thanks in advance sir.
Thank you 😊 I will upload videos more regularly from now on.
the first video to make me understand this technique, great job man 👍
Thanks for watching guys! If you want to practice more patterns and problems, check out algomaster.io
Thanks for watching guys! If you want to practice more patterns and problems, check out algomaster.io
Thanks for watching guys! If you want to practice more patterns and problems, check out algomaster.io
Thanks for watching guys! If you want to practice more patterns and problems, check out algomaster.io
Amazing content...👏👏..can be watched in less time....and build concepts immediately 🎉🎉
This is lit 🔥man ❤
Great explanations! Question, for the happy numbers problem, doesn’t the HashSet solution have the same space complexity as the linked list solution?
No, the linked list solution doesn’t use any extra space.
I have 15 years of experience at multiple FAANGs, and am now studying for an engineering manager interview which requires coding. I’ve watched many RUclips videos but found your videos the most clear and helpful. Wish I had this earlier in my career!
Thank you 🙏
Ashish your equation prefixSum[right] - prefix[left -1] = k is incorrect. Here right is actually the running prefix rum, please fix it so that there is no confusion for other views at 2:36 seconds
man this is so good without timewasting you explain it easily. Please keep the videos coming man your tips have really helped me as I was confused in my leetcode journey.
sir please continue to uploa vidoesmwe want pattern series to be continued it is rea;lly very helpful
Nice explanation sir.do examples with detailed explanation sir❤😊
Which book should I read to start my career in computers , programming and to easy my attitude towards coding?
Poor Explanation
Great explanation. Visuals are very helpful. Great job.
Can't wait to see you make videos of all 15 patterns
Need Sliding window pattern video please.
❤❤🎉
slow down bruh
Please do more patterns videos sir this pattern videos are very useful
Great explanation sir❤
I still don't understand the prefixSum O(n) approach :( Seems awfully convoluted but probally logical once you understand it
Bro can you also make videos on how to calculate complexity of code
Sir can you start with all patterns one by one😢
arrey yaaar
A Question Sir ! I haven't seen such principles applied to development
Hi brother, this is very good for beginners. And also can teach us how to use DSA concept for real-world problem. Can create a simple project that contains all DSA concept plss😊
This best way to learn algorithms in DSA sir 😊😊
Nice bhaiya ❤
Amazing ❤
More video on patterns please!
very easy to understand, thanks man!
❤
❤❤❤