Leetcode Solutions

This repository contains solutions to various Leetcode problems. Each solution is organized in its own directory with a detailed explanation and code implementation.

📂 Directory Structure

• 0011-container-with-most-water/

  • README.md - Explanation and solution for "Container With Most Water"
  • solution.cpp - C++ solution
  • solution.py - Python solution (if available)

• 0013-roman-to-integer/

  • README.md - Explanation and solution for "Roman to Integer"
  • solution.cpp - C++ solution
  • solution.py - Python solution (if available)

• 0021-merge-two-sorted-lists/

  • README.md - Explanation and solution for "Merge Two Sorted Lists"
  • solution.cpp - C++ solution
  • solution.py - Python solution (if available)

🚀 How to Use

1. Clone the repository:

   git clone https://github.com/ShashwatPathak-01/Leetcode.git
   cd Leetcode

2. Navigate to a problem directory:

   cd 0011-container-with-most-water

3. Run the solution:

   • For C++:

     g++ solution.cpp -o solution
     ./solution

   • For Python:

     python solution.py

🛠 Technologies Used

• C++
• Python

📢 Contributing

Feel free to fork this repository and submit pull requests if you’d like to improve the solutions or add new ones!