AMAZON CODING INTERVIEW - HOUSE ROBBER (LEETCODE)
SOCIAL
--------------------------------------------------------------------------
Patreon: / eriktoor
Instagram: / erik_toor
Youtube (Subscribe): https://www.youtube.com/user/TEDBET62...
Solution Explanation:
First understand the recursive decisions at each level. They boil down to a rob the house at our current iterator and the house 2 houses away or skip the house at our current iterator decision. This would give the top down solution a time and space complexity of O(2^n). By adding memoization we can reduce it to O(n). By making it bottom up and iterating through our houses array with a for loop and memoized array we can solve it in O(n) time and space.
OTHER VIDEOS YOU MIGHT LIKE:
--------------------------------------------------------------------------
GOOGLE INTERVIEW QUESTION - COURSE SCHEDULER II: • GOOGLE INTERVIEW QUESTION - COURSE SCHEDUL...
HOW MR. BEAST UPDATES HIS THUMBNAILS IN REAL TIME WITH PYTHON & PILLOW: • HOW MR. BEAST UPDATES HIS THUMBNAILS IN RE...
MUSIC
------------------------------------------------------------------
young frontwood: / xo-bored-lif3
#amazoninterview #robhouses #leetcode #techinterview
On this page of the site you can watch the video online AMAZON CODING INTERVIEW - HOUSE ROBBER (LEETCODE) with a duration of hours minute second in good quality, which was uploaded by the user Erik Toor 07 June 2020, share the link with friends and acquaintances, this video has already been watched 199 times on youtube and it was liked by 7 viewers. Enjoy your viewing!
