You are on level: Student
Overview
Basic Data Structures
Basic Algorithms
Same Direction
Opposite Direction
Sliding Window
Cycle Finding
DFS on Tree
Binary Search Tree
Combinatorial Search
Additional States
Aggregation and Memoization
Additional Practices
Speedrun
Vanilla BFS
Matrix as Graph
Implicit Graph
Directed Graph / Topological Sort
Weighted Graph
Minimum Spanning Tree
Introduction
Constant Transition
Grid
Dual-Sequence
Non-constant Transition
Knapsack, Weight-Only
Knapsack, Weight+Value
Topological Sort
Additional Practices
Disjoint Set Union | Union Find
Data Structure Design
Segment Tree
Monotonic Stack
Line Sweep
Tree Traversal without Recursion
Amazon OA
Microsoft OA
Google OA
Editorials
Given two strings, find the length of their longest common subsequence (LCS).
A subsequence is formed by deleting zero or more characters without changing the order of the remaining characters. For example, "ace" is a subsequence of "abcde" because we can delete "b" and "d". But "aec" is not, because the order changes.
word1 = "abcde" word2 = "ace" LCS = "ace", length = 3