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 467 with 20 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 467 # by problem number
lcpy gen -s unique_substrings_in_wraparound_string # by problem name
base to be the infinite wraparound string of "abcdefghijklmnopqrstuvwxyz", so base will look like this: “…zabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcd…”.
Given a string s, return the number of unique non-empty substrings of s are present in base.
Input: s = "a"
Output: 1
Input: s = "cac"
Output: 2
Input: s = "zab"
Output: 6
class Solution:
# Time: O(n)
# Space: O(1)
def find_substring_in_wrapround_string(self, s: str) -> int:
best: dict[str, int] = {}
run = 0
for i, ch in enumerate(s):
if i > 0 and (ord(ch) - ord(s[i - 1])) % 26 == 1:
run += 1
else:
run = 1
best[ch] = max(best.get(ch, 0), run)
return sum(best.values())
| Time | Space |
|---|---|
| O(n) | O(1) |