GL
GrindLens
PatternsSheetsPricingQuestions
  1. Home
  2. /Sheets
  3. /LeetCode Top Interview 150
  4. /String Alignment / Subsequence DP
←Back to LeetCode Top Interview 150
Curated IntersectionSheet: LeetCode Top Interview 150Pattern: String Alignment / Subsequence DP

LeetCode Top Interview 150 · String Alignment / Subsequence DP

2D DP over two string indices to compare, align, or count subsequences/substrings between them.

Sheet Problems: 4
Category: Dynamic Programming

Featured Problems (4)

1.Word BreakMedium
Solve↗
2.Longest Palindromic SubstringMedium
Solve↗
3.Interleaving StringMedium
Solve↗
4.Edit DistanceMedium
Solve↗

Explore More Patterns in LeetCode Top Interview 150

Track your progress across all 150 problems in this curriculum roadmap.

Back to LeetCode Top Interview 150String Alignment / Subsequence DP Pattern Guide
GL
GrindLens

Precision pattern analytics and curated sheet tracking for algorithmic coding interview preparation.

Quick lookup:⌘Kor/

Platform

  • Patterns→
  • Sheets→
  • Pricing→

Community

  • Feedback
  • Report a bug
  • X
  • LinkedIn

© 2026 GrindLens. LeetCode is a trademark of LeetCode. GrindLens is an independent analytics platform and is not affiliated with or endorsed by LeetCode.

Terms of ServicePrivacy Policy