PracHub
QuestionsPremiumLearningGuidesCheatsheetNEWCoaches
|Home/Coding & Algorithms/TikTok

Find length of longest common subsequence

Last updated: Mar 29, 2026

Quick Overview

This question evaluates understanding of dynamic programming, string algorithms, and algorithmic problem-solving skills related to sequence comparison and the longest common subsequence concept.

  • medium
  • TikTok
  • Coding & Algorithms
  • Machine Learning Engineer

Find length of longest common subsequence

Company: TikTok

Role: Machine Learning Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Technical Screen

Given two strings `s` and `t`, return the **length** of their **longest common subsequence**. A subsequence is obtained by deleting zero or more characters without changing the relative order of the remaining characters. ### Input - `s`: string - `t`: string ### Output - Integer length of the longest common subsequence of `s` and `t`. ### Constraints (typical) - `0 <= len(s), len(t) <= 2000` - Strings consist of lowercase English letters (or ASCII characters). ### Example - `s = "abcde"`, `t = "ace"` → output `3` (one LCS is `"ace"`).

Quick Answer: This question evaluates understanding of dynamic programming, string algorithms, and algorithmic problem-solving skills related to sequence comparison and the longest common subsequence concept.

Related Interview Questions

  • Parse a nested list from a string - TikTok (medium)
  • Implement stacks, streaming median, and upward path sum - TikTok (easy)
  • Maximize sum with no adjacent elements - TikTok (medium)
  • Implement stack variants and path-sum check - TikTok (medium)
  • Find the longest palindromic substring - TikTok (easy)
TikTok logo
TikTok
Jan 22, 2026, 12:00 AM
Machine Learning Engineer
Technical Screen
Coding & Algorithms
4
0
Loading...

Given two strings s and t, return the length of their longest common subsequence.

A subsequence is obtained by deleting zero or more characters without changing the relative order of the remaining characters.

Input

  • s : string
  • t : string

Output

  • Integer length of the longest common subsequence of s and t .

Constraints (typical)

  • 0 <= len(s), len(t) <= 2000
  • Strings consist of lowercase English letters (or ASCII characters).

Example

  • s = "abcde" , t = "ace" → output 3 (one LCS is "ace" ).

Comments (0)

Sign in to leave a comment

Loading comments...

Browse More Questions

More Coding & Algorithms•More TikTok•More Machine Learning Engineer•TikTok Machine Learning Engineer•TikTok Coding & Algorithms•Machine Learning Engineer Coding & Algorithms
PracHub

Master your tech interviews with 7,500+ real questions from top companies.

Product

  • Questions
  • Learning Tracks
  • Interview Guides
  • Resources
  • Premium
  • For Universities
  • Student Access

Browse

  • By Company
  • By Role
  • By Category
  • Topic Hubs
  • SQL Questions
  • Compare Platforms
  • Discord Community

Support

  • support@prachub.com
  • (916) 541-4762

Legal

  • Privacy Policy
  • Terms of Service
  • About Us

© 2026 PracHub. All rights reserved.