Longest increasing subsequence count after replacement
Filed under 1mg
The question
Find the count of the Longest Increasing Subsequence (LIS) for each change made at the ith position in an array from 1 to n.
No write-up yet. Related questions below have one.
Related 1mg questions
Collected from public candidate posts and coding forums. Updated Nov 2026.