chore(leetcode75): scaffolding

github-actions[bot] · github-actions[bot] · commit 8e958fe9486e · 2025-11-15T17:15:59.000Z
diff --git a/problems/leetcode75/lc_0011_container_with_most_water.py b/problems/leetcode75/lc_0011_container_with_most_water.py
@@ -0,0 +1,3 @@
+# Container With Most Water (https://leetcode.com/problems/container-with-most-water/)
+# Difficulty: Medium
+# Tags: Array, Two Pointers, Greedy
diff --git a/problems/leetcode75/lc_0017_letter_combinations_of_a_phone_number.py b/problems/leetcode75/lc_0017_letter_combinations_of_a_phone_number.py
@@ -0,0 +1,3 @@
+# Letter Combinations of a Phone Number (https://leetcode.com/problems/letter-combinations-of-a-phone-number/)
+# Difficulty: Medium
+# Tags: Hash Table, String, Backtracking
diff --git a/problems/leetcode75/lc_0062_unique_paths.py b/problems/leetcode75/lc_0062_unique_paths.py
@@ -0,0 +1,3 @@
+# Unique Paths (https://leetcode.com/problems/unique-paths/)
+# Difficulty: Medium
+# Tags: Math, Dynamic Programming, Combinatorics
diff --git a/problems/leetcode75/lc_0072_edit_distance.py b/problems/leetcode75/lc_0072_edit_distance.py
@@ -0,0 +1,3 @@
+# Edit Distance (https://leetcode.com/problems/edit-distance/)
+# Difficulty: Medium
+# Tags: String, Dynamic Programming
diff --git a/problems/leetcode75/lc_0104_maximum_depth_of_binary_tree.py b/problems/leetcode75/lc_0104_maximum_depth_of_binary_tree.py
@@ -0,0 +1,3 @@
+# Maximum Depth of Binary Tree (https://leetcode.com/problems/maximum-depth-of-binary-tree/)
+# Difficulty: Easy
+# Tags: Tree, Depth-First Search, Breadth-First Search, Binary Tree
diff --git a/problems/leetcode75/lc_0136_single_number.py b/problems/leetcode75/lc_0136_single_number.py
@@ -0,0 +1,3 @@
+# Single Number (https://leetcode.com/problems/single-number/)
+# Difficulty: Easy
+# Tags: Array, Bit Manipulation
diff --git a/problems/leetcode75/lc_0151_reverse_words_in_a_string.py b/problems/leetcode75/lc_0151_reverse_words_in_a_string.py
@@ -0,0 +1,3 @@
+# Reverse Words in a String (https://leetcode.com/problems/reverse-words-in-a-string/)
+# Difficulty: Medium
+# Tags: Two Pointers, String
diff --git a/problems/leetcode75/lc_0162_find_peak_element.py b/problems/leetcode75/lc_0162_find_peak_element.py
@@ -0,0 +1,3 @@
+# Find Peak Element (https://leetcode.com/problems/find-peak-element/)
+# Difficulty: Medium
+# Tags: Array, Binary Search
diff --git a/problems/leetcode75/lc_0198_house_robber.py b/problems/leetcode75/lc_0198_house_robber.py
@@ -0,0 +1,3 @@
+# House Robber (https://leetcode.com/problems/house-robber/)
+# Difficulty: Medium
+# Tags: Array, Dynamic Programming
diff --git a/problems/leetcode75/lc_0199_binary_tree_right_side_view.py b/problems/leetcode75/lc_0199_binary_tree_right_side_view.py
@@ -0,0 +1,3 @@
+# Binary Tree Right Side View (https://leetcode.com/problems/binary-tree-right-side-view/)
+# Difficulty: Medium
+# Tags: Tree, Depth-First Search, Breadth-First Search, Binary Tree
diff --git a/problems/leetcode75/lc_0206_reverse_linked_list.py b/problems/leetcode75/lc_0206_reverse_linked_list.py
@@ -0,0 +1,3 @@
+# Reverse Linked List (https://leetcode.com/problems/reverse-linked-list/)
+# Difficulty: Easy
+# Tags: Linked List, Recursion
diff --git a/problems/leetcode75/lc_0208_implement_trie_prefix_tree.py b/problems/leetcode75/lc_0208_implement_trie_prefix_tree.py
@@ -0,0 +1,3 @@
+# Implement Trie (Prefix Tree) (https://leetcode.com/problems/implement-trie-prefix-tree/)
+# Difficulty: Medium
+# Tags: Hash Table, String, Design, Trie
diff --git a/problems/leetcode75/lc_0215_kth_largest_element_in_an_array.py b/problems/leetcode75/lc_0215_kth_largest_element_in_an_array.py
@@ -0,0 +1,3 @@
+# Kth Largest Element in an Array (https://leetcode.com/problems/kth-largest-element-in-an-array/)
+# Difficulty: Medium
+# Tags: Array, Divide and Conquer, Sorting, Heap (Priority Queue), Quickselect
diff --git a/problems/leetcode75/lc_0216_combination_sum_iii.py b/problems/leetcode75/lc_0216_combination_sum_iii.py
@@ -0,0 +1,3 @@
+# Combination Sum III (https://leetcode.com/problems/combination-sum-iii/)
+# Difficulty: Medium
+# Tags: Array, Backtracking
diff --git a/problems/leetcode75/lc_0236_lowest_common_ancestor_of_a_binary_tree.py b/problems/leetcode75/lc_0236_lowest_common_ancestor_of_a_binary_tree.py
@@ -0,0 +1,3 @@
+# Lowest Common Ancestor of a Binary Tree (https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/)
+# Difficulty: Medium
+# Tags: Tree, Depth-First Search, Binary Tree
diff --git a/problems/leetcode75/lc_0238_product_of_array_except_self.py b/problems/leetcode75/lc_0238_product_of_array_except_self.py
@@ -0,0 +1,3 @@
+# Product of Array Except Self (https://leetcode.com/problems/product-of-array-except-self/)
+# Difficulty: Medium
+# Tags: Array, Prefix Sum
diff --git a/problems/leetcode75/lc_0283_move_zeroes.py b/problems/leetcode75/lc_0283_move_zeroes.py
@@ -0,0 +1,3 @@
+# Move Zeroes (https://leetcode.com/problems/move-zeroes/)
+# Difficulty: Easy
+# Tags: Array, Two Pointers
diff --git a/problems/leetcode75/lc_0328_odd_even_linked_list.py b/problems/leetcode75/lc_0328_odd_even_linked_list.py
@@ -0,0 +1,3 @@
+# Odd Even Linked List (https://leetcode.com/problems/odd-even-linked-list/)
+# Difficulty: Medium
+# Tags: Linked List
diff --git a/problems/leetcode75/lc_0334_increasing_triplet_subsequence.py b/problems/leetcode75/lc_0334_increasing_triplet_subsequence.py
@@ -0,0 +1,3 @@
+# Increasing Triplet Subsequence (https://leetcode.com/problems/increasing-triplet-subsequence/)
+# Difficulty: Medium
+# Tags: Array, Greedy
diff --git a/problems/leetcode75/lc_0338_counting_bits.py b/problems/leetcode75/lc_0338_counting_bits.py
@@ -0,0 +1,3 @@
+# Counting Bits (https://leetcode.com/problems/counting-bits/)
+# Difficulty: Easy
+# Tags: Dynamic Programming, Bit Manipulation
diff --git a/problems/leetcode75/lc_0345_reverse_vowels_of_a_string.py b/problems/leetcode75/lc_0345_reverse_vowels_of_a_string.py
@@ -0,0 +1,3 @@
+# Reverse Vowels of a String (https://leetcode.com/problems/reverse-vowels-of-a-string/)
+# Difficulty: Easy
+# Tags: Two Pointers, String
diff --git a/problems/leetcode75/lc_0374_guess_number_higher_or_lower.py b/problems/leetcode75/lc_0374_guess_number_higher_or_lower.py
@@ -0,0 +1,3 @@
+# Guess Number Higher or Lower (https://leetcode.com/problems/guess-number-higher-or-lower/)
+# Difficulty: Easy
+# Tags: Binary Search, Interactive
diff --git a/problems/leetcode75/lc_0392_is_subsequence.py b/problems/leetcode75/lc_0392_is_subsequence.py
@@ -0,0 +1,3 @@
+# Is Subsequence (https://leetcode.com/problems/is-subsequence/)
+# Difficulty: Easy
+# Tags: Two Pointers, String, Dynamic Programming
diff --git a/problems/leetcode75/lc_0394_decode_string.py b/problems/leetcode75/lc_0394_decode_string.py
@@ -0,0 +1,3 @@
+# Decode String (https://leetcode.com/problems/decode-string/)
+# Difficulty: Medium
+# Tags: String, Stack, Recursion
diff --git a/problems/leetcode75/lc_0399_evaluate_division.py b/problems/leetcode75/lc_0399_evaluate_division.py
@@ -0,0 +1,3 @@
+# Evaluate Division (https://leetcode.com/problems/evaluate-division/)
+# Difficulty: Medium
+# Tags: Array, String, Depth-First Search, Breadth-First Search, Union Find, Graph, Shortest Path
diff --git a/problems/leetcode75/lc_0435_non_overlapping_intervals.py b/problems/leetcode75/lc_0435_non_overlapping_intervals.py
@@ -0,0 +1,3 @@
+# Non-overlapping Intervals (https://leetcode.com/problems/non-overlapping-intervals/)
+# Difficulty: Medium
+# Tags: Array, Dynamic Programming, Greedy, Sorting
diff --git a/problems/leetcode75/lc_0437_path_sum_iii.py b/problems/leetcode75/lc_0437_path_sum_iii.py
@@ -0,0 +1,3 @@
+# Path Sum III (https://leetcode.com/problems/path-sum-iii/)
+# Difficulty: Medium
+# Tags: Tree, Depth-First Search, Binary Tree
diff --git a/problems/leetcode75/lc_0443_string_compression.py b/problems/leetcode75/lc_0443_string_compression.py
@@ -0,0 +1,3 @@
+# String Compression (https://leetcode.com/problems/string-compression/)
+# Difficulty: Medium
+# Tags: Two Pointers, String
diff --git a/problems/leetcode75/lc_0450_delete_node_in_a_bst.py b/problems/leetcode75/lc_0450_delete_node_in_a_bst.py
@@ -0,0 +1,3 @@
+# Delete Node in a BST (https://leetcode.com/problems/delete-node-in-a-bst/)
+# Difficulty: Medium
+# Tags: Tree, Binary Search Tree, Binary Tree
diff --git a/problems/leetcode75/lc_0452_minimum_number_of_arrows_to_burst_balloons.py b/problems/leetcode75/lc_0452_minimum_number_of_arrows_to_burst_balloons.py
@@ -0,0 +1,3 @@
+# Minimum Number of Arrows to Burst Balloons (https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/)
+# Difficulty: Medium
+# Tags: Array, Greedy, Sorting
diff --git a/problems/leetcode75/lc_0547_number_of_provinces.py b/problems/leetcode75/lc_0547_number_of_provinces.py
@@ -0,0 +1,3 @@
+# Number of Provinces (https://leetcode.com/problems/number-of-provinces/)
+# Difficulty: Medium
+# Tags: Depth-First Search, Breadth-First Search, Union Find, Graph
diff --git a/problems/leetcode75/lc_0605_can_place_flowers.py b/problems/leetcode75/lc_0605_can_place_flowers.py
@@ -0,0 +1,3 @@
+# Can Place Flowers (https://leetcode.com/problems/can-place-flowers/)
+# Difficulty: Easy
+# Tags: Array, Greedy
diff --git a/problems/leetcode75/lc_0643_maximum_average_subarray_i.py b/problems/leetcode75/lc_0643_maximum_average_subarray_i.py
@@ -0,0 +1,3 @@
+# Maximum Average Subarray I (https://leetcode.com/problems/maximum-average-subarray-i/)
+# Difficulty: Easy
+# Tags: Array, Sliding Window
diff --git a/problems/leetcode75/lc_0649_dota2_senate.py b/problems/leetcode75/lc_0649_dota2_senate.py
@@ -0,0 +1,3 @@
+# Dota2 Senate (https://leetcode.com/problems/dota2-senate/)
+# Difficulty: Medium
+# Tags: String, Greedy, Queue
diff --git a/problems/leetcode75/lc_0714_best_time_to_buy_and_sell_stock_with_transaction_fee.py b/problems/leetcode75/lc_0714_best_time_to_buy_and_sell_stock_with_transaction_fee.py
@@ -0,0 +1,3 @@
+# Best Time to Buy and Sell Stock with Transaction Fee (https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/)
+# Difficulty: Medium
+# Tags: Array, Dynamic Programming, Greedy
diff --git a/problems/leetcode75/lc_0724_find_pivot_index.py b/problems/leetcode75/lc_0724_find_pivot_index.py
@@ -0,0 +1,3 @@
+# Find Pivot Index (https://leetcode.com/problems/find-pivot-index/)
+# Difficulty: Easy
+# Tags: Array, Prefix Sum
diff --git a/problems/leetcode75/lc_0735_asteroid_collision.py b/problems/leetcode75/lc_0735_asteroid_collision.py
@@ -0,0 +1,3 @@
+# Asteroid Collision (https://leetcode.com/problems/asteroid-collision/)
+# Difficulty: Medium
+# Tags: Array, Stack, Simulation
diff --git a/problems/leetcode75/lc_0739_daily_temperatures.py b/problems/leetcode75/lc_0739_daily_temperatures.py
@@ -0,0 +1,3 @@
+# Daily Temperatures (https://leetcode.com/problems/daily-temperatures/)
+# Difficulty: Medium
+# Tags: Array, Stack, Monotonic Stack
diff --git a/problems/leetcode75/lc_0747_min_cost_climbing_stairs.py b/problems/leetcode75/lc_0747_min_cost_climbing_stairs.py
@@ -0,0 +1,3 @@
+# Min Cost Climbing Stairs (https://leetcode.com/problems/min-cost-climbing-stairs/)
+# Difficulty: Easy
+# Tags: Array, Dynamic Programming
diff --git a/problems/leetcode75/lc_0783_search_in_a_binary_search_tree.py b/problems/leetcode75/lc_0783_search_in_a_binary_search_tree.py
@@ -0,0 +1,3 @@
+# Search in a Binary Search Tree (https://leetcode.com/problems/search-in-a-binary-search-tree/)
+# Difficulty: Easy
+# Tags: Tree, Binary Search Tree, Binary Tree
diff --git a/problems/leetcode75/lc_0806_domino_and_tromino_tiling.py b/problems/leetcode75/lc_0806_domino_and_tromino_tiling.py
@@ -0,0 +1,3 @@
+# Domino and Tromino Tiling (https://leetcode.com/problems/domino-and-tromino-tiling/)
+# Difficulty: Medium
+# Tags: Dynamic Programming
diff --git a/problems/leetcode75/lc_0871_keys_and_rooms.py b/problems/leetcode75/lc_0871_keys_and_rooms.py
@@ -0,0 +1,3 @@
+# Keys and Rooms (https://leetcode.com/problems/keys-and-rooms/)
+# Difficulty: Medium
+# Tags: Depth-First Search, Breadth-First Search, Graph
diff --git a/problems/leetcode75/lc_0904_leaf_similar_trees.py b/problems/leetcode75/lc_0904_leaf_similar_trees.py
@@ -0,0 +1,3 @@
+# Leaf-Similar Trees (https://leetcode.com/problems/leaf-similar-trees/)
+# Difficulty: Easy
+# Tags: Tree, Depth-First Search, Binary Tree
diff --git a/problems/leetcode75/lc_0907_koko_eating_bananas.py b/problems/leetcode75/lc_0907_koko_eating_bananas.py
@@ -0,0 +1,3 @@
+# Koko Eating Bananas (https://leetcode.com/problems/koko-eating-bananas/)
+# Difficulty: Medium
+# Tags: Array, Binary Search
diff --git a/problems/leetcode75/lc_0937_online_stock_span.py b/problems/leetcode75/lc_0937_online_stock_span.py
@@ -0,0 +1,3 @@
+# Online Stock Span (https://leetcode.com/problems/online-stock-span/)
+# Difficulty: Medium
+# Tags: Stack, Design, Monotonic Stack, Data Stream
diff --git a/problems/leetcode75/lc_0969_number_of_recent_calls.py b/problems/leetcode75/lc_0969_number_of_recent_calls.py
@@ -0,0 +1,3 @@
+# Number of Recent Calls (https://leetcode.com/problems/number-of-recent-calls/)
+# Difficulty: Easy
+# Tags: Design, Queue, Data Stream
diff --git a/problems/leetcode75/lc_1036_rotting_oranges.py b/problems/leetcode75/lc_1036_rotting_oranges.py
@@ -0,0 +1,3 @@
+# Rotting Oranges (https://leetcode.com/problems/rotting-oranges/)
+# Difficulty: Medium
+# Tags: Array, Breadth-First Search, Matrix
diff --git a/problems/leetcode75/lc_1046_max_consecutive_ones_iii.py b/problems/leetcode75/lc_1046_max_consecutive_ones_iii.py
@@ -0,0 +1,3 @@
+# Max Consecutive Ones III (https://leetcode.com/problems/max-consecutive-ones-iii/)
+# Difficulty: Medium
+# Tags: Array, Binary Search, Sliding Window, Prefix Sum
diff --git a/problems/leetcode75/lc_1116_maximum_level_sum_of_a_binary_tree.py b/problems/leetcode75/lc_1116_maximum_level_sum_of_a_binary_tree.py
@@ -0,0 +1,3 @@
+# Maximum Level Sum of a Binary Tree (https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree/)
+# Difficulty: Medium
+# Tags: Tree, Depth-First Search, Breadth-First Search, Binary Tree
diff --git a/problems/leetcode75/lc_1146_greatest_common_divisor_of_strings.py b/problems/leetcode75/lc_1146_greatest_common_divisor_of_strings.py
@@ -0,0 +1,3 @@
+# Greatest Common Divisor of Strings (https://leetcode.com/problems/greatest-common-divisor-of-strings/)
+# Difficulty: Easy
+# Tags: Math, String
diff --git a/problems/leetcode75/lc_1236_n_th_tribonacci_number.py b/problems/leetcode75/lc_1236_n_th_tribonacci_number.py
@@ -0,0 +1,3 @@
+# N-th Tribonacci Number (https://leetcode.com/problems/n-th-tribonacci-number/)
+# Difficulty: Easy
+# Tags: Math, Dynamic Programming, Memoization
diff --git a/problems/leetcode75/lc_1250_longest_common_subsequence.py b/problems/leetcode75/lc_1250_longest_common_subsequence.py
@@ -0,0 +1,3 @@
+# Longest Common Subsequence (https://leetcode.com/problems/longest-common-subsequence/)
+# Difficulty: Medium
+# Tags: String, Dynamic Programming
diff --git a/problems/leetcode75/lc_1319_unique_number_of_occurrences.py b/problems/leetcode75/lc_1319_unique_number_of_occurrences.py
@@ -0,0 +1,3 @@
+# Unique Number of Occurrences (https://leetcode.com/problems/unique-number-of-occurrences/)
+# Difficulty: Easy
+# Tags: Array, Hash Table
diff --git a/problems/leetcode75/lc_1392_find_the_difference_of_two_arrays.py b/problems/leetcode75/lc_1392_find_the_difference_of_two_arrays.py
@@ -0,0 +1,3 @@
+# Find the Difference of Two Arrays (https://leetcode.com/problems/find-the-difference-of-two-arrays/)
+# Difficulty: Easy
+# Tags: Array, Hash Table
diff --git a/problems/leetcode75/lc_1397_search_suggestions_system.py b/problems/leetcode75/lc_1397_search_suggestions_system.py
@@ -0,0 +1,3 @@
+# Search Suggestions System (https://leetcode.com/problems/search-suggestions-system/)
+# Difficulty: Medium
+# Tags: Array, String, Binary Search, Trie, Sorting, Heap (Priority Queue)
diff --git a/problems/leetcode75/lc_1441_minimum_flips_to_make_a_or_b_equal_to_c.py b/problems/leetcode75/lc_1441_minimum_flips_to_make_a_or_b_equal_to_c.py
@@ -0,0 +1,3 @@
+# Minimum Flips to Make a OR b Equal to c (https://leetcode.com/problems/minimum-flips-to-make-a-or-b-equal-to-c/)
+# Difficulty: Medium
+# Tags: Bit Manipulation
diff --git a/problems/leetcode75/lc_1474_longest_zigzag_path_in_a_binary_tree.py b/problems/leetcode75/lc_1474_longest_zigzag_path_in_a_binary_tree.py
@@ -0,0 +1,3 @@
+# Longest ZigZag Path in a Binary Tree (https://leetcode.com/problems/longest-zigzag-path-in-a-binary-tree/)
+# Difficulty: Medium
+# Tags: Dynamic Programming, Tree, Depth-First Search, Binary Tree
diff --git a/problems/leetcode75/lc_1528_kids_with_the_greatest_number_of_candies.py b/problems/leetcode75/lc_1528_kids_with_the_greatest_number_of_candies.py
@@ -0,0 +1,3 @@
+# Kids With the Greatest Number of Candies (https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/)
+# Difficulty: Easy
+# Tags: Array
diff --git a/problems/leetcode75/lc_1544_count_good_nodes_in_binary_tree.py b/problems/leetcode75/lc_1544_count_good_nodes_in_binary_tree.py
@@ -0,0 +1,3 @@
+# Count Good Nodes in Binary Tree (https://leetcode.com/problems/count-good-nodes-in-binary-tree/)
+# Difficulty: Medium
+# Tags: Tree, Depth-First Search, Breadth-First Search, Binary Tree
diff --git a/problems/leetcode75/lc_1567_maximum_number_of_vowels_in_a_substring_of_given_length.py b/problems/leetcode75/lc_1567_maximum_number_of_vowels_in_a_substring_of_given_length.py
@@ -0,0 +1,3 @@
+# Maximum Number of Vowels in a Substring of Given Length (https://leetcode.com/problems/maximum-number-of-vowels-in-a-substring-of-given-length/)
+# Difficulty: Medium
+# Tags: String, Sliding Window
diff --git a/problems/leetcode75/lc_1576_reorder_routes_to_make_all_paths_lead_to_the_city_zero.py b/problems/leetcode75/lc_1576_reorder_routes_to_make_all_paths_lead_to_the_city_zero.py
@@ -0,0 +1,3 @@
+# Reorder Routes to Make All Paths Lead to the City Zero (https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/)
+# Difficulty: Medium
+# Tags: Depth-First Search, Breadth-First Search, Graph
diff --git a/problems/leetcode75/lc_1586_longest_subarray_of_1_s_after_deleting_one_element.py b/problems/leetcode75/lc_1586_longest_subarray_of_1_s_after_deleting_one_element.py
@@ -0,0 +1,3 @@
+# Longest Subarray of 1's After Deleting One Element (https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element/)
+# Difficulty: Medium
+# Tags: Array, Dynamic Programming, Sliding Window
diff --git a/problems/leetcode75/lc_1777_determine_if_two_strings_are_close.py b/problems/leetcode75/lc_1777_determine_if_two_strings_are_close.py
@@ -0,0 +1,3 @@
+# Determine if Two Strings Are Close (https://leetcode.com/problems/determine-if-two-strings-are-close/)
+# Difficulty: Medium
+# Tags: Hash Table, String, Sorting, Counting
diff --git a/problems/leetcode75/lc_1798_max_number_of_k_sum_pairs.py b/problems/leetcode75/lc_1798_max_number_of_k_sum_pairs.py
@@ -0,0 +1,3 @@
+# Max Number of K-Sum Pairs (https://leetcode.com/problems/max-number-of-k-sum-pairs/)
+# Difficulty: Medium
+# Tags: Array, Hash Table, Two Pointers, Sorting
diff --git a/problems/leetcode75/lc_1833_find_the_highest_altitude.py b/problems/leetcode75/lc_1833_find_the_highest_altitude.py
@@ -0,0 +1,3 @@
+# Find the Highest Altitude (https://leetcode.com/problems/find-the-highest-altitude/)
+# Difficulty: Easy
+# Tags: Array, Prefix Sum
diff --git a/problems/leetcode75/lc_1894_merge_strings_alternately.py b/problems/leetcode75/lc_1894_merge_strings_alternately.py
@@ -0,0 +1,3 @@
+# Merge Strings Alternately (https://leetcode.com/problems/merge-strings-alternately/)
+# Difficulty: Easy
+# Tags: Two Pointers, String
diff --git a/problems/leetcode75/lc_2038_nearest_exit_from_entrance_in_maze.py b/problems/leetcode75/lc_2038_nearest_exit_from_entrance_in_maze.py
@@ -0,0 +1,3 @@
+# Nearest Exit from Entrance in Maze (https://leetcode.com/problems/nearest-exit-from-entrance-in-maze/)
+# Difficulty: Medium
+# Tags: Array, Breadth-First Search, Matrix
diff --git a/problems/leetcode75/lc_2216_delete_the_middle_node_of_a_linked_list.py b/problems/leetcode75/lc_2216_delete_the_middle_node_of_a_linked_list.py
@@ -0,0 +1,3 @@
+# Delete the Middle Node of a Linked List (https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list/)
+# Difficulty: Medium
+# Tags: Linked List, Two Pointers
diff --git a/problems/leetcode75/lc_2236_maximum_twin_sum_of_a_linked_list.py b/problems/leetcode75/lc_2236_maximum_twin_sum_of_a_linked_list.py
@@ -0,0 +1,3 @@
+# Maximum Twin Sum of a Linked List (https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/)
+# Difficulty: Medium
+# Tags: Linked List, Two Pointers, Stack
diff --git a/problems/leetcode75/lc_2392_successful_pairs_of_spells_and_potions.py b/problems/leetcode75/lc_2392_successful_pairs_of_spells_and_potions.py
@@ -0,0 +1,3 @@
+# Successful Pairs of Spells and Potions (https://leetcode.com/problems/successful-pairs-of-spells-and-potions/)
+# Difficulty: Medium
+# Tags: Array, Two Pointers, Binary Search, Sorting
diff --git a/problems/leetcode75/lc_2413_smallest_number_in_infinite_set.py b/problems/leetcode75/lc_2413_smallest_number_in_infinite_set.py
@@ -0,0 +1,3 @@
+# Smallest Number in Infinite Set (https://leetcode.com/problems/smallest-number-in-infinite-set/)
+# Difficulty: Medium
+# Tags: Hash Table, Design, Heap (Priority Queue), Ordered Set
diff --git a/problems/leetcode75/lc_2428_equal_row_and_column_pairs.py b/problems/leetcode75/lc_2428_equal_row_and_column_pairs.py
@@ -0,0 +1,3 @@
+# Equal Row and Column Pairs (https://leetcode.com/problems/equal-row-and-column-pairs/)
+# Difficulty: Medium
+# Tags: Array, Hash Table, Matrix, Simulation
diff --git a/problems/leetcode75/lc_2470_removing_stars_from_a_string.py b/problems/leetcode75/lc_2470_removing_stars_from_a_string.py
@@ -0,0 +1,3 @@
+# Removing Stars From a String (https://leetcode.com/problems/removing-stars-from-a-string/)
+# Difficulty: Medium
+# Tags: String, Stack, Simulation
diff --git a/problems/leetcode75/lc_2553_total_cost_to_hire_k_workers.py b/problems/leetcode75/lc_2553_total_cost_to_hire_k_workers.py
@@ -0,0 +1,3 @@
+# Total Cost to Hire K Workers (https://leetcode.com/problems/total-cost-to-hire-k-workers/)
+# Difficulty: Medium
+# Tags: Array, Two Pointers, Heap (Priority Queue), Simulation
diff --git a/problems/leetcode75/lc_2636_maximum_subsequence_score.py b/problems/leetcode75/lc_2636_maximum_subsequence_score.py
@@ -0,0 +1,3 @@
+# Maximum Subsequence Score (https://leetcode.com/problems/maximum-subsequence-score/)
+# Difficulty: Medium
+# Tags: Array, Greedy, Sorting, Heap (Priority Queue)
diff --git a/scripts/leetcode75-details.json b/scripts/leetcode75-details.json

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,3 @@`
	`1`	`+# Container With Most Water (https://leetcode.com/problems/container-with-most-water/)`
	`2`	`+# Difficulty: Medium`
	`3`	`+# Tags: Array, Two Pointers, Greedy`
Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,3 @@`
	`1`	`+# Letter Combinations of a Phone Number (https://leetcode.com/problems/letter-combinations-of-a-phone-number/)`
	`2`	`+# Difficulty: Medium`
	`3`	`+# Tags: Hash Table, String, Backtracking`
Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,3 @@`
	`1`	`+# Unique Paths (https://leetcode.com/problems/unique-paths/)`
	`2`	`+# Difficulty: Medium`
	`3`	`+# Tags: Math, Dynamic Programming, Combinatorics`
Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,3 @@`
	`1`	`+# Edit Distance (https://leetcode.com/problems/edit-distance/)`
	`2`	`+# Difficulty: Medium`
	`3`	`+# Tags: String, Dynamic Programming`
Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,3 @@`
	`1`	`+# Maximum Depth of Binary Tree (https://leetcode.com/problems/maximum-depth-of-binary-tree/)`
	`2`	`+# Difficulty: Easy`
	`3`	`+# Tags: Tree, Depth-First Search, Breadth-First Search, Binary Tree`
Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,3 @@`
	`1`	`+# Single Number (https://leetcode.com/problems/single-number/)`
	`2`	`+# Difficulty: Easy`
	`3`	`+# Tags: Array, Bit Manipulation`
Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,3 @@`
	`1`	`+# Reverse Words in a String (https://leetcode.com/problems/reverse-words-in-a-string/)`
	`2`	`+# Difficulty: Medium`
	`3`	`+# Tags: Two Pointers, String`
Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,3 @@`
	`1`	`+# Find Peak Element (https://leetcode.com/problems/find-peak-element/)`
	`2`	`+# Difficulty: Medium`
	`3`	`+# Tags: Array, Binary Search`
Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,3 @@`
	`1`	`+# House Robber (https://leetcode.com/problems/house-robber/)`
	`2`	`+# Difficulty: Medium`
	`3`	`+# Tags: Array, Dynamic Programming`
Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,3 @@`
	`1`	`+# Binary Tree Right Side View (https://leetcode.com/problems/binary-tree-right-side-view/)`
	`2`	`+# Difficulty: Medium`
	`3`	`+# Tags: Tree, Depth-First Search, Breadth-First Search, Binary Tree`