Trapping Rain Water - Google Interview Question - Leetcode 42

🚀 https://neetcode.io/ - A better way to prepare for Coding Interviews 🐦 Twitter: https://twitter.com/neetcode1 🥷 Discord: https://discord.gg/ddjKRXPqtk 🐮 Support the channel: https://www.patreon.com/NEETcode Coding Solutions: https://www.youtube.com/playlist?list=PLot-Xpze53leF0FeHz2X0aG3zd0mr1AW_ Dynamic Programming Playlist: https://www.youtube.com/watch?v=73r3KWiEvyk&list=PLot-Xpze53lcvx_tjrr_m2lgD2NsRHlNO&index=1 Tree Playlist: https://www.youtube.com/watch?v=OnSn2XEQ4MY&list=PLot-Xpze53ldg4pN6PfzoJY7KsKcxF1jg&index=2 Linked List Playlist: https://www.youtube.com/watch?v=G0_I-ZF0S38&list=PLot-Xpze53leU0Ec0VkBhnf4npMRFiNcB&index=2 Problem Link: https://neetcode.io/problems/trapping-rain-water 0:00 - Read the problem 5:40 - O(n) Memory Solution 11:00 - O(1) Memory Solution 20:05 - Coding Explanation leetcode 42 This question was identified as an interview question from here: https://github.com/xizhengszhang/Leetcode_company_frequency #pointer #array #python