---
title: "Discussion on \"LeetCode Daily Challenge-2014. Longest Subsequence Repeated k Times(Hard)\" | Hashnode"
description: "Discussion on \"LeetCode Daily Challenge-2014. Longest Subsequence Repeated k Times(Hard)\". DFS with Iterator-Based Validation for Complex Subsequence Problems"
url: "https://hashnode.com/posts/leetcode-daily-challenge-2014-longest-subsequence-repeated-k-timeshard/68664cb19468d38cc3f4b9a0"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [LeetCode Daily Challenge-2014. Longest Subsequence Repeated k Times(Hard)](https://huanganni.hashnode.dev/leetcode-daily-challenge-2014-longest-subsequence-repeated-k-timeshard?utm_source=hashnode&utm_medium=feed)

DFS with Iterator-Based Validation for Complex Subsequence Problems

Jul 3, 2025 · 5 min read · huanganni.hashnode.dev  
Read the article

-   [#dfs](https://hashnode.com/tag/dfs)
-   [#string](https://hashnode.com/tag/string)
-   [#backtracking](https://hashnode.com/tag/backtracking)
-   [#greedy](https://hashnode.com/tag/greedy)
-   [#counting](https://hashnode.com/tag/counting)
-   [#enumeration](https://hashnode.com/tag/enumeration)
-   [#daily-leetcode-challenge](https://hashnode.com/tag/daily-leetcode-challenge)

## Written by

[Anni Huang](https://hashnode.com/@HuangAnni)

@HuangAnni · Singapore

  
[View profile](https://hashnode.com/@HuangAnni)

LLM Training Operation Specialist @ ByteDance | Ex-Master of IT in Business (AI track) at SMU

I’m Anni Huang, an AI researcher-in-training currently at ByteDance, specializing in LLM training operations with a coding focus. I bridge the gap between engineering execution and model performance, ensuring the quality, reliability, and timely delivery of large-scale training projects.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.