Skip to content

🧩 A curated collection of LeetCode solutions in Python, organized by algorithmic topics for efficient study and review.

Notifications You must be signed in to change notification settings

xinghao302001/leet-code-practice

Repository files navigation

🧩 LeetCodeFun

A curated collection of LeetCode solutions in Python, systematically organized by algorithmic topics to facilitate efficient study and review.


πŸ“ Repository Structure

LeetCodeFun/
β”œβ”€β”€ Array/
β”œβ”€β”€ Backtracking/
β”œβ”€β”€ Binary Search/
β”œβ”€β”€ Binary Trees/
β”œβ”€β”€ Double Pointer/
β”œβ”€β”€ Greedy/
β”œβ”€β”€ LinkedList/
β”œβ”€β”€ Online-Coding-test/
β”œβ”€β”€ Sliding Window/
β”œβ”€β”€ Sorting/
β”œβ”€β”€ StackAndQueue/
β”œβ”€β”€ String/
└── README.md

Each directory contains Python solutions to problems related to the respective algorithmic topic.


πŸ› οΈ Technologies Used


πŸš€ Getting Started

  1. Clone the repository:

    git clone https://github.com/xinghao302001/LeetCodeFun.git
  2. Navigate to a topic directory:

    cd LeetCodeFun/Array
  3. Explore the solutions:

    Open the Python files in your preferred code editor to study the solutions.


🀝 Contributing

Contributions are welcome! If you have alternative solutions or improvements, feel free to submit a pull request.


About

🧩 A curated collection of LeetCode solutions in Python, organized by algorithmic topics for efficient study and review.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages