Update: deleting notes for now

2025-07-13 13:45:20 -04:00
parent 6b68121bb5
commit 57956bf728
84 changed files with 59 additions and 1741 deletions
--- a/.gitignore
+++ b/.gitignore
@@ -1,6 +1,8 @@
 # Created by https://www.toptal.com/developers/gitignore/api/node,java,python,c++
 # Edit at https://www.toptal.com/developers/gitignore?templates=node,java,python,c++
 .cursor*
 *src/notes*
 ./src/notes/
 *sync_leetcode.sh
 ### C++ ###
 # Prerequisites
--- a/src/exercises/1.two-sum.py
+++ b/src/exercises/1.two-sum.py
@@ -1,6 +1,6 @@
 from string import *
 from re import *
-from datetime import *
+erom datetime import *
 from collections import *
 from heapq import *
 from bisect import *
@@ -51,6 +51,8 @@ class Solution:
                return [i, hash_map[complement]]
            hash_map[nums[i]] = i
        return arr
 # @leet end
--- a/src/exercises/141.linked-list-cycle.py
+++ b/src/exercises/141.linked-list-cycle.py
@@ -44,5 +44,14 @@ from typing import *
 class Solution:
    def hasCycle(self, head: Optional[ListNode]) -> bool:
        m, n = head, head
        while n and n.next:
            m = m.next
            n = n.next.next
            if m == n:
                return True
        return False
 # @leet end
--- a/src/exercises/2.add-two-numbers.py
+++ b/src/exercises/2.add-two-numbers.py
@@ -41,13 +41,11 @@ from typing import *
 #         self.val = val
 #         self.next = next
 class Solution:
-    def node(self, val, next=None):
+    def node(self, val, next = None):
        self.val = val
        self.next = next
-    def addTwoNumbers(
+    def addTwoNumbers(self, l1: Optional[ListNode], l2: Optional[ListNode]) -> Optional[ListNode]:
        self, l1: Optional[ListNode], l2: Optional[ListNode]
    ) -> Optional[ListNode]:
        carry = 0
        value_l1 = l1
        value_l2 = l2
@@ -80,6 +78,4 @@ class Solution:
            tail = new_node
        return head
 # @leet end
--- a/src/exercises/3.longest-substring-without-repeating-characters.py
+++ b/src/exercises/3.longest-substring-without-repeating-characters.py
@@ -43,16 +43,12 @@ class Solution:
        while j < len(s):
            if s[j] not in window:
                window[s[j]] = 1
-                max_char = (
+                max_char = len(window.keys()) if max_char < len(window.keys()) else max_char
                    len(window.keys()) if max_char < len(window.keys()) else max_char
                )
                j += 1
            elif s[j] in window:
                del window[s[i]]
                i += 1
        return max_char
 # @leet end
--- a/src/exercises/4.median-of-two-sorted-arrays.py
+++ b/src/exercises/4.median-of-two-sorted-arrays.py
@@ -1,3 +1,40 @@
 from string import *
 from re import *
 from datetime import *
 from collections import *
 from heapq import *
 from bisect import *
 from copy import *
 from math import *
 from random import *
 from statistics import *
 from itertools import *
 from functools import *
 from operator import *
 from io import *
 from sys import *
 from json import *
 from builtins import *
 import string
 import re
 import datetime
 import collections
 import heapq
 import bisect
 import copy
 import math
 import random
 import statistics
 import itertools
 import functools
 import operator
 import io
 import sys
 import json
 from typing import *
 # @leet start
 class Solution:
    def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float:
        N1, N2 = nums1, nums2
@@ -28,3 +65,5 @@ class Solution:
                h = midA - 1
            else:
                l = midA + 1
 # @leet end
