Longest Increasing Subsequence at Squarepoint Capital
Medium59.0% acceptance
This problem has 75.0% frequency at Squarepoint Capital.
Problem Description
Given an integer array `nums`, return _the length of the longest**strictly increasing**_ _**subsequence**_.
Read full problem and hintsTopics
Also asked at 29 companies
More Squarepoint Capital Questions
Search Suggestions SystemMediumBest Time to Buy and Sell StockEasySubarray Product Less Than KMediumMaximum SubarrayMediumFrog JumpHard
View all Squarepoint Capital questions