Welcome to my LeetCode Solutions repository! 👩💻 Here, you'll find my solutions to various LeetCode problems in different languages, explained clearly for easy understanding.
- Data Structures: Arrays, Linked Lists, Stacks, Queues, and more!
- Algorithms: Sorting, Searching, Recursion, Dynamic Programming, etc.
- Difficulty Levels: Easy, Medium, Hard 💪
- Languages: Solutions in JavaScript, Java, and more to come.
Welcome to this LeetCode Solutions repository! Here’s a quick guide to help you get started with viewing and using the code solutions effectively:
- 📁 Explore the Repository Structure: The solutions are organized by folders for each question range (e.g., 0000-0099), making it easy to find specific problems. Each folder contains subfolders for individual questions, named by the question number and title (e.g., 0001-TwoSum). Inside each question folder, there’s a solution.md file with explanations and code for that specific problem.
- 🔍 Navigate to Specific Problems: Go to the "Solutions" folder, and select the range folder that includes the question you’re looking for. Open the subfolder with the question number and title to view the solution file.
- 📖 Understanding the Solutions: In each solution.md file, you’ll find: A description of the problem, including the prompt and requirements. A detailed solution explanation, which covers the approach and thought process behind the code. Code implementation in a readable format to help you tackle similar problems.
- 🛠️ Using Code for Practice: Feel free to copy the code and test it on LeetCode’s platform. Experiment by modifying the code to deepen your understanding and explore alternative solutions.
- 🤝 Contributing (Optional): If you’d like to contribute by adding solutions, you’re welcome to create pull requests! Check out the Contributing Guidelines if available.
I'm always excited to collaborate or help out! Feel free to connect with me on: