Skip to the editor
JSGroundwork
JSGroundwork handwritten · web dev
←Back to DP: 1D

Ready to read

JSJavaScript⑂Git◎Interview prepΣDSA in JSSDSystem Design
More topics15›
</>HTML{ }CSS⚛ReactNNext.jsNeNest.jsTSTypeScriptNoNode.js🐳DockerDBSQL & Databases✓Testing🔒Web Security☁Cloud & DevOps◈GraphQL◆Redis☸Kubernetes
☰‹›
Description
All topics›JavaScript›DP: 1D

Longest Increasing Subsequence

intermediatelayer I7 · DP: 1D5 tests

Given an integer array nums, return the length of the longest strictly increasing subsequence.

  • A subsequence keeps the original order but may skip any elements
  • Equal values do not count as increasing: [7,7,7] gives 1
  • An empty array gives 0
  • The classic table solution is O(n^2); the patience-sorting approach reaches O(n log n). Either passes here

Stuck?

All exercisesPlayground
1234567891011121314
loading the editor…

Nothing yet — hit Run and whatever you log shows up here.

Submit to see how you did.

⌘/Ctrl + Enter run⌘/Ctrl + S save⌘/Ctrl + / comment⌘/Ctrl + F find/replace⌘/Ctrl + D select next matchAlt + click multi-cursorTab indent · ⇧Tab outdentEsc leave fullscreen