LeetCode Notes

Welcome to my LeetCode Notes repository! This repository contains my solutions and detailed explanations for LeetCode problems. Each problem has its own folder within the problems directory with solutions in multiple programming languages, along with a README explaining the problem, approach, and complexity analysis.

Problem List

Browse all problems with their difficulty levels (Easy, Medium, Hard) in the Problem Index. This Wiki page lists problem numbers, titles, difficulties, and links to solution folders, making it easy to find problems by category or difficulty. *Recommended

Or

Below is a list of problems solved in this repository:

• Problem 1: Two Sum
• Problem 7: Reverse Integer
• Problem 9: Palindrome Number
• Problem 13: Roman to Integer
• Problem 14: Longest Common Prefix
• Problem 20: Valid Parentheses
• Problem 21: Merge Two Sorted Lists
• Problem 26: Remove Duplicates from Sorted Array
• Problem 27: Remove Element
• Problem 35: Search Insert Position
• Problem 88: Merge Sorted Array
• Problem 206: Reverse Linked List
• Problem 704: Binary Search
• Problem 744: Find Smallest Letter Greater Than Target
• (Add more problems as they are solved)

Purpose

This repository serves as my personal learning journey through algorithmic problem-solving.

• Documenting my problem-solving journey on LeetCode.
• Exploring solutions in multiple programming languages (e.g., Python, Java, C++).
• Analyzing algorithms with detailed notes on time and space complexity.
• Sharing insights and approaches for others to learn from.

Directory Structure

• Each problem is organized in a folder named P-<number>-<name> (e.g., P-1-two-sum).
• Inside each problem folder:
  • README.md: Problem description, approach, and complexity analysis.
  • solution.<extension>: Solution code in a specific programming language (e.g., solution.py for Python).
  • tests/: Optional test cases or scripts to validate solutions.
• The templates folder contains reusable templates for problem READMEs and solution, tests files.
• The root README.md (this file) provides an overview of the repository.

How to Use

1. Navigate to a problem folder (e.g., P-1-two-sum) to view the problem description and solutions.
2. Check the README.md in each problem folder for a detailed explanation of the approach and complexity.
3. Explore solutions in different languages (e.g., Python, Java) within each problem folder.
4. Use the templates/ folder to create new problem folders with consistent formatting.

Visit the Wiki for more details

Contributing

While this is primarily my personal learning repository, feel free to:

• Open issues for bugs or better solutions
• Suggest improvements to explanations
• Share alternative approaches
• Start discussions for fluid and open conversation
• Fix typos or formatting issues
• Add more templates for different languages or problem types
• Contribute additional test cases or examples

Getting Started

To clone this repository:

git clone https://github.com/aditya-2k23/leetcode.git
cd leetcode

License

This project is licensed under the MIT License. See the LICENSE file for details.

Connect With Me

• LinkedIn: /in/aditya-2k23
• X(Twitter): Tema_roon
• GitHub: aditya-2k23
• Email: [email protected]

---

⭐ Star this repository if you find it helpful!

Happy coding! 🚀

Last updated: June 7, 2025