Рет қаралды 19,292
This is the video under the series of DATA STRUCTURE & ALGORITHM. We are going to solve Questions from GeeksforGeeks or Leetcode Trapping Rain Water in O(N) Time Complexity and O(N) Space complexity. Given an array arr[] of N non-negative integers representing the height of blocks at index I as Ai where the width of each block is 1. Compute how much water can be trapped in between blocks after raining.
Which is a very famous and Routine question asked in Interview. The question is from the Topics Data structure. A full easy concept in Hindi. This is Question is asked in Many companies like Google, Amazon, Oyo Rooms, Paytm, Samsung, Adobe, etc..
We also Provide courses on Competitive Programming and Data structure. Please see our Full Playlist on our Channel.
----------------------------------------------------------------------------------------
► Homework Question: leetcode.com/p...
----------------------------------------------------------------------------------------
► Trapping Rain Water: practice.geeks...
► Trapping Rain Water: leetcode.com/p...
► PDF of Trapping Rain Water: github.com/Pri...
► CODE of Trapping Rain Water: github.com/Pri...
----------------------------------------------------------------------------------------
*Follow me *
LinkedIn► / iamprince
Facebook► / helloworldofficials
Instagram► / helloworldbyprince
Twitter► / prince_king_
----------------------------------------------------------------------------------------
►Our Playlists on:-
►Competitive Programming : • How to start Competiti...
►C++ Full Course : • L-01 || Introduction a...
►Algorithms : • L-01 || Prefix Sum Arr...
►Data Structure : • Data Structures with C...
------------------------------------------------------------------------
Our Students Contacts Form:-
Form link: docs.google.co...
------------------------------------------------------------------------
#interview_preparation #geeksforgeeks #Hindi