Solutions to the LeetCode 75 study plan problems, a curated list of 75 essential LeetCode problems for interview preparation. Implemented in Python 3.10+. Each file is self‑documenting, runnable, and named so problems sort naturally.
LeetCode 75 is a curated study plan by LeetCode that covers 75 essential problems across various topics including arrays, strings, linked lists, trees, dynamic programming, and more to help you prepare for coding interviews.
Completed: 31/75
Purpose: Store and run LeetCode solutions for practice.
Language: Python 3.10+
Tested with: Python 3.10.6
Pattern: {id}_{short_title_snake_case}.py
Examples:
1768_merge_strings_alternately.py0001_two_sum.py
Rules:
- Start with the numeric problem id so files sort in problem order.
- Use snake_case for the short title; avoid spaces and special characters.
Place this header at the top of every solution file so each file is self‑documenting.
# LeetCode {id} {Short Title}
# URL: https://leetcode.com/problems/{slug}/
# Difficulty: Easy|Medium|Hard
# Language: Python 3.10+Concrete example:
# LeetCode 1768 Merge Strings Alternately
# URL: https://leetcode.com/problems/merge-strings-alternately/
# Difficulty: Easy
# Language: Python 3.10+Include a small runnable example in each file using the if __name__ == "__main__": guard so running the file verifies behavior quickly.
Run a single solution:
python 1768_merge_strings_alternately.pyQuick test pattern inside files:
if __name__ == "__main__":
print(Solution().mergeAlternately("abc", "xyz")) # expected: axbycz