You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: PROGRESS.md
+8Lines changed: 8 additions & 0 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -236,3 +236,11 @@ Worked on two fundamental binary tree problems. In the first, computed the maxim
236
236
- ✅ [Find All Numbers Disappeared in an Array](https://github.com/lyushher/LeetCode-Python-Easy-DSA/blob/main/day-26/find_all_numbers_disappeared_in_an_array.py)
237
237
238
238
**Notes:** Focused on in-place array manipulation techniques. In the first problem, efficiently pushed all zeroes to the end while preserving the order of non-zero elements using a two-pointer approach that overwrites non-zero values forward and fills the rest with zeros, achieving O(n) time and O(1) space. In the second, identified all missing numbers in the range [1, n] by marking visited indices via sign flipping, then collecting positions that remained positive as the missing values. Both problems reinforced the use of index-based logic and in-place modifications to optimize space while keeping solutions linear in time.
- ✅ [Find the Difference](https://github.com/lyushher/LeetCode-Python-Easy-DSA/blob/main/day-27/find_the_difference.py)
245
+
246
+
**Notes:** Solved two array and string-based problems. In the first, assigned medals and ranks by pairing scores with original indices, sorting in descending order, and mapping top performers to medals while giving numeric ranks to the rest, ensuring results were restored to the input order. In the second, detected the extra character between two strings by applying XOR across all characters, leveraging the property that identical values cancel out and leaving only the added character. Both problems highlight efficient use of sorting, indexing, and bitwise operations to reduce time and space complexity.
0 commit comments