Longest Subsequence Repeated k Times | leetcode 2014

In this video, we tackle “Longest Subsequence Repeated K Times”, a brilliant combination of BFS and greedy expansion.

We build possible subsequences lexicographically and check which ones appear at least k times in the original string — using a helper function and queue-based exploration.
A great problem to practice subsequence logic, counting patterns, and pruning with character constraints.

#LeetCode #CPlusPlus #BFS #Greedy #Subsequence #CodingInterview #DSA

🔗 Connect with me on LinkedIn: https://www.linkedin.com/in/sajeeb-das

Видео Longest Subsequence Repeated k Times | leetcode 2014 канала Sajeeb Das Shuvo