LeetCode Medium Problem Solutions in Python 🐍

Welcome to LeetCode Medium Problem Solutions in Python!
This repository contains efficient and well-documented solutions to selected Medium-level problems from LeetCode, all written in Python. It aims to serve as a helpful guide for developers and students preparing for coding interviews and competitive programming contests.

📌 Features

✅ Clear and optimized solutions for medium-level LeetCode problems.
🧠 Covers key data structures and algorithms such as:
- Arrays & Strings
- HashMaps & Sets
- Binary Trees & Graphs
- Dynamic Programming
- Sliding Window
- Two Pointers
💬 Code is commented for better understanding.
📁 Each problem is stored in a separate .py file for ease of access.

📂 Folder Structure


LeetCode-Medium-Problem-Solutions-in-Python/
│
├── 3\_Longest\_Substring\_Without\_Repeating\_Characters.py
├── 5\_Longest\_Palindromic\_Substring.py
├── 46\_Permutations.py
├── 102\_Binary\_Tree\_Level\_Order\_Traversal.py
├── 120\_Triangle.py
├── ...
└── README.md

🚀 Getting Started

Clone the repository:

git clone https://github.com/udityamerit/LeetCode-Medium-Problem-Solutions-in-Python.git
cd LeetCode-Medium-Problem-Solutions-in-Python

Run a solution:

Each file can be run independently using Python 3:

python3 3_Longest_Substring_Without_Repeating_Characters.py

Make sure the required inputs are provided (if prompted or hardcoded).

🤝 Contribution

Contributions are welcome! If you'd like to add more problems or improve the solutions:

Fork the repository.
Create a new branch.
Add your changes.
Submit a pull request.

📧 Contact

Uditya Narayan Tiwari 📍 Portfolio 🔗 LinkedIn 💻 GitHub

⭐ Star This Repo

If you find this repository useful, please consider giving it a ⭐ to support the work!

📝 License

This project is licensed under the MIT License.

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Repository files navigation

LeetCode Medium Problem Solutions in Python 🐍

📌 Features

📂 Folder Structure

🚀 Getting Started

Clone the repository:

Run a solution:

🤝 Contribution

📧 Contact

⭐ Star This Repo

📝 License

About

Uh oh!

Releases

Packages

Languages

