This repository contains solutions to various LeetCode problems. Each problem is organized in its own folder and includes a solution file. The goal of this repository is to provide clean, efficient, and well-documented solutions for learning and practice purposes.

leetcode-solutions/  
├── 1-two-sum/  
│   ├── README.md       # Description of the problem  
│   └── solution.js     # Solution to the problem  
├── 26-remove-duplicates-from-sorted-array/  
├── 27-remove-element/  
├── 28-find-the-index-of-the-first-occurrence-in-a-string/  
├── 35-search-insert-position/  
├── 58-length-of-last-word/  
├── 66-plus-one/  
├── 67-add-binary/  
├── 69-sqrt(x)/  
├── 9-palindrome-number/  
└── README.md           # Overview of the repository  

Each problem folder includes:

• README.md: A description of the problem, including its prompt and any necessary examples.
• solution.js: The solution to the problem, written in JavaScript.

1. Clone the repository:

   git clone https://github.com/your-username/leetcode-solutions.git  

2. Navigate to a problem folder:

   cd leetcode-solutions/1-two-sum  

3. Review the problem and solution:
   • Read the README.md file for the problem description.
   • Open the solution.js file to view the code.

• Your Name
• GitHub

This repository is licensed under the MIT License.

• Thanks to LeetCode for providing the problems and platform.
• Inspiration from the competitive programming community.