Description
Lecture Notes/C++/Java Codes: https://takeuforward.org/data-structure/maximum-sum-of-non-adjacent-elements-dp-5/
Problem Link: https://bit.ly/3q5rlUY
Make sure to join our telegram group for discussions: https://linktr.ee/takeUforward
Pre-req for this Series: https://www.youtube.com/watch?v=yVdKa8dnKiE&list=PLgUwDviBIf0rGlzIn_7rsaR2FQ5e6ZOL9
Full Playlist: https://www.youtube.com/watch?v=FfXoiwwnxFw&list=PLgUwDviBIf0qUlt5H_kiKYaNSqJ81PMMY
In this video, we have discussed how to solve the problem of the maximum sum without taking adjacent elements. Here the concept of pick non pick has been explained.
If you have not yet checked our SDE sheet, you should definitely do it: https://takeuforward.org/interviews/strivers-sde-sheet-top-coding-interview-problems/
You can also get in touch with me at my social handles: https://linktr.ee/takeUforward
