Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 2264 with 20 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 2264 # by problem number
lcpy gen -s largest_3_same_digit_number_in_string # by problem name
num representing a large integer. An integer is good if it meets the following conditions:
num with length 3."" if no such integer exists.
Note:
num or a good integer.Input: num = "6777133339"
Output: "777"
Explanation: There are two distinct good integers: "777" and "333". "777" is the largest, so we return "777".
Input: num = "2300019"
Output: "000"
Explanation: "000" is the only good integer.
Input: num = "42352338"
Output: ""
Explanation: No substring of length 3 consists of only one unique digit. Therefore, there are no good integers.
class Solution:
# Time: O(n)
# Space: O(1)
def largest_good_integer(self, num: str) -> str:
best = ""
for i in range(len(num) - 2):
if num[i] == num[i + 1] == num[i + 2] and num[i] * 3 > best:
best = num[i] * 3
return best
| Time | Space |
|---|---|
| O(n) | O(1) |