--- a/src/notes/001_two_sum.md
+++ b/src/notes/001_two_sum.md
@@ -1,22 +0,0 @@
 # Two Sum
 **Problem Number:** 1
 **Difficulty:** Easy
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/002_add_two_numbers.md
+++ b/src/notes/002_add_two_numbers.md
@@ -1,22 +0,0 @@
 # Add Two Numbers
 **Problem Number:** 2
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/003_longest_substring_without_repeating_characters.md
+++ b/src/notes/003_longest_substring_without_repeating_characters.md
@@ -1,22 +0,0 @@
 # Longest Substring Without Repeating Characters
 **Problem Number:** 3
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/004_median_of_two_sorted_arrays.md
+++ b/src/notes/004_median_of_two_sorted_arrays.md
@@ -1,22 +0,0 @@
 # Median of Two Sorted Arrays
 **Problem Number:** 4
 **Difficulty:** Hard
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/005_longest_palindromic_substring.md
+++ b/src/notes/005_longest_palindromic_substring.md
@@ -1,22 +0,0 @@
 # Longest Palindromic Substring
 **Problem Number:** 5
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/006_zigzag_conversion.md
+++ b/src/notes/006_zigzag_conversion.md
@@ -1,22 +0,0 @@
 # Zigzag Conversion
 **Problem Number:** 6
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/007_reverse_integer.md
+++ b/src/notes/007_reverse_integer.md
@@ -1,22 +0,0 @@
 # Reverse Integer
 **Problem Number:** 7
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/009_palindrome_number.md
+++ b/src/notes/009_palindrome_number.md
@@ -1,22 +0,0 @@
 # Palindrome Number
 **Problem Number:** 9
 **Difficulty:** Easy
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/010_regular_expression_matching.md
+++ b/src/notes/010_regular_expression_matching.md
@@ -1,22 +0,0 @@
 # Regular Expression Matching
 **Problem Number:** 10
 **Difficulty:** Hard
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/011_container_with_most_water.md
+++ b/src/notes/011_container_with_most_water.md
@@ -1,22 +0,0 @@
 # Container With Most Water
 **Problem Number:** 11
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/013_roman_to_integer.md
+++ b/src/notes/013_roman_to_integer.md
@@ -1,22 +0,0 @@
 # Roman to Integer
 **Problem Number:** 13
 **Difficulty:** Easy
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/014_longest_common_prefix.md
+++ b/src/notes/014_longest_common_prefix.md
@@ -1,22 +0,0 @@
 # Longest Common Prefix
 **Problem Number:** 14
 **Difficulty:** Easy
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/015_3sum.md
+++ b/src/notes/015_3sum.md
@@ -1,22 +0,0 @@
 # 3Sum
 **Problem Number:** 15
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/020_valid_parentheses.md
+++ b/src/notes/020_valid_parentheses.md
@@ -1,22 +0,0 @@
 # Valid Parentheses
 **Problem Number:** 20
 **Difficulty:** Easy
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/021_merge_two_sorted_lists.md
+++ b/src/notes/021_merge_two_sorted_lists.md
@@ -1,22 +0,0 @@
 # Merge Two Sorted Lists
 **Problem Number:** 21
 **Difficulty:** Easy
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/022_generate_parentheses.md
+++ b/src/notes/022_generate_parentheses.md
@@ -1,22 +0,0 @@
 # Generate Parentheses
 **Problem Number:** 22
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/028_find_the_index_of_the_first_occurrence_in_a_string.md
+++ b/src/notes/028_find_the_index_of_the_first_occurrence_in_a_string.md
@@ -1,22 +0,0 @@
 # Find the Index of the First Occurrence in a String
 **Problem Number:** 28
 **Difficulty:** Easy
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/035_search_insert_position.md
+++ b/src/notes/035_search_insert_position.md
@@ -1,22 +0,0 @@
 # Search Insert Position
 **Problem Number:** 35
 **Difficulty:** Easy
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/036_valid_sudoku.md
+++ b/src/notes/036_valid_sudoku.md
@@ -1,22 +0,0 @@
 # Valid Sudoku
 **Problem Number:** 36
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/042_trapping_rain_water.md
+++ b/src/notes/042_trapping_rain_water.md
@@ -1,22 +0,0 @@
 # Trapping Rain Water
 **Problem Number:** 42
 **Difficulty:** Hard
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/045_jump_game_ii.md
+++ b/src/notes/045_jump_game_ii.md
@@ -1,22 +0,0 @@
 # Jump Game II
 **Problem Number:** 45
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/050_powx_n.md
+++ b/src/notes/050_powx_n.md
@@ -1,22 +0,0 @@
 # Pow(x, n)
 **Problem Number:** 50
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/055_jump_game.md
+++ b/src/notes/055_jump_game.md
@@ -1,22 +0,0 @@
 # Jump Game
 **Problem Number:** 55
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/066_plus_one.md
+++ b/src/notes/066_plus_one.md
@@ -1,22 +0,0 @@
 # Plus One
 **Problem Number:** 66
 **Difficulty:** Easy
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/069_sqrtx.md
+++ b/src/notes/069_sqrtx.md
@@ -1,22 +0,0 @@
 # Sqrt(x)
 **Problem Number:** 69
 **Difficulty:** Easy
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/074_search_a_2d_matrix.md
+++ b/src/notes/074_search_a_2d_matrix.md
@@ -1,22 +0,0 @@
 # Search a 2D Matrix
 **Problem Number:** 74
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/080_remove_duplicates_from_sorted_array_ii.md
+++ b/src/notes/080_remove_duplicates_from_sorted_array_ii.md
@@ -1,22 +0,0 @@
 # Remove Duplicates from Sorted Array II
 **Problem Number:** 80
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/088_merge_sorted_array.md
+++ b/src/notes/088_merge_sorted_array.md
@@ -1,22 +0,0 @@
 # Merge Sorted Array
 **Problem Number:** 88
 **Difficulty:** Easy
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/089_gray_code.md
+++ b/src/notes/089_gray_code.md
@@ -1,22 +0,0 @@
 # Gray Code
 **Problem Number:** 89
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/090_subsets_ii.md
+++ b/src/notes/090_subsets_ii.md
@@ -1,22 +0,0 @@
 # Subsets II
 **Problem Number:** 90
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/091_decode_ways.md
+++ b/src/notes/091_decode_ways.md
@@ -1,22 +0,0 @@
 # Decode Ways
 **Problem Number:** 91
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/092_reverse_linked_list_ii.md
+++ b/src/notes/092_reverse_linked_list_ii.md
@@ -1,22 +0,0 @@
 # Reverse Linked List II
 **Problem Number:** 92
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/1200_minimum_absolute_difference.md
+++ b/src/notes/1200_minimum_absolute_difference.md
@@ -1,22 +0,0 @@
 # Minimum Absolute Difference
 **Problem Number:** 1200
 **Difficulty:** Easy
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/121_best_time_to_buy_and_sell_stock.md
+++ b/src/notes/121_best_time_to_buy_and_sell_stock.md
@@ -1,22 +0,0 @@
 # Best Time to Buy and Sell Stock
 **Problem Number:** 121
 **Difficulty:** Easy
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/122_best_time_to_buy_and_sell_stock_ii.md
+++ b/src/notes/122_best_time_to_buy_and_sell_stock_ii.md
@@ -1,22 +0,0 @@
 # Best Time to Buy and Sell Stock II
 **Problem Number:** 122
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/125_valid_palindrome.md
+++ b/src/notes/125_valid_palindrome.md
@@ -1,22 +0,0 @@
 # Valid Palindrome
 **Problem Number:** 125
 **Difficulty:** Easy
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/128_longest_consecutive_sequence.md
+++ b/src/notes/128_longest_consecutive_sequence.md
@@ -1,22 +0,0 @@
 # Longest Consecutive Sequence
 **Problem Number:** 128
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/1298_maximum_candies_you_can_get_from_boxes.md
+++ b/src/notes/1298_maximum_candies_you_can_get_from_boxes.md
@@ -1,22 +0,0 @@
 # Maximum Candies You Can Get from Boxes
 **Problem Number:** 1298
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/135_candy.md
+++ b/src/notes/135_candy.md
@@ -1,22 +0,0 @@
 # Candy
 **Problem Number:** 135
 **Difficulty:** Hard
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/141_linked_list_cycle.md
+++ b/src/notes/141_linked_list_cycle.md
@@ -1,22 +0,0 @@
 # Linked List Cycle
 **Problem Number:** 141
 **Difficulty:** Easy
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/149_max_points_on_a_line.md
+++ b/src/notes/149_max_points_on_a_line.md
@@ -1,22 +0,0 @@
 # Max Points on a Line
 **Problem Number:** 149
 **Difficulty:** Hard
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/150_evaluate_reverse_polish_notation.md
+++ b/src/notes/150_evaluate_reverse_polish_notation.md
@@ -1,22 +0,0 @@
 # Evaluate Reverse Polish Notation
 **Problem Number:** 150
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/153_find_minimum_in_rotated_sorted_array.md
+++ b/src/notes/153_find_minimum_in_rotated_sorted_array.md
@@ -1,22 +0,0 @@
 # Find Minimum in Rotated Sorted Array
 **Problem Number:** 153
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/155_min_stack.md
+++ b/src/notes/155_min_stack.md
@@ -1,22 +0,0 @@
 # Min Stack
 **Problem Number:** 155
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/167_two_sum_ii__input_array_is_sorted.md
+++ b/src/notes/167_two_sum_ii__input_array_is_sorted.md
@@ -1,22 +0,0 @@
 # Two Sum II - Input Array Is Sorted
 **Problem Number:** 167
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/167_two_sum_ii_input_array_is_sorted.md
+++ b/src/notes/167_two_sum_ii_input_array_is_sorted.md
@@ -1,32 +0,0 @@
 # two sum ii input array is sorted
 [![Problem 167](https://img.shields.io/badge/Problem-167-blue?style=for-the-badge&logo=leetcode)](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/)
 [![Difficulty](https://img.shields.io/badge/Difficulty-Medium-orange?style=for-the-badge)](https://leetcode.com/problemset/?difficulty=MEDIUM)
 [![LeetCode](https://img.shields.io/badge/LeetCode-View%20Problem-orange?style=for-the-badge&logo=leetcode)](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/)
 **Problem Number:** [167](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/)
 **Difficulty:** [Medium](https://leetcode.com/problemset/?difficulty=MEDIUM)(https://leetcode.com/problemset/?difficulty=MEDIUM)
 **Category:** 
 **LeetCode Link:** [https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/)
 ## Problem Description
 > **View the full problem description on LeetCode:** [two sum ii input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/)
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 [![Back to Index](../../README.md#-problem-index)](../../README.md#-problem-index) | [![View Solution](../exercises/167.two-sum-ii-input-array-is-sorted.py)](../exercises/167.two-sum-ii-input-array-is-sorted.py)
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/169_majority_element.md
+++ b/src/notes/169_majority_element.md
@@ -1,22 +0,0 @@
 # Majority Element
 **Problem Number:** 169
 **Difficulty:** Easy
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/172_factorial_trailing_zeroes.md
+++ b/src/notes/172_factorial_trailing_zeroes.md
@@ -1,22 +0,0 @@
 # Factorial Trailing Zeroes
 **Problem Number:** 172
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/1820_maximum_number_of_accepted_invitations.md
+++ b/src/notes/1820_maximum_number_of_accepted_invitations.md
@@ -1,22 +0,0 @@
 # Maximum Number of Accepted Invitations
 **Problem Number:** 1820
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/189_rotate_array.md
+++ b/src/notes/189_rotate_array.md
@@ -1,22 +0,0 @@
 # Rotate Array
 **Problem Number:** 189
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/202_happy_number.md
+++ b/src/notes/202_happy_number.md
@@ -1,22 +0,0 @@
 # Happy Number
 **Problem Number:** 202
 **Difficulty:** Easy
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/2040_kth_smallest_product_of_two_sorted_arrays.md
+++ b/src/notes/2040_kth_smallest_product_of_two_sorted_arrays.md
@@ -1,22 +0,0 @@
 # Kth Smallest Product of Two Sorted Arrays
 **Problem Number:** 2040
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/2053_kth_distinct_string_in_an_array.md
+++ b/src/notes/2053_kth_distinct_string_in_an_array.md
@@ -1,22 +0,0 @@
 # Kth Distinct String in an Array
 **Problem Number:** 2053
 **Difficulty:** Easy
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/205_isomorphic_strings.md
+++ b/src/notes/205_isomorphic_strings.md
@@ -1,22 +0,0 @@
 # Isomorphic Strings
 **Problem Number:** 205
 **Difficulty:** Easy
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/206_reverse_linked_list.md
+++ b/src/notes/206_reverse_linked_list.md
@@ -1,22 +0,0 @@
 # Reverse Linked List
 **Problem Number:** 206
 **Difficulty:** Easy
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/2116_check_if_a_parentheses_string_can_be_valid.md
+++ b/src/notes/2116_check_if_a_parentheses_string_can_be_valid.md
@@ -1,22 +0,0 @@
 # Check if a Parentheses String Can Be Valid
 **Problem Number:** 2116
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/217_contains_duplicate.md
+++ b/src/notes/217_contains_duplicate.md
@@ -1,22 +0,0 @@
 # Contains Duplicate
 **Problem Number:** 217
 **Difficulty:** Easy
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/219_contains_duplicate_ii.md
+++ b/src/notes/219_contains_duplicate_ii.md
@@ -1,22 +0,0 @@
 # Contains Duplicate II
 **Problem Number:** 219
 **Difficulty:** Easy
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/228_summary_ranges.md
+++ b/src/notes/228_summary_ranges.md
@@ -1,22 +0,0 @@
 # Summary Ranges
 **Problem Number:** 228
 **Difficulty:** Easy
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/2294_partition_array_such_that_maximum_difference_is_k.md
+++ b/src/notes/2294_partition_array_such_that_maximum_difference_is_k.md
@@ -1,22 +0,0 @@
 # Partition Array Such That Maximum Difference Is K
 **Problem Number:** 2294
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/238_product_of_array_except_self.md
+++ b/src/notes/238_product_of_array_except_self.md
@@ -1,22 +0,0 @@
 # Product of Array Except Self
 **Problem Number:** 238
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/242_valid_anagram.md
+++ b/src/notes/242_valid_anagram.md
@@ -1,22 +0,0 @@
 # Valid Anagram
 **Problem Number:** 242
 **Difficulty:** Easy
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/243_shortest_word_distance.md
+++ b/src/notes/243_shortest_word_distance.md
@@ -1,22 +0,0 @@
 # Shortest Word Distance
 **Problem Number:** 243
 **Difficulty:** Easy
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/2441_largest_positive_integer_that_exists_with_its_negative.md
+++ b/src/notes/2441_largest_positive_integer_that_exists_with_its_negative.md
@@ -1,22 +0,0 @@
 # Largest Positive Integer That Exists With Its Negative
 **Problem Number:** 2441
 **Difficulty:** Easy
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/244_shortest_word_distance_ii.md
+++ b/src/notes/244_shortest_word_distance_ii.md
@@ -1,22 +0,0 @@
 # Shortest Word Distance II
 **Problem Number:** 244
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/245_shortest_word_distance_iii.md
+++ b/src/notes/245_shortest_word_distance_iii.md
@@ -1,22 +0,0 @@
 # Shortest Word Distance III
 **Problem Number:** 245
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/246_strobogrammatic_number.md
+++ b/src/notes/246_strobogrammatic_number.md
@@ -1,22 +0,0 @@
 # Strobogrammatic Number
 **Problem Number:** 246
 **Difficulty:** Easy
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/248_strobogrammatic_number_iii.md
+++ b/src/notes/248_strobogrammatic_number_iii.md
@@ -1,22 +0,0 @@
 # Strobogrammatic Number III
 **Problem Number:** 248
 **Difficulty:** Hard
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/2616_minimize_the_maximum_difference_of_pairs.md
+++ b/src/notes/2616_minimize_the_maximum_difference_of_pairs.md
@@ -1,22 +0,0 @@
 # Minimize the Maximum Difference of Pairs
 **Problem Number:** 2616
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/290_word_pattern.md
+++ b/src/notes/290_word_pattern.md
@@ -1,22 +0,0 @@
 # Word Pattern
 **Problem Number:** 290
 **Difficulty:** Easy
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/2966_divide_array_into_arrays_with_max_difference.md
+++ b/src/notes/2966_divide_array_into_arrays_with_max_difference.md
@@ -1,22 +0,0 @@
 # Divide Array Into Arrays With Max Difference
 **Problem Number:** 2966
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/3442_maximum_difference_between_even_and_odd_frequency_i.md
+++ b/src/notes/3442_maximum_difference_between_even_and_odd_frequency_i.md
@@ -1,22 +0,0 @@
 # Maximum Difference Between Even and Odd Frequency I
 **Problem Number:** 3442
 **Difficulty:** Easy
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/3445_maximum_difference_between_even_and_odd_frequency_ii.md
+++ b/src/notes/3445_maximum_difference_between_even_and_odd_frequency_ii.md
@@ -1,22 +0,0 @@
 # Maximum Difference Between Even and Odd Frequency II
 **Problem Number:** 3445
 **Difficulty:** Easy
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/383_ransom_note.md
+++ b/src/notes/383_ransom_note.md
@@ -1,22 +0,0 @@
 # Ransom Note
 **Problem Number:** 383
 **Difficulty:** Easy
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/392_is_subsequence.md
+++ b/src/notes/392_is_subsequence.md
@@ -1,22 +0,0 @@
 # Is Subsequence
 **Problem Number:** 392
 **Difficulty:** Easy
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/704_binary_search.md
+++ b/src/notes/704_binary_search.md
@@ -1,22 +0,0 @@
 # Binary Search
 **Problem Number:** 704
 **Difficulty:** Easy
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/875_koko_eating_bananas.md
+++ b/src/notes/875_koko_eating_bananas.md
@@ -1,22 +0,0 @@
 # Koko Eating Bananas
 **Problem Number:** 875
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*
--- a/src/notes/990_satisfiability_of_equality_equations.md
+++ b/src/notes/990_satisfiability_of_equality_equations.md
@@ -1,22 +0,0 @@
 # Satisfiability of Equality Equations
 **Problem Number:** 990
 **Difficulty:** Medium
 **Category:** 
 ## Problem Description
 ## My Approach
 ## Solution
 ## Time & Space Complexity
 ## Key Insights
 ## Mistakes Made
 ## Related Problems
 ---
 *Note: This is a work in progress. I'll add more details as I reflect on this problem.*