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
На этой странице сайта вы можете посмотреть видео онлайн AMAZON CODING INTERVIEW - HOUSE ROBBER (LEETCODE) длительностью часов минут секунд в хорошем качестве, которое загрузил пользователь Erik Toor 07 Июнь 2020, поделитесь ссылкой с друзьями и знакомыми, на youtube это видео уже посмотрели 199 раз и оно понравилось 7 зрителям. Приятного просмотра!
