Water the plants | Intuition Explained | Similar Problem | GfG POTD

Subscribers:
101,000
Published on ● Video Link: https://www.youtube.com/watch?v=_twHfnNwTwE



Duration: 32:30
2,630 views
173


Whatsapp Community Link : https://www.whatsapp.com/channel/0029Va6kVSjICVfiVdsHgi1A
This is the 25th Video of our Playlist "Greedy Technique : Popular Interview Problems".
In this video we will try to solve a good and famous interview problem - Water Plants (GFG POTD)

I will explain the intuition so easily that you will never forget and start seeing this as cakewalk EASYYY.
We will do live coding after explanation and see if we are able to pass all the test cases.
Also, please note that my Github solution link below contains both C++ as well as JAVA code.

Problem Name : Water the plants
Company Tags : Microsoft
My solutions on Github(C++ & JAVA) : https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Greedy/Water%20the%20plants.cpp
GfG Link : https://www.geeksforgeeks.org/problems/water-the-plants--170646/1


My DP Concepts Playlist : https://youtu.be/7eLMOE1jnls
My Graph Concepts Playlist : https://youtu.be/5JGiZnr6B5w
My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Interview_DS_Algo
Subscribe to my channel : https://www.youtube.com/@codestorywithMIK
Instagram : https://www.instagram.com/codestorywithmik/
Facebook : https://www.facebook.com/people/codestorywithmik/100090524295846/
Twitter : https://twitter.com/CSwithMIK


Approach Summary : The goal is to find the minimum number of sprinklers needed to cover the entire gallery. The algorithm creates a vector of pairs representing the left and right boundaries of each sprinkler's coverage. It then sorts this vector based on the left boundary. The algorithm iterates through the sorted vector to determine the minimum number of sprinklers needed by considering the coverage of each sprinkler and updating the coverage range accordingly. If it's not possible to cover the entire gallery, the function returns -1. Otherwise, it returns the minimum number of sprinklers required.

╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝

✨ Timelines✨
00:00 - Introduction

#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge#leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview#interviewtips #interviewpreparation #interview_ds_algo #hinglish #github #design #data #google #video #instagram #facebook #leetcode #computerscience #leetcodesolutions #leetcodequestionandanswers #code #learning #dsalgo #dsa #2024 #newyear




Other Videos By codestorywithMIK


2024-01-27Thank You for the TRUST ❤️🙏 #codestorywithMIK
2024-01-27K Inverse Pairs Array | Recursion | Memoization | Bottom Up | Optimal Bottom Up | Leetcode 629
2024-01-26Out of Boundary Paths | Recursion | Memoization | Bottom Up | Optimal Bottom Up | Leetcode 576
2024-01-23Pseudo-Palindromic Paths in a Binary Tree | 2 Ways | Bit Magic | Leetcode 1457
2024-01-23Maximum Length of a Concatenated String with Unique Characters | Using Bit Magic | Leetcode 1239
2024-01-22Paths from root with a specified sum | Simple | Story To Code | GfG POTD
2024-01-21Count the Number of Houses at a Certain Distance I | Why Graph | Leetcode 3015 | Weekly Contest
2024-01-21Minimum Number of Pushes to Type Word I and II | Leetcode 3014 | Leetcode 3016 | Weekly Contest
2024-01-20Distribute candies in a binary tree | Intuition | Story To Code | GfG POTD
2024-01-18Normalization vs Denormalization in RDBMS | Examples | Tables | SQL Query | codestorywithMIK
2024-01-18Water the plants | Intuition Explained | Similar Problem | GfG POTD
2024-01-15Maximum Number That Sum of the Prices Is Less Than or Equal to K |Brute Force |Optimal |Contest 380
2024-01-14Find Beautiful Indices in the Given Array | Part I | Part II | Same Code | KMP | Weekly Contest 380
2024-01-12Minimum Number of Steps to Make Two Strings Anagram | Simple | Intuitive | Google | Leetcode 1347
2024-01-11Reverse First K elements of Queue | Simple | Intuitive | Amazon | GfG POTD
2024-01-10Amount of Time for Binary Tree to Be Infected | Using DFS | One Pass | Leetcode 2385
2024-01-09Amount of Time for Binary Tree to Be Infected | Using BFS | Leetcode 2385
2024-01-09Knuth-Morris-Pratt KMP String Matching Algorithm | Search Pattern | GFG POTD
2024-01-08Reverse Linked List | Merge Two Sorted Lists | Reverse Order | Leetcode 206 | Leetcode 21 | GFG POTD
2024-01-07Maximize the Number of Partitions After Operations | Leetcode Weekly Contest 379 | Leetcode 10038
2024-01-06Thank you for the Trust ❤️🙏 #codestorywithMIK