Google Coding Interview | House Robber LeetCode Solution | Dynamic programming | EP4

Veröffentlicht am: 28 Juli 2019
auf dem Kanal: JAVAAID - Coding Interview Preparation

17,847

429

House Robber LeetCode Solution :- In this video, I have explained the pattern to solve house robber leetcode dynamic programming problem which is based on maximum sum subsequence non-adjacent pattern.
I have used FAST method to solve this DP problem.
After watching this video, you will be able to solve any dynamic programming problem which is based on maximum sum subsequence non-adjacent pattern.

Here are the Outlines:
00:36 house robber problem statement
04:40 Algorithm
10:08 FAST method to solve any dynamic programming problem
11:42 recursive solution to the house robber problem
13:01 analyse the problem and look for overlapping problems
14:11 memoization technique to save the computation [Top down approach by using cache on global level]
14:48 memoization technique to save the computation [Top down approach by using cache as a method argument]
15:21 pure DP solution [bottom up approach]
17:09 efficient solution
19:53 pattern analysis
23:14 demo

🔴 DONT CLICK THIS: https://bit.ly/2G4cEuc

❤ FAST Technique To Solve Any DP Problems:    • Recursive Staircase Problem | Climbing Sta...

👍 Like us on Facebook:   / hackerranksolutiontutorials

💎Share this video with your friend:    • Google Coding Interview | House Robber Lee...

💡 Source code: https://gist.github.com/kanahaiya/165...

✚ Join our community ►

👉 Coding interview preparation group:   / codingip
👉 Telegram link for algorithmic tutorial: https://t.me/javaaid
👉 Telegram link for hackerrank solutions: https://t.me/hackerranksolutions

✅ Recommended playlists ►

👉 Dynamic Programming Tutorial For Beginner:    • Dynamic Programming Techniques | Dynamic P...
👉 New To JAVAAID ? Watch These Videos:    • Prefix Sum Algorithm | Prefix Sum Array | ...
👉 Algorithms Fundamental:    • Algorithms Fundamental
👉 Coding Interview Questions:    • Coding Interview Questions
👉 All hackerrank solutions:    • How To Master In Data Structures And Algor...

📖 Try below problems to master the concept:
Leetcode problem : https://leetcode.com/problems/house-r...

📖 TOP 10 LEARNING RESOURCES

1) Cracking the Coding Interview :https://amzn.to/30HFJCE
2) Algorithms Hardcover :https://amzn.to/30Hjdd9
3) The Algorithm Design Manual :https://amzn.to/2AEtEDL
4) Data Structures & Algorithms in Java :https://amzn.to/2AG82ag
5) Data Structures and Algorithms Made Easy :https://amzn.to/2M8UvNK
6) Grokking Algorithms :https://amzn.to/2LKu8yD
7) Dynamic Programming for Coding Interviews :https://amzn.to/2AC7BO9
8) Introduction to Algorithms :https://amzn.to/2oSJAzq
9) Elements of Programming Interviews in Java :https://amzn.to/30MBjKO
10) Programming Interviews Exposed :https://amzn.to/2V8mFfO

👋 Let’s Connect ►

Git Hub: https://github.com/kanahaiya
Twitter:   / kanahaiyagupta
Linked in:   / kanahaiya-gupta
Facebook:   / coolkanahaiya
Instagram:   / coolkanahaiya

#JAVAAID #houserobber #maxsumnonadjacent #leetcode #javaAidTutorials #programming #dataStructures #algorithms #coding #competitiveprogramming #google #java #codinginterview #problemsolving #kanahaiyaGupta #hackerrankchallenges #facebook #amazon #oracle #linkedin #airbnb #microsoft

Auf dieser Seite können Sie das Online-Video Google Coding Interview | House Robber LeetCode Solution | Dynamic programming | EP4 mit der Dauer stunde minuten sekunde in guter Qualität ansehen, das der Benutzer JAVAAID - Coding Interview Preparation 28 Juli 2019 hochgeladen hat, den Link mit Freunden und Bekannten teilen, dieses Video wurde auf Youtube bereits 17,847 Mal angesehen und es wurde von 429 den Zuschauern gefallen. Viel Spaß beim Betrachtenden Zuschauern gefallen!

994