← AlgoMindset 75

Longest Common Subsequence

Medium🎙 Interview me on this

🧠 Before you code — what pattern fits?

Given two strings text1 and text2, return the length of their longest common subsequence (characters in order, not necessarily contiguous), or 0 if there is none.

("abcde","ace") → 3

("abc","def") → 0

🎬 Video explanation · NeetCode

Your solution runs against 3 unit tests, including edge and large-value cases.

Loading...

Test console · 3 unit tests

Submit your code to run it against all 3 unit tests. Results appear here.

JavaScript, TypeScript & Python run sandboxed in your browser; other languages run on the execution server. Your code is saved locally as you type.