Auction bids dataset, variant 26. Return the length of the longest strictly increasing subsequence. Implement `solve(nums)` and return the requested value.
DrawCode Practice Problem
Longest Increasing Subsequence · Auction bids 26
Interactive Visualizer Workspace
Explore step-by-step interactive animations, memory state tracking, and live multi-language execution in DrawCode.
Launch Interactive Visualizer