Summary
Full Transcript
Recursion BackTracking #dsa #graph #datastructure What is Graphs in DSA and why do we need it. We talked about it with the help of real world example and it will help everyone to get command over graphs. Day 26/60 of challenge..... 1: Minimum number of Coins: https://www.geeksforgeeks.org/problems/-minimum-number-of-coins4426/1?itm_source=geeksforgeeks&itm_medium=article&itm_campaign=bottom_sticky_on_article 2: Shop in Candy Store: https://www.geeksforgeeks.org/problems/shop-in-candy-store1145/1?itm_source=geeksforgeeks&itm_medium=article&itm_campaign=bottom_sticky_on_article 3: Assign Mice Holes: https://www.geeksforgeeks.org/problems/assign-mice-holes3053/0 4: Minimum rotations to unlock a circular lock: https://www.geeksforgeeks.org/problems/minimum-rotations-to-unlock-a-circular-lock1001/1?itm_source=geeksforgeeks&itm_medium=article&itm_campaign=bottom_sticky_on_article 5: N meetings in one room: https://www.geeksforgeeks.org/problems/n-meetings-in-one-room-1587115620/1 6: Job Sequencing Problem: https://www.geeksforgeeks.org/problems/job-sequencing-problem-1587115620/1 7: Single-Threaded CPU: https://leetcode.com/problems/single-threaded-cpu/description/ 8: Fractional Knapsack: https://www.geeksforgeeks.org/problems/fractional-knapsack-1587115620/1?itm_source=geeksforgeeks&itm_medium=article&itm_campaign=bottom_sticky_on_article 9: Non-overlapping Intervals: https://leetcode.com/problems/non-overlapping-intervals/description/ 10: Insert Interval: https://leetcode.com/problems/insert-interval/description/ 11: Task Scheduler: https://leetcode.com/problems/task-scheduler/description/ 12: Huffman Encoding: https://www.geeksforgeeks.org/problems/huffman-encoding3345/1?itm_source=geeksforgeeks&itm_medium=article&itm_campaign=bottom_sticky_on_article 00:00 Introduction 00:44 Understanding Greedy Algorithm 02:15 Problem 1 - Min Number of Coins 12:43 Code Part - Min Number of Coins 16:41 Problem 2 - Shop in Candy Store 23:03 Code Part - Shop in Candy Store 28:18 Problem 3 - Assign Mice to Holes 35:50 Code Part - Assign Mice to Holes 38:01 Problem 4 - Min Rotation to unlock a circular Lock 44::44 Code Part - Min Rotation to Unlock a circular lock 47:36 Problem 5 - N meeting in one Room 57:51 Code Part - N meeting in one Room 1:06:12 Problem 6 - Job Sequencing Problem 1:17:42 Code Part - Job Sequencing Problem 1:24:04 Time and Space Complexity & Optimized Method : Job Sequencing Problem 1:38:28 Code Part - Optimized Method - Job Sequencing Problem 1:43:02 Problem 7 - Single Threaded CPU 2:09:21 Code Part - Single-Threaded CPU 2:19:24 Problem 8 - Fractional Knapsack 2:26:36 Code Part - Fractional Knapsack 2:34:49 Problem 9 - Non-Overlapping Intervals 2:43:36 Code Part - Non-Overlapping Intervals 2:47:10 Problem 10 - Insert Interval 2:52:00 Code Part - Insert Interval 2:59:14 Problem 11 - Task Scheduler 3:27:20 Code Part - Task Scheduler 3:33:12 Problem 12 - Huffman Coding 4:09:16 Code Part - Huffman Coding 4:25:32 Last Note !! Video will come on Mon-Fri at 6am in the morning DSA Course for free C++ Free Course Rohit Negi DSA Course C++ Coder Army DSA Course c++ Function in C++ Pointers in C++. Strings Vector Introduction to Recursion Join Our Whatsapp Channel: https://whatsapp.com/channel/0029Va6H0tbHVvTbcuT99Y1f connect to me on Instagram: https://rohit978.page.link/insta Linkedin: https://rohit978.page.link/linkedin Telegram: https://rohit978.page.link/telegram
