Add solution links to problem titles in README table

This commit is contained in:
Carlos
2025-07-11 12:11:34 -04:00
parent 75a5235659
commit 56953591a4

154
README.md
View File

@@ -15,83 +15,83 @@ This repo tracks my journey solving LeetCode problems — not just code, but my
| # | Title | Difficulty | Notes |
|---|-------|------------|-------|
| 001 | Two Sum | Easy | [View Notes](src/notes/001_two_sum.md) |
| 002 | Add Two Numbers | Medium | [View Notes](src/notes/002_add_two_numbers.md) |
| 003 | Longest Substring Without Repeating Characters | Medium | [View Notes](src/notes/003_longest_substring_without_repeating_characters.md) |
| 004 | Median of Two Sorted Arrays | Hard | [View Notes](src/notes/004_median_of_two_sorted_arrays.md) |
| 005 | Longest Palindromic Substring | Medium | [View Notes](src/notes/005_longest_palindromic_substring.md) |
| 006 | Zigzag Conversion | Medium | [View Notes](src/notes/006_zigzag_conversion.md) |
| 007 | Reverse Integer | Medium | [View Notes](src/notes/007_reverse_integer.md) |
| 009 | Palindrome Number | Easy | [View Notes](src/notes/009_palindrome_number.md) |
| 010 | Regular Expression Matching | Hard | [View Notes](src/notes/010_regular_expression_matching.md) |
| 011 | Container With Most Water | Medium | [View Notes](src/notes/011_container_with_most_water.md) |
| 013 | Roman to Integer | Easy | [View Notes](src/notes/013_roman_to_integer.md) |
| 014 | Longest Common Prefix | Easy | [View Notes](src/notes/014_longest_common_prefix.md) |
| 015 | 3Sum | Medium | [View Notes](src/notes/015_3sum.md) |
| 020 | Valid Parentheses | Easy | [View Notes](src/notes/020_valid_parentheses.md) |
| 021 | Merge Two Sorted Lists | Easy | [View Notes](src/notes/021_merge_two_sorted_lists.md) |
| 022 | Generate Parentheses | Medium | [View Notes](src/notes/022_generate_parentheses.md) |
| 028 | Find the Index of the First Occurrence in a String | Easy | [View Notes](src/notes/028_find_the_index_of_the_first_occurrence_in_a_string.md) |
| 035 | Search Insert Position | Easy | [View Notes](src/notes/035_search_insert_position.md) |
| 036 | Valid Sudoku | Medium | [View Notes](src/notes/036_valid_sudoku.md) |
| 042 | Trapping Rain Water | Hard | [View Notes](src/notes/042_trapping_rain_water.md) |
| 045 | Jump Game II | Medium | [View Notes](src/notes/045_jump_game_ii.md) |
| 050 | Pow(x, n) | Medium | [View Notes](src/notes/050_powx_n.md) |
| 055 | Jump Game | Medium | [View Notes](src/notes/055_jump_game.md) |
| 066 | Plus One | Easy | [View Notes](src/notes/066_plus_one.md) |
| 069 | Sqrt(x) | Easy | [View Notes](src/notes/069_sqrtx.md) |
| 074 | Search a 2D Matrix | Medium | [View Notes](src/notes/074_search_a_2d_matrix.md) |
| 080 | Remove Duplicates from Sorted Array II | Medium | [View Notes](src/notes/080_remove_duplicates_from_sorted_array_ii.md) |
| 088 | Merge Sorted Array | Easy | [View Notes](src/notes/088_merge_sorted_array.md) |
| 089 | Gray Code | Medium | [View Notes](src/notes/089_gray_code.md) |
| 090 | Subsets II | Medium | [View Notes](src/notes/090_subsets_ii.md) |
| 091 | Decode Ways | Medium | [View Notes](src/notes/091_decode_ways.md) |
| 092 | Reverse Linked List II | Medium | [View Notes](src/notes/092_reverse_linked_list_ii.md) |
| 121 | Best Time to Buy and Sell Stock | Easy | [View Notes](src/notes/121_best_time_to_buy_and_sell_stock.md) |
| 122 | Best Time to Buy and Sell Stock II | Medium | [View Notes](src/notes/122_best_time_to_buy_and_sell_stock_ii.md) |
| 125 | Valid Palindrome | Easy | [View Notes](src/notes/125_valid_palindrome.md) |
| 128 | Longest Consecutive Sequence | Medium | [View Notes](src/notes/128_longest_consecutive_sequence.md) |
| 135 | Candy | Hard | [View Notes](src/notes/135_candy.md) |
| 141 | Linked List Cycle | Easy | [View Notes](src/notes/141_linked_list_cycle.md) |
| 149 | Max Points on a Line | Hard | [View Notes](src/notes/149_max_points_on_a_line.md) |
| 150 | Evaluate Reverse Polish Notation | Medium | [View Notes](src/notes/150_evaluate_reverse_polish_notation.md) |
| 153 | Find Minimum in Rotated Sorted Array | Medium | [View Notes](src/notes/153_find_minimum_in_rotated_sorted_array.md) |
| 155 | Min Stack | Medium | [View Notes](src/notes/155_min_stack.md) |
| 167 | Two Sum II - Input Array Is Sorted | Medium | [View Notes](src/notes/167_two_sum_ii_input_array_is_sorted.md) |
| 169 | Majority Element | Easy | [View Notes](src/notes/169_majority_element.md) |
| 172 | Factorial Trailing Zeroes | Medium | [View Notes](src/notes/172_factorial_trailing_zeroes.md) |
| 189 | Rotate Array | Medium | [View Notes](src/notes/189_rotate_array.md) |
| 202 | Happy Number | Easy | [View Notes](src/notes/202_happy_number.md) |
| 205 | Isomorphic Strings | Easy | [View Notes](src/notes/205_isomorphic_strings.md) |
| 206 | Reverse Linked List | Easy | [View Notes](src/notes/206_reverse_linked_list.md) |
| 217 | Contains Duplicate | Easy | [View Notes](src/notes/217_contains_duplicate.md) |
| 219 | Contains Duplicate II | Easy | [View Notes](src/notes/219_contains_duplicate_ii.md) |
| 228 | Summary Ranges | Easy | [View Notes](src/notes/228_summary_ranges.md) |
| 238 | Product of Array Except Self | Medium | [View Notes](src/notes/238_product_of_array_except_self.md) |
| 242 | Valid Anagram | Easy | [View Notes](src/notes/242_valid_anagram.md) |
| 243 | Shortest Word Distance | Easy | [View Notes](src/notes/243_shortest_word_distance.md) |
| 244 | Shortest Word Distance II | Medium | [View Notes](src/notes/244_shortest_word_distance_ii.md) |
| 245 | Shortest Word Distance III | Medium | [View Notes](src/notes/245_shortest_word_distance_iii.md) |
| 246 | Strobogrammatic Number | Easy | [View Notes](src/notes/246_strobogrammatic_number.md) |
| 248 | Strobogrammatic Number III | Hard | [View Notes](src/notes/248_strobogrammatic_number_iii.md) |
| 290 | Word Pattern | Easy | [View Notes](src/notes/290_word_pattern.md) |
| 383 | Ransom Note | Easy | [View Notes](src/notes/383_ransom_note.md) |
| 392 | Is Subsequence | Easy | [View Notes](src/notes/392_is_subsequence.md) |
| 704 | Binary Search | Easy | [View Notes](src/notes/704_binary_search.md) |
| 875 | Koko Eating Bananas | Medium | [View Notes](src/notes/875_koko_eating_bananas.md) |
| 990 | Satisfiability of Equality Equations | Medium | [View Notes](src/notes/990_satisfiability_of_equality_equations.md) |
| 1200 | Minimum Absolute Difference | Easy | [View Notes](src/notes/1200_minimum_absolute_difference.md) |
| 1298 | Maximum Candies You Can Get from Boxes | Medium | [View Notes](src/notes/1298_maximum_candies_you_can_get_from_boxes.md) |
| 1820 | Maximum Number of Accepted Invitations | Medium | [View Notes](src/notes/1820_maximum_number_of_accepted_invitations.md) |
| 2040 | Kth Smallest Product of Two Sorted Arrays | Medium | [View Notes](src/notes/2040_kth_smallest_product_of_two_sorted_arrays.md) |
| 2053 | Kth Distinct String in an Array | Easy | [View Notes](src/notes/2053_kth_distinct_string_in_an_array.md) |
| 2116 | Check if a Parentheses String Can Be Valid | Medium | [View Notes](src/notes/2116_check_if_a_parentheses_string_can_be_valid.md) |
| 2294 | Partition Array Such That Maximum Difference Is K | Medium | [View Notes](src/notes/2294_partition_array_such_that_maximum_difference_is_k.md) |
| 2441 | Largest Positive Integer That Exists With Its Negative | Easy | [View Notes](src/notes/2441_largest_positive_integer_that_exists_with_its_negative.md) |
| 2616 | Minimize the Maximum Difference of Pairs | Medium | [View Notes](src/notes/2616_minimize_the_maximum_difference_of_pairs.md) |
| 2966 | Divide Array Into Arrays With Max Difference | Medium | [View Notes](src/notes/2966_divide_array_into_arrays_with_max_difference.md) |
| 3442 | Maximum Difference Between Even and Odd Frequency I | Easy | [View Notes](src/notes/3442_maximum_difference_between_even_and_odd_frequency_i.md) |
| 3445 | Maximum Difference Between Even and Odd Frequency II | Easy | [View Notes](src/notes/3445_maximum_difference_between_even_and_odd_frequency_ii.md) |
| 001 | [Two Sum](src/exercises/1.two-sum.py) | Easy | [View Notes](src/notes/001_two_sum.md) |
| 002 | [Add Two Numbers](src/exercises/2.add-two-numbers.py) | Medium | [View Notes](src/notes/002_add_two_numbers.md) |
| 003 | [Longest Substring Without Repeating Characters](src/exercises/3.longest-substring-without-repeating-characters.py) | Medium | [View Notes](src/notes/003_longest_substring_without_repeating_characters.md) |
| 004 | [Median of Two Sorted Arrays](src/exercises/4.median-of-two-sorted-arrays.py) | Hard | [View Notes](src/notes/004_median_of_two_sorted_arrays.md) |
| 005 | [Longest Palindromic Substring](src/exercises/5.longest-palindromic-substring.py) | Medium | [View Notes](src/notes/005_longest_palindromic_substring.md) |
| 006 | [Zigzag Conversion](src/exercises/6.zigzag-conversion.py) | Medium | [View Notes](src/notes/006_zigzag_conversion.md) |
| 007 | [Reverse Integer](src/exercises/7.reverse-integer.py) | Medium | [View Notes](src/notes/007_reverse_integer.md) |
| 009 | [Palindrome Number](src/exercises/9.palindrome-number.py) | Easy | [View Notes](src/notes/009_palindrome_number.md) |
| 010 | [Regular Expression Matching](src/exercises/10.regular-expression-matching.py) | Hard | [View Notes](src/notes/010_regular_expression_matching.md) |
| 011 | [Container With Most Water](src/exercises/11.container-with-most-water.py) | Medium | [View Notes](src/notes/011_container_with_most_water.md) |
| 013 | [Roman to Integer](src/exercises/13.roman-to-integer.py) | Easy | [View Notes](src/notes/013_roman_to_integer.md) |
| 014 | [Longest Common Prefix](src/exercises/14.longest-common-prefix.py) | Easy | [View Notes](src/notes/014_longest_common_prefix.md) |
| 015 | [3Sum](src/exercises/15.3sum.py) | Medium | [View Notes](src/notes/015_3sum.md) |
| 020 | [Valid Parentheses](src/exercises/20.valid-parentheses.py) | Easy | [View Notes](src/notes/020_valid_parentheses.md) |
| 021 | [Merge Two Sorted Lists](src/exercises/21.merge-two-sorted-lists.py) | Easy | [View Notes](src/notes/021_merge_two_sorted_lists.md) |
| 022 | [Generate Parentheses](src/exercises/22.generate-parentheses.py) | Medium | [View Notes](src/notes/022_generate_parentheses.md) |
| 028 | [Find the Index of the First Occurrence in a String](src/exercises/28.find-the-index-of-the-first-occurrence-in-a-string.py) | Easy | [View Notes](src/notes/028_find_the_index_of_the_first_occurrence_in_a_string.md) |
| 035 | [Search Insert Position](src/exercises/35.search-insert-position.py) | Easy | [View Notes](src/notes/035_search_insert_position.md) |
| 036 | [Valid Sudoku](src/exercises/36.valid-sudoku.py) | Medium | [View Notes](src/notes/036_valid_sudoku.md) |
| 042 | [Trapping Rain Water](src/exercises/42.trapping-rain-water.py) | Hard | [View Notes](src/notes/042_trapping_rain_water.md) |
| 045 | [Jump Game II](src/exercises/45.jump-game-ii.py) | Medium | [View Notes](src/notes/045_jump_game_ii.md) |
| 050 | [Pow(x, n)](src/exercises/50.powx-n.py) | Medium | [View Notes](src/notes/050_powx_n.md) |
| 055 | [Jump Game](src/exercises/55.jump-game.py) | Medium | [View Notes](src/notes/055_jump_game.md) |
| 066 | [Plus One](src/exercises/66.plus-one.py) | Easy | [View Notes](src/notes/066_plus_one.md) |
| 069 | [Sqrt(x)](src/exercises/69.sqrtx.py) | Easy | [View Notes](src/notes/069_sqrtx.md) |
| 074 | [Search a 2D Matrix](src/exercises/74.search-a-2d-matrix.py) | Medium | [View Notes](src/notes/074_search_a_2d_matrix.md) |
| 080 | [Remove Duplicates from Sorted Array II](src/exercises/80.remove-duplicates-from-sorted-array-ii.py) | Medium | [View Notes](src/notes/080_remove_duplicates_from_sorted_array_ii.md) |
| 088 | [Merge Sorted Array](src/exercises/88.merge-sorted-array.py) | Easy | [View Notes](src/notes/088_merge_sorted_array.md) |
| 089 | [Gray Code](src/exercises/89.gray-code.py) | Medium | [View Notes](src/notes/089_gray_code.md) |
| 090 | [Subsets II](src/exercises/90.subsets-ii.py) | Medium | [View Notes](src/notes/090_subsets_ii.md) |
| 091 | [Decode Ways](src/exercises/91.decode-ways.py) | Medium | [View Notes](src/notes/091_decode_ways.md) |
| 092 | [Reverse Linked List II](src/exercises/92.reverse-linked-list-ii.py) | Medium | [View Notes](src/notes/092_reverse_linked_list_ii.md) |
| 121 | [Best Time to Buy and Sell Stock](src/exercises/121.best-time-to-buy-and-sell-stock.py) | Easy | [View Notes](src/notes/121_best_time_to_buy_and_sell_stock.md) |
| 122 | [Best Time to Buy and Sell Stock II](src/exercises/122.best-time-to-buy-and-sell-stock-ii.py) | Medium | [View Notes](src/notes/122_best_time_to_buy_and_sell_stock_ii.md) |
| 125 | [Valid Palindrome](src/exercises/125.valid-palindrome.py) | Easy | [View Notes](src/notes/125_valid_palindrome.md) |
| 128 | [Longest Consecutive Sequence](src/exercises/128.longest-consecutive-sequence.py) | Medium | [View Notes](src/notes/128_longest_consecutive_sequence.md) |
| 135 | [Candy](src/exercises/135.candy.py) | Hard | [View Notes](src/notes/135_candy.md) |
| 141 | [Linked List Cycle](src/exercises/141.linked-list-cycle.py) | Easy | [View Notes](src/notes/141_linked_list_cycle.md) |
| 149 | [Max Points on a Line](src/exercises/149.max-points-on-a-line.py) | Hard | [View Notes](src/notes/149_max_points_on_a_line.md) |
| 150 | [Evaluate Reverse Polish Notation](src/exercises/150.evaluate-reverse-polish-notation.py) | Medium | [View Notes](src/notes/150_evaluate_reverse_polish_notation.md) |
| 153 | [Find Minimum in Rotated Sorted Array](src/exercises/153.find-minimum-in-rotated-sorted-array.py) | Medium | [View Notes](src/notes/153_find_minimum_in_rotated_sorted_array.md) |
| 155 | [Min Stack](src/exercises/155.min-stack.py) | Medium | [View Notes](src/notes/155_min_stack.md) |
| 167 | [Two Sum II - Input Array Is Sorted](src/exercises/167.two-sum-ii-input-array-is-sorted.py) | Medium | [View Notes](src/notes/167_two_sum_ii_input_array_is_sorted.md) |
| 169 | [Majority Element](src/exercises/169.majority-element.py) | Easy | [View Notes](src/notes/169_majority_element.md) |
| 172 | [Factorial Trailing Zeroes](src/exercises/172.factorial-trailing-zeroes.py) | Medium | [View Notes](src/notes/172_factorial_trailing_zeroes.md) |
| 189 | [Rotate Array](src/exercises/189.rotate-array.py) | Medium | [View Notes](src/notes/189_rotate_array.md) |
| 202 | [Happy Number](src/exercises/202.happy-number.py) | Easy | [View Notes](src/notes/202_happy_number.md) |
| 205 | [Isomorphic Strings](src/exercises/205.isomorphic-strings.py) | Easy | [View Notes](src/notes/205_isomorphic_strings.md) |
| 206 | [Reverse Linked List](src/exercises/206.reverse-linked-list.py) | Easy | [View Notes](src/notes/206_reverse_linked_list.md) |
| 217 | [Contains Duplicate](src/exercises/217.contains-duplicate.py) | Easy | [View Notes](src/notes/217_contains_duplicate.md) |
| 219 | [Contains Duplicate II](src/exercises/219.contains-duplicate-ii.py) | Easy | [View Notes](src/notes/219_contains_duplicate_ii.md) |
| 228 | [Summary Ranges](src/exercises/228.summary-ranges.py) | Easy | [View Notes](src/notes/228_summary_ranges.md) |
| 238 | [Product of Array Except Self](src/exercises/238.product-of-array-except-self.py) | Medium | [View Notes](src/notes/238_product_of_array_except_self.md) |
| 242 | [Valid Anagram](src/exercises/242.valid-anagram.py) | Easy | [View Notes](src/notes/242_valid_anagram.md) |
| 243 | [Shortest Word Distance](src/exercises/243.shortest-word-distance.py) | Easy | [View Notes](src/notes/243_shortest_word_distance.md) |
| 244 | [Shortest Word Distance II](src/exercises/244.shortest-word-distance-ii.py) | Medium | [View Notes](src/notes/244_shortest_word_distance_ii.md) |
| 245 | [Shortest Word Distance III](src/exercises/245.shortest-word-distance-iii.py) | Medium | [View Notes](src/notes/245_shortest_word_distance_iii.md) |
| 246 | [Strobogrammatic Number](src/exercises/246.strobogrammatic-number.py) | Easy | [View Notes](src/notes/246_strobogrammatic_number.md) |
| 248 | [Strobogrammatic Number III](src/exercises/248.strobogrammatic-number-iii.py) | Hard | [View Notes](src/notes/248_strobogrammatic_number_iii.md) |
| 290 | [Word Pattern](src/exercises/290.word-pattern.py) | Easy | [View Notes](src/notes/290_word_pattern.md) |
| 383 | [Ransom Note](src/exercises/383.ransom-note.py) | Easy | [View Notes](src/notes/383_ransom_note.md) |
| 392 | [Is Subsequence](src/exercises/392.is-subsequence.py) | Easy | [View Notes](src/notes/392_is_subsequence.md) |
| 704 | [Binary Search](src/exercises/704.binary-search.py) | Easy | [View Notes](src/notes/704_binary_search.md) |
| 875 | [Koko Eating Bananas](src/exercises/875.koko-eating-bananas.py) | Medium | [View Notes](src/notes/875_koko_eating_bananas.md) |
| 990 | [Satisfiability of Equality Equations](src/exercises/990.satisfiability-of-equality-equations.py) | Medium | [View Notes](src/notes/990_satisfiability_of_equality_equations.md) |
| 1200 | [Minimum Absolute Difference](src/exercises/1200.minimum-absolute-difference.py) | Easy | [View Notes](src/notes/1200_minimum_absolute_difference.md) |
| 1298 | [Maximum Candies You Can Get from Boxes](src/exercises/1298.maximum-candies-you-can-get-from-boxes.py) | Medium | [View Notes](src/notes/1298_maximum_candies_you_can_get_from_boxes.md) |
| 1820 | [Maximum Number of Accepted Invitations](src/exercises/1820.maximum-number-of-accepted-invitations.py) | Medium | [View Notes](src/notes/1820_maximum_number_of_accepted_invitations.md) |
| 2040 | [Kth Smallest Product of Two Sorted Arrays](src/exercises/2040.kth-smallest-product-of-two-sorted-arrays.py) | Medium | [View Notes](src/notes/2040_kth_smallest_product_of_two_sorted_arrays.md) |
| 2053 | [Kth Distinct String in an Array](src/exercises/2053.kth-distinct-string-in-an-array.py) | Easy | [View Notes](src/notes/2053_kth_distinct_string_in_an_array.md) |
| 2116 | [Check if a Parentheses String Can Be Valid](src/exercises/2116.check-if-a-parentheses-string-can-be-valid.py) | Medium | [View Notes](src/notes/2116_check_if_a_parentheses_string_can_be_valid.md) |
| 2294 | [Partition Array Such That Maximum Difference Is K](src/exercises/2294.partition-array-such-that-maximum-difference-is-k.py) | Medium | [View Notes](src/notes/2294_partition_array_such_that_maximum_difference_is_k.md) |
| 2441 | [Largest Positive Integer That Exists With Its Negative](src/exercises/2441.largest-positive-integer-that-exists-with-its-negative.py) | Easy | [View Notes](src/notes/2441_largest_positive_integer_that_exists_with_its_negative.md) |
| 2616 | [Minimize the Maximum Difference of Pairs](src/exercises/2616.minimize-the-maximum-difference-of-pairs.py) | Medium | [View Notes](src/notes/2616_minimize_the_maximum_difference_of_pairs.md) |
| 2966 | [Divide Array Into Arrays With Max Difference](src/exercises/2966.divide-array-into-arrays-with-max-difference.py) | Medium | [View Notes](src/notes/2966_divide_array_into_arrays_with_max_difference.md) |
| 3442 | [Maximum Difference Between Even and Odd Frequency I](src/exercises/3442.maximum-difference-between-even-and-odd-frequency-i.py) | Easy | [View Notes](src/notes/3442_maximum_difference_between_even_and_odd_frequency_i.md) |
| 3445 | [Maximum Difference Between Even and Odd Frequency II](src/exercises/3445.maximum-difference-between-even-and-odd-frequency-ii.py) | Easy | [View Notes](src/notes/3445_maximum_difference_between_even_and_odd_frequency_ii.md) |
## 🛠️ Tools & Scripts
- `create_missing_notes.sh`: Automatically creates missing note files for solved problems