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 925 with 25 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 925 # by problem number
lcpy gen -s long_pressed_name # by problem name
name into a keyboard. Sometimes, when typing a character c, the key might get long pressed, and the character will be typed 1 or more times.
You examine the typed characters of the keyboard. Return true if it is possible that it was your friend’s name, with some characters (possibly none) being long pressed.
Input: name = "alex", typed = "aaleex"
Output: true
Explanation: 'a' and 'e' in 'alex' were long pressed.
Input: name = "saeed", typed = "ssaaedd"
Output: false
Explanation: 'e' must have been pressed twice, but it was not in the typed output.
class Solution:
# Time: O(len(name) + len(typed))
# Space: O(1)
def is_long_pressed_name(self, name: str, typed: str) -> bool:
i = 0
for j, ch in enumerate(typed):
if i < len(name) and name[i] == ch:
i += 1
elif j == 0 or ch != typed[j - 1]:
return False
return i == len(name)
| Time | Space |
|---|---|
| O(len(name) + len(typed)) | O(1) |