Book Club Reading Progression
Book Club Reading Progression
HardArrays0% accepted
Ravi's online book club in Bangalore curates reading schedules. Members must read books sequentially where each book has at most X more pages than the previous one. Find the longest valid reading schedule from N available books.
Approach
Given page counts and max difference X, find the longest subsequence where consecutive elements differ by at most X.
Input
5 2
10 12 13 15 16
Output
5
More Arrays 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