ProblemNest
Sign In
You are coding as a Guest. Sign in with Google in 1 tap to save your daily streak, lock in +50 XP & boost your college rank!
Save Streak (1-Tap Google)
9:00 AM Daily Incident ReleaseMaintaining a 7-day streak grants a 2.5× Recruiter Visibility Multiplier on the Recruiter Talent Radar.
Multiplier Ladder:1d: 1.0ו3d: 1.5ו7d: 2.5× MAX
🔥Longest Increasing Subsequence: Patience SortMedium
DAILY PROBLEM OF THE DAY+50 XP • Daily Streak

Solve today's challenge or tackle one of the 3 Super Hard challenges for +150 XP.

MediumDynamic Programming•Acceptance: 54.6%

Longest Increasing Subsequence: Patience Sort

Targeted in FAANG & Tech OA:GoogleMicrosoftAmazon
Real-World Engineering Context
Used in version control delta diff algorithms (Git patience diff), genomic evolutionary sequence alignments, and stock trend momentum indicators.
Given an integer array `nums`, return the length of the longest strictly increasing subsequence. A subsequence is an array that can be derived by deleting some or no elements without changing the order of the remaining elements. Can you achieve `O(n log n)` time complexity?

Sample Test Cases

Input: [[10,9,2,5,3,7,101,18]]
Expected: 4
Input: [[0,1,0,3,2,3]]
Expected: 4
Input: [[7,7,7,7,7,7,7]]
Expected: 1

Constraints

  • 1 <= nums.length <= 2500
  • -10^4 <= nums[i] <= 10^4
Verified Proof-of-Work ATS PortfolioCryptographic Verification
Export tamper-proof problem verifications to your direct ATS applications
DevScore: Unranked (0/1000)

Every verified problem solve writes authentic cryptographic proof-of-work to your profile. Attach your verified DevScore badge to ATS applications to stand out to engineering hiring teams across 4,000+ verified live tech openings (23,000+ cumulative audited) on RoleNest.

Explore 4,000+ Direct ATS Openings on RoleNest ↗Solve Challenge to Activate Ledger