Number of Increasing Paths in a Grid II DFS II DP II Graph II Recursion II Leetcode 2328
In this video, I'll talk about how to solve the problem Leetcode 2328. Number of Increasing Paths in a Grid II DFS II DP II Graph II Recursion
Problem Link: leetcode.com/problems/number-...
Code & Notes: drive.google.com/file/d/1G9zM...
Number of Increasing Paths in a Grid II DFS II DP II Graph II Recursion II Leetcode 2328
Let's Connect:
📝Linkedin: / aryan-mittal-0077
📸 Instagram: / aryan_mittal_007
📱Telegram : t.me/aryan_mittal_group
🤖 Github: github.com/aryan-0077
🛍️ Products I use in Videos: (✨ Marked for Mostly requested Products)
Main Camera (Canon 200D ii): amzn.to/41cfS5h
Vlog Camera (iphone 13): amzn.to/42aOJRh
Tripod for Lectures: amzn.to/3HMoloF
Tripod for Vlogs: amzn.to/44wGL6L
✨Mic: amzn.to/41bj8gU
Shadow Multi Colour Light: amzn.to/41bmIrq
Main Light: amzn.to/3LF6BNb
Tripod for Lights: amzn.to/3LFcQAt
Softbox for Lights: amzn.to/42mHqWE
✨My Pen Tablet for Notes: amzn.to/44A61ZJ
✨New Tablet for Notes: amzn.to/44BjTDa
Tablet Stand: amzn.to/3NMFIJR
Power Bank: amzn.to/421yHsZ
✨USB Hub: amzn.to/3p8NGTf
✨HardDisk to store Lectures: amzn.to/3HKafEs
✨My Laptop: amzn.to/44w12ct
✨My Monitor: amzn.to/3LCG6YL
My UPS: amzn.to/3Lydy2y
My UPS old: amzn.to/3LXT0C3
✨My Mouse: amzn.to/3LYmJdY
✨My Keyboard: amzn.to/3NJs4ah
Resources you can try:
Learn Coding: • Complete RoadMap for C...
🎥Channel Playlists
🎥 Baap Graph Series - by Aryan: • Baap Graph Series - by...
🎥Dynamic Programming: • Complete Dynamic Progr...
🎥Bit Manipulation: • Complete BIT MANIPULAT...
🎥Mathematics for DSA: • Complete Mathematics f...
🎥Leetcode Top Interview Questions: • FAANG & Leetcode Inter...
🎥Codeforces Problem B Ladder: • Complete PROBLEM B LAD...
🎥Codeforces Problem C Ladder: • Codeforces PROBLEM C L...
🎥Codeforces Problem D Ladder: • Complete PROBLEM D LAD...
🎥 Top 150 Interview Questions: • Top 150 Interview Ques...
🎥 Complete Array Problem Playlist: • Complete Array Intuit...
🎥 Complete Binary Search Problem Playlist: • Complete Binary Search...
🎥 Complete Stack Playlist: • Complete Stack & Queue...
🎥 Complete Graph Problem Playlist: • Complete Graph Intuiti...
🎥 Complete TREE Playlist: • Complete TREE Intuitio...
🎥 Complete DP Problem Solving: • Complete DP Intuition ...
🎥 Complete Linked List: • Complete Linked List I...
🎥 Complete Greedy Problem Playlist: • Complete Greedy Intui...
🎥 Complete Divide & Conquer Algorithm Playlist: • Complete Divide & Conq...
🎥 Complete Trie Playlist: • Complete Trie Intuitio...
🎥 Complete Mathematics & Number Theory Problems: • Complete Mathematics &...
About Channel:
We teach about how you can grow in life & educate about programming in Fun & Intuitional way.
About Me:
I am Aryan Mittal - a Software Engineer, Speaker, Creator & Educator. During my free time, I create programming education content on this channel & also how to use that to grow :)
✨ Timelines✨
0:00 - Bakwas
0:38 - Problem Explanation
4:26 - Intuition from Example
10:30 - Logic
12:30 - Code Explanation
✨ Hashtags ✨
#programming #Interviews #leetcode #faang #maang #datastructures #algorithms
Пікірлер: 16
Code & Notes: drive.google.com/file/d/1G9zMf2HrRRZbpVbHiqLOpbSFrtWtFvYo/view?usp=sharing Today's Live Contest Discussion might not come, Not feeling well 🥲. But I will try my best
@madhavgupta2002
Жыл бұрын
if live isnt possible, kindly provide solutions as per ur convenience if possible
perfect length
today i was drunk but your video motivated me to do the problem and finally i did it, omg hat's off to you bruh😂😂😂😂😂😂
Classic textbook DP problem. I think this should be a good testing problem once you've learned very basic DP.
Quality content and clear explanation. Subscribed
Thanks 😊
This was so smart man loved the problem especially memoization part
very nice thanks
keep all videos around 15-17 min long max
class Solution { public: int mod=1e9+7; int delrow[4]={1,-1,0,0}; int delcol[4]={0,0,1,-1}; int countPaths(vector& grid) { int m=grid.size(); int n=grid[0].size(); //{vector,{i,j}} queueq; unordered_mapmp; for(int i=0;i
hai Aryan I had doubt how you saying by seeing constraints it wont work like in this said 1e5*1e5 wont work ..
@varunaggarwal7126
Жыл бұрын
online compilers don't like anything beyond 10^8
Live stream??
No need to put so many mods, we should put only where needed
Explanation becomes cringy when you start doing some nonsense. Try to keep it simple bruh!