New
ML System Design & SQL tracks just landed
See what's new
×
Question Bank
Pricing
Blog
Forum
HOT
JobRadar
NEW
Referral
Description
Solution
Discussion
Submissions
Ask AI
Question Bank
Point72
Coding Question
AI Insights
Quick Summary
Find the maximum sum of a subsequence where consecutive elements satisfy a specific index-weighted inequality.
The condition simplifies to requiring that transformed values (price plus index) must be non-decreasing.
Requires efficient range-maximum queries to handle input sizes up to 10^5.
What This Tests
Dynamic programming on subsequences
Coordinate compression
Binary Indexed Tree or Segment Tree for prefix maximums
Mathematical problem transformation
Common Patterns
Dynamic Programming
Sorting
Binary Search
Collapse
Hint 1
Hint 2
Hint 3
What Interviewers May Ask Next
Ask AI Assistant
Ask AI Assistant
Ask me anything about this coding question!
Qwen
Qwen3.6-Flash
0/2000
Auto
Debug
Run
Submit
Test Cases
Input
Output
Expected
