Swiggy Loyalty Points Collector
Swiggy Loyalty Points Collector
EasyDynamic Programming0% accepted
Swiggy restaurants are placed in a row. Collecting loyalty points from two adjacent restaurants triggers an anti-fraud alert. Given an array of loyalty points per restaurant, find the maximum points collectable without taking from two adjacent restaurants.
Approach
Maximum sum of non-adjacent elements (House Robber).
Input
4
1 2 3 1
Output
4
More Dynamic Programming problems
Browse all coding problems →solution.py
Loading editor...
Test 1
Test 2
Test 3
Press Run to test your custom input, or Submit to judge against all test cases.
Sign in to continue
Create a free account to run code, submit solutions and track progress.
- Free forever — no credit card
- 10+ languages with live execution
- Points, streaks & leaderboards