Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 7748c52

Browse files
Update PROGRESS.md
1 parent 7eae9e2 commit 7748c52

File tree

1 file changed

+8
-0
lines changed

1 file changed

+8
-0
lines changed

‎PROGRESS.md‎

Lines changed: 8 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -252,3 +252,11 @@ Worked on two fundamental binary tree problems. In the first, computed the maxim
252252
- ✅ [Keyboard Row](https://github.com/lyushher/LeetCode-Python-Easy-DSA/blob/main/day-28/keyboard_row.py)
253253

254254
**Notes:** Focused on string scanning and set-based filtering. For the first problem, derived the longest shared prefix by comparing the first word character-by-character against all others and stopping at the earliest mismatch, enabling early termination with O(S) time and O(1) space. For the second, modeled each keyboard row as a fixed set and tested whether each word’s character set was a subset of any row, returning only those typable from a single row; this keeps the solution simple and fast with O(n·k) time and constant extra space.
255+
256+
---
257+
258+
## 📅 Day 29 – Substrings & Range Summaries
259+
- ✅ [Longest Substring Without Repeating Characters](https://github.com/lyushher/LeetCode-Python-Easy-DSA/blob/main/day-29/longest_substring_without_repeating_characters.py)
260+
- ✅ [Summary Ranges](https://github.com/lyushher/LeetCode-Python-Easy-DSA/blob/main/day-29/summary_ranges.py)
261+
262+
**Notes:** Practiced sliding window and range summarization techniques. In the first problem, maintained a dynamic window with two pointers and a hash map of last seen indices to efficiently handle duplicates, ensuring each substring remained unique and updating the maximum length in O(n) time. In the second, summarized consecutive integer ranges by tracking the start of each segment and recording either a single number or a "start->end" range whenever continuity broke, finishing with the final segment. These problems reinforced mastery of sliding windows, index tracking, and array scanning patterns.

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /