Category: Dynamic Programming
Difficulty: intermediate
Description: Maximum sum without adjacent elements
Time Complexity: O(n)
Space Complexity: O(1)