Longest Subsequence Repeated K Times | Dataford Interview Questions

Longest Subsequence Repeated K Times (LC 2014)

Asked in the OA stage. Given a string s and integer k, return the lexicographically largest longest subsequence sub such that sub repeated k times is a subsequence of s.

Contract

Implement def get_longest_subsequence(s, k):. Return a string. A subsequence preserves character order but need not use contiguous characters. Return "" if no non-empty subsequence qualifies.

Constraints

1 <= len(s) <= 200
1 <= k <= len(s)
s contains only lowercase English letters
Return the lexicographically largest result among results with maximum length

Function Signature

def get_longest_subsequence(s, k):

Your question is Longest Subsequence Repeated K Times. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem