42. Trapping Rain Water | leetcode daily challenge | DSA | Hindi | shashwat

Problem Name:
42. Trapping Rain Water

Problem Statement:
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.

Problem link:
https://leetcode.com/problems/trappin...

Java Plus DSA Placement Course Playlist:
   • Java and DSA Course Playlist : Online...  

Java Plus DSA Sheet:
https://docs.google.com/spreadsheets/...

Notes:
https://github.com/Tiwarishashwat/Jav...

Telegram Link:
https://shashwattiwari.page.link/tele...

Ultimate Recursion Series Playlist:
   • Recursion and Backtracking Ultimate S...  

Instagram Handle: (@shashwat_tiwari_st)
https://shashwattiwari.page.link/shas...

Samsung Interview Experience:
   • I cracked Samsung | SRIB Interview Ex...  

Company Tags:
Facebook | Amazon | Microsoft | Netflix | Google | LinkedIn | Pega Systems | VMware | Adobe | Samsung

Timestamp:
0:00 - Introduction
0:46 - Breaking Down Problem Statement
5:37 - BruteForce Approach
7:03 - trick to handle negative heights
9:04 - optimise the bruteforce process
10:39 - dry run for brute force
15:23 - most optimal solution
23:36 - summary
24:23 - code

#ShashwatTiwari #coding​​ #problemsolving​