| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | ||||||
| 2 | 3 | 4 | 5 | 6 | 7 | 8 |
| 9 | 10 | 11 | 12 | 13 | 14 | 15 |
| 16 | 17 | 18 | 19 | 20 | 21 | 22 |
| 23 | 24 | 25 | 26 | 27 | 28 |
Tags
- kaggle
- data science
- Generator
- Convert Sorted List to Binary Search Tree
- 파이썬
- DWG
- 30. Substring with Concatenation of All Words
- Python
- 운영체제
- Class
- LeetCode
- Protocol
- Substring with Concatenation of All Words
- 시바견
- Regular Expression
- 43. Multiply Strings
- 315. Count of Smaller Numbers After Self
- Python Code
- concurrency
- 컴퓨터의 구조
- shiba
- 715. Range Module
- attribute
- Decorator
- Python Implementation
- 밴픽
- t1
- 109. Convert Sorted List to Binary Search Tree
- 프로그래머스
- iterator
Archives
- Today
- Total
목록Longest Substring with At Least K Repeating Characters (1)
Scribbling
LeetCode: 395. Longest Substring with At Least K Repeating Characters
Idea: Any characters that have frequencies less than k work as a breakpoints, meaning that the substring we're looking for can't include that particular character. So, recursively look for substrings while excluding those characters. Time complexity is O(N). from collections import Counter class Solution: def longestSubstring(self, s: str, k: int) -> int: return self.helper(s, k) def helper(self..
Computer Science/Coding Test
2022. 1. 16. 13:49