Skip to content

[sangbeenmoon] WEEK 08 Solutions #2567

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
sangbeenmoon merged 1 commit into from
Apr 25, 2026
Merged

[sangbeenmoon] WEEK 08 Solutions #2567

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
16 changes: 16 additions & 0 deletions longest-repeating-character-replacement/sangbeenmoon.py
View file
Open in desktop
Copy link
Copy Markdown
Contributor

@dalestudy dalestudy Bot Apr 24, 2026

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

🏷️ 알고리즘 패턴 분석

  • 패턴: Sliding Window, Hash Map / Hash Set
  • 설명: 이 코드는 고정 크기 윈도우를 이동하며 조건에 맞게 확장하거나 축소하는 Sliding Window 패턴을 사용합니다. 또한 문자 빈도 수를 저장하기 위해 Hash Map을 활용하여 효율성을 높였습니다.

Original file line number Diff line number Diff line change
@@ -0,0 +1,16 @@
class Solution:
def characterReplacement(self, s: str, k: int) -> int:
freq = {}
left = 0
ans = 0

for right in range(len(s)):
freq[s[right]] = freq.get(s[right], 0) + 1

while (right - left + 1) - max(freq.values()) > k:
freq[s[left]] -= 1
left += 1

ans = max(ans, right - left + 1)

return ans
Loading