Loading problem

Max Non-Adjacent Booth Profit

A street fair has booths in a row with profits in array `profit`. You cannot rent two adjacent booths. Return the maximum total profit you can collect.

Examples

in: profit = [2, 7, 9, 3, 1]

out: 12

booths 0, 2, 4 -> 2 + 9 + 1

in: profit = [10, 1, 1, 10]

out: 20

booths 0 and 3

Constraints

0 <= len(profit) <= 10^5
0 <= profit[i] <= 10^4

Hints

target: O(n) time, O(1) space⌘↩ run · ⇧⌘↩ submit