Name		Name	Last commit message	Last commit date
Latest commit History 130 Commits
1007_Minimum_domino_rotations_for_equal_row.ipynb		1007_Minimum_domino_rotations_for_equal_row.ipynb
128_Longest_consecutive_sequence.ipynb		128_Longest_consecutive_sequence.ipynb
1310_XOR_queries_of_a_subarray.ipynb		1310_XOR_queries_of_a_subarray.ipynb
1367_Linked_list_in_binary_tree.ipynb		1367_Linked_list_in_binary_tree.ipynb
137_Single_number_II.ipynb		137_Single_number_II.ipynb
1404_Number_of_steps_to_reduce_a_number_in_binary_representation_to_One.ipynb		1404_Number_of_steps_to_reduce_a_number_in_binary_representation_to_One.ipynb
1492_The_Kth_factor_of_n.ipynb		1492_The_Kth_factor_of_n.ipynb
1497_Check_if_array_pairs_are_divisible_by_k.ipynb		1497_Check_if_array_pairs_are_divisible_by_k.ipynb
152_Maximum_product_subarray.ipynb		152_Maximum_product_subarray.ipynb
153_find_minimum_in_rotated_sorted_array.ipynb		153_find_minimum_in_rotated_sorted_array.ipynb
1590_Make_sum_divisible_by_P.ipynb		1590_Make_sum_divisible_by_P.ipynb
15_3Sum.ipynb		15_3Sum.ipynb
167_Two_sum_II-Input_array_is_sorted.ipynb		167_Two_sum_II-Input_array_is_sorted.ipynb
1695_Maximum_Erasure_Value.ipynb		1695_Maximum_Erasure_Value.ipynb
16_3Sum_closest.ipynb		16_3Sum_closest.ipynb
1726_Tuple_with_same_product.ipynb		1726_Tuple_with_same_product.ipynb
172_Factorial_trailing_zeroes.ipynb		172_Factorial_trailing_zeroes.ipynb
1760_Minimum_limit_of_balls_in_a_bag.ipynb		1760_Minimum_limit_of_balls_in_a_bag.ipynb
176_Second_highest_salary.ipynb		176_Second_highest_salary.ipynb
1792_Maximum_average_pass_ration.ipynb		1792_Maximum_average_pass_ration.ipynb
179_Largest_number.ipynb		179_Largest_number.ipynb
1813_Sentence_Similarity_III.ipynb		1813_Sentence_Similarity_III.ipynb
1894_Find_the_student_that_will_replace_the_chalk.ipynb		1894_Find_the_student_that_will_replace_the_chalk.ipynb
189_Rotate_array.ipynb		189_Rotate_array.ipynb
1963_Minimum_number_of_swaps_to_make_the_string_balanced.ipynb		1963_Minimum_number_of_swaps_to_make_the_string_balanced.ipynb
198_House_robber.ipynb		198_House_robber.ipynb
2028_Find_missing_observations.ipynb		2028_Find_missing_observations.ipynb
2044_Count_numbers_of_maximum_bitwise_OR_subset.ipynb		2044_Count_numbers_of_maximum_bitwise_OR_subset.ipynb
204_Count_prime.ipynb		204_Count_prime.ipynb
2054_Two_best_non_overlaping_events.ipynb		2054_Two_best_non_overlaping_events.ipynb
2109_Adding_spaces_of_a_string.ipynb		2109_Adding_spaces_of_a_string.ipynb
2149_Rearrange_array_elements_by_sign.ipynb		2149_Rearrange_array_elements_by_sign.ipynb
215_Kth_largest_element_in_an_array.ipynb		215_Kth_largest_element_in_an_array.ipynb
2161_Partition_array_according_to_given_pivot.ipynb		2161_Partition_array_according_to_given_pivot.ipynb
2165_Smallest_value_of_the_rearranged_number.ipynb		2165_Smallest_value_of_the_rearranged_number.ipynb
2182_Construct_string_with_repeat_limit.ipynb		2182_Construct_string_with_repeat_limit.ipynb
2195_Append_K_integers_with_minimal_sum.ipynb		2195_Append_K_integers_with_minimal_sum.ipynb
2274_Maximum_consecutive_floors_without_special_floors.ipynb		2274_Maximum_consecutive_floors_without_special_floors.ipynb
2295_Replace_elements_in_an_array.ipynb		2295_Replace_elements_in_an_array.ipynb
229_Majority_element_II.ipynb		229_Majority_element_II.ipynb
2337_Move_pieces_to_obtain_a_string.ipynb		2337_Move_pieces_to_obtain_a_string.ipynb
233_Rectangle_area.ipynb		233_Rectangle_area.ipynb
2342_Max_sum_of_a_pair_with_equal_sum_of_digit.ipynb		2342_Max_sum_of_a_pair_with_equal_sum_of_digit.ipynb
237_Delete_node_in_a_linked_list.ipynb		237_Delete_node_in_a_linked_list.ipynb
238_Product_of_array_except_self.ipynb		238_Product_of_array_except_self.ipynb
2390_Removeing_stars_from_a_string.ipynb		2390_Removeing_stars_from_a_string.ipynb
2415_Reverse_odd_levels_of_binary_tree.ipynb		2415_Reverse_odd_levels_of_binary_tree.ipynb
2419_Longest_subarray_with_maximum_bitwise_and.ipynb		2419_Longest_subarray_with_maximum_bitwise_and.ipynb
2425_Bitwise_XOR_of_all_pairing.ipynb		2425_Bitwise_XOR_of_all_pairing.ipynb
2461_Maximum_sum_of_distinct_subarray_with_length_K.ipynb		2461_Maximum_sum_of_distinct_subarray_with_length_K.ipynb
2471_Minimum_number_of_operations_to_sort_a_binary_tree_by_level.ipynb		2471_Minimum_number_of_operations_to_sort_a_binary_tree_by_level.ipynb
2491_Divide_players_into_teams_of_equal_skill.ipynb		2491_Divide_players_into_teams_of_equal_skill.ipynb
2501_Longest_Square_Streak_in_an_array.ipynb		2501_Longest_Square_Streak_in_an_array.ipynb
2554_Maximum_number_of_integers_to_choose_from_a_range_I.ipynb		2554_Maximum_number_of_integers_to_choose_from_a_range_I.ipynb
2563_Count_the_number_of_fair_pairs.ipynb		2563_Count_the_number_of_fair_pairs.ipynb
260_Single_Number_III.ipynb		260_Single_Number_III.ipynb
274_H-index.ipynb		274_H-index.ipynb
2762_Continuous_subarrays.ipynb		2762_Continuous_subarrays.ipynb
2779_Maximum_beauty_of_an_array_after_applying_operation.ipynb		2779_Maximum_beauty_of_an_array_after_applying_operation.ipynb
2799_count_complete_subarray_in_an_array.ipynb		2799_count_complete_subarray_in_an_array.ipynb
2825_Make_string_a_subsequence_using_cyclic_increments.ipynb		2825_Make_string_a_subsequence_using_cyclic_increments.ipynb
2856_Minimum_array_length_after_pair_removals.ipynb		2856_Minimum_array_length_after_pair_removals.ipynb
2872_Maximum_number_of_K_divisible_component.ipynb		2872_Maximum_number_of_K_divisible_component.ipynb
2874_Maximum_value_of_an_orderd_triplet_II.ipynb		2874_Maximum_value_of_an_orderd_triplet_II.ipynb
287_Find_the_duplicate_number.ipynb		287_Find_the_duplicate_number.ipynb
2905_Find_indices_with_index_and_value_difference_II.ipynb		2905_Find_indices_with_index_and_value_difference_II.ipynb
2938_Separate_black_and_white_balls.ipynb		2938_Separate_black_and_white_balls.ipynb
2940_Find_building_where_alice_and_bob_can_meet.ipynb		2940_Find_building_where_alice_and_bob_can_meet.ipynb
2962_Count_subarrays_where_max_element_appears_at_least_K_times.ipynb		2962_Count_subarrays_where_max_element_appears_at_least_K_times.ipynb
2981_Find_longest_special_substring_that_occurs_thrice_I.ipynb		2981_Find_longest_special_substring_that_occurs_thrice_I.ipynb
2_Add_two_numbers_linkedlist.ipynb		2_Add_two_numbers_linkedlist.ipynb
3066_Minimum_operations_to_exceed_threshold_value_II.ipynb		3066_Minimum_operations_to_exceed_threshold_value_II.ipynb
3100_Water_bottles_II.ipynb		3100_Water_bottles_II.ipynb
3133_Minimum_array_end.ipynb		3133_Minimum_array_end.ipynb
3152_Special_array_II.ipynb		3152_Special_array_II.ipynb
3217_Delete_nodes_from_linked_list_present_in_array.ipynb		3217_Delete_nodes_from_linked_list_present_in_array.ipynb
3301_Maximize_the_total_height_of_unique_towers.ipynb		3301_Maximize_the_total_height_of_unique_towers.ipynb
334_Increasing_triplet_subsequence.ipynb		334_Increasing_triplet_subsequence.ipynb
33_Search_in_rotated_sorted_array.ipynb		33_Search_in_rotated_sorted_array.ipynb
347_Top_K_frequent_elements.ipynb		347_Top_K_frequent_elements.ipynb
378_Kth_smallest_element_in_a_sorted_matrix.ipynb		378_Kth_smallest_element_in_a_sorted_matrix.ipynb
386_Lexicographical_Numbers.ipynb		386_Lexicographical_Numbers.ipynb
396_rotate_funciton.ipynb		396_rotate_funciton.ipynb
3_Longest_substring_without_repeating_characters.ipynb		3_Longest_substring_without_repeating_characters.ipynb
41_HARD_type_question_first_missing_positive.ipynb		41_HARD_type_question_first_missing_positive.ipynb
43_Multiply_Strings.ipynb		43_Multiply_Strings.ipynb
468_Validate_ip_address.ipynb		468_Validate_ip_address.ipynb
46_Permutaions.ipynb		46_Permutaions.ipynb
474_Ones_and_Zeroes.ipynb		474_Ones_and_Zeroes.ipynb
47_Permutations_II.ipynb		47_Permutations_II.ipynb
494_Target_sum.ipynb		494_Target_sum.ipynb
49_Group_anagram.ipynb		49_Group_anagram.ipynb
4_Median_of_two_sorted_arrays(Hard).ipynb		4_Median_of_two_sorted_arrays(Hard).ipynb
50_Pow(x, n).ipynb		50_Pow(x, n).ipynb
515_Find_largest_value_in_each_tree_row.ipynb		515_Find_largest_value_in_each_tree_row.ipynb
523_Continuous_subarray_sum.ipynb		523_Continuous_subarray_sum.ipynb
532_K-diff_pairs_in_an_array.ipynb		532_K-diff_pairs_in_an_array.ipynb
539_Minimum_time_difference.ipynb		539_Minimum_time_difference.ipynb
540_Single_element_in_a_sorted_array.ipynb		540_Single_element_in_a_sorted_array.ipynb
556_Next_greater_element_III.ipynb		556_Next_greater_element_III.ipynb

License

udityamerit/LeetCode-Medium-Problem-Solutions-in-Python

Folders and files

Latest commit

History

Repository files navigation

LeetCode Medium Problem Solutions in Python 🐍

📌 Features

📂 Folder Structure

🚀 Getting Started

Clone the repository:

Run a solution:

🤝 Contribution

📧 Contact

⭐ Star This Repo

📝 License

About

Topics

Resources

License

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages