---
title: "Discussion on \"LeetCode Daily Challenge-3085. Minimum Deletions to Make String K-Special\" | Hashnode"
description: "Discussion on \"LeetCode Daily Challenge-3085. Minimum Deletions to Make String K-Special\". Greedy Algorithms Can Miss Global Optimums: Why Always Targeting the Maximum Isn't Always Optimal"
url: "https://hashnode.com/posts/leetcode-daily-challenge-3085-minimum-deletions-to-make-string-k-special/68578820b1c1212302ce77e5"
---

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

Discussion

# [LeetCode Daily Challenge-3085. Minimum Deletions to Make String K-Special](https://huanganni.hashnode.dev/leetcode-daily-challenge-3085-minimum-deletions-to-make-string-k-special?utm_source=hashnode&utm_medium=feed)

Greedy Algorithms Can Miss Global Optimums: Why Always Targeting the Maximum Isn't Always Optimal

Jun 22, 2025 · 5 min read · huanganni.hashnode.dev  
Read the article

-   [#leetcodedaily](https://hashnode.com/tag/leetcodedaily)
-   [#leetcode-solution](https://hashnode.com/tag/leetcode-solution)
-   [#hashtables](https://hashnode.com/tag/hashtables)
-   [#sorting](https://hashnode.com/tag/sorting)
-   [#greedy](https://hashnode.com/tag/greedy)
-   [#counting](https://hashnode.com/tag/counting)
-   [#two-pointers](https://hashnode.com/tag/two-pointers)
-   [#python](https://hashnode.com/tag/python)
-   [#python3](https://hashnode.com/tag/python3)

## 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.