# Longest Subsequence Repeated K Times: Study Guide

Longest Subsequence Repeated K Times shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Find the longest string x such that x repeated k times is a subsequence of s (tie: lex largest). The candidate alphabet is letters whose count is at least k. BFS/backtracking builds candidates from longer/lex-larger strings and checks the subsequence condition.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n * |candidates|) with a small alphabet.

## Common mistake

Requiring x itself to be a substring, or repeating x only k-1 times when checking.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI job interview answers in real time.