Problem 3825 · Medium

Longest Strictly Increasing Subsequence With Non-Zero Bitwise AND

Track, for each ending index, the longest increasing run for every bitwise AND value it can produce.

Open the interactive visualisation