Largest 3-Same-Digit Number in String — LeetCode 2264 Python Solution
- Problem
- #2264
- Pattern
- Hash Map
- Reading time
- 2 min
- Source
- leetcode.com
The problem
You are given a string num representing a large integer. An integer is good if it meets the following conditions: It is a substring of num with length 3.
Example
- Input
- num = "6777133339"
- Output
- "777"
- Explanation
- There are two distinct good integers: "777" and "333".
Python solution
class Solution:
def largestGoodInteger(self, num: str) -> str:
for i in range(9, -1, -1):
if (s := str(i) * 3) in num:
return s
return ""Complexity
| Measure | Complexity |
|---|---|
| Time | O(10 \times n), where n is the length of the string num |
| Space | O(1) auxiliary |
Pattern: Hash Map
Trade memory for time: remember what you have seen so the second pass never happens. LeetCode 2264. Largest 3-Same-Digit Number in String is filed here because the reference solution below belongs to the algorithm family this hub collects, even though its LeetCode tags point elsewhere.
The hash map guide has the Python template for the pattern and the 709 LeetCode problems that use it.
Related problems
Frequently asked questions
- How hard is LeetCode 2264. Largest 3-Same-Digit Number in String?
- LeetCode 2264. Largest 3-Same-Digit Number in String is rated Easy on LeetCode.
- What is the time complexity of LeetCode 2264. Largest 3-Same-Digit Number in String?
- The Python solution on this page runs in O(10 \times n), where n is the length of the string num.
- What is the space complexity of LeetCode 2264. Largest 3-Same-Digit Number in String?
- The Python solution on this page uses O(1) auxiliary space.
- What topics does LeetCode 2264. Largest 3-Same-Digit Number in String cover?
- LeetCode 2264. Largest 3-Same-Digit Number in String is tagged String on LeetCode.