LeetCode Questions Repository

Welcome to the LeetCode Questions Repository! This repository contains a comprehensive collection of solutions to various LeetCode problems, covering a wide range of data structures and algorithms. Whether you're preparing for technical interviews or looking to enhance your coding skills, this repository provides a valuable resource.

Table of Contents

• Introduction
• Directory Structure
• Content Overview
• How to Use
• Contributing
• License
• Contact

Introduction

This repository contains solutions to LeetCode problems organized by topic. It includes solutions for various data structures and algorithms, including but not limited to trees, binary search, graphs, and dynamic programming. Each solution is implemented in Python and follows best practices for readability and efficiency.

Directory Structure

The repository is organized into directories based on problem categories:

LeetCode-Solutions/
│
├── Trees/
│   ├── binary_search_tree.py
│   ├── binary_tree.py
│   ├── trees
│   ├── Level Order traversals
|   ├── BFS
|   ├── DFS
|   └── ...
|
├── Graphs/
│   ├── graph_traversal.py
│   ├── shortest_path.py
│   ├── Traversals
│   ├── DFS, BFS
|   ├── Cycles Detection
|   ├── Topological Sortings
|   └── ...
|   
├── Stacks/
│   ├── stack_implementation.py
│   └── ...
│
├── HashMaps/
│   ├── hashmap_operations.py
│   └── ...
│
├── BinarySearch/
│   ├── binary_search_algorithms.py
│   └── ...
│
├── Lists/
│   ├── list_operations.py
│   └── ...
│
├── Sets/
│   ├── set_operations.py
│   └── ...
│
├── Dictionaries/
│   ├── dictionary_operations.py
│   └── ...
│
├── Tries/
│   ├── trie_operations.py
│   └── ...
│
├── TwoPointers/
│   ├── two_pointer_techniques.py
│   └── ...
│
├── LinkedList/
│   ├── singly_linked_list.py
│   ├── doubly_linked_list.py
│   └── ...
│
├── DynamicProgramming/
│   ├── dp_problems.py
│   └── ...
│
└── README.md

Content Overview

• Trees: Solutions related to tree data structures, including binary trees and binary search trees (BST).
• Graphs: Solutions for graph problems, including traversal algorithms and shortest path algorithms.
• Stacks: Implementation and problems related to stack data structures.
• HashMaps: Problems involving hash maps, including operations and common use cases.
• BinarySearch: Problems and algorithms involving binary search techniques.
• Lists: Operations and problems related to list data structures.
• Sets: Solutions for set operations and problems.
• Dictionaries: Operations and problems related to dictionaries.
• Tries: Solutions for problems involving trie data structures.
• TwoPointers: Problems solved using the two pointers technique.
• LinkedList: Solutions for singly and doubly linked lists, including various operations and algorithms.
• DynamicProgramming: Problems and solutions involving dynamic programming techniques.

How to Use

1. Clone the Repository:

   git clone https://github.com/your-username/LeetCode-Solutions.git

2. Navigate to a Directory:

   cd LeetCode-Solutions/Trees

3. Run a Solution:

   Make sure you have Python installed. You can run a Python script using:

   python binary_search_tree.py

4. Add New Solutions:

   • Create a new file in the appropriate directory.
   • Implement your solution and test it.
   • Commit your changes with a descriptive message.

Contributing

Contributions are welcome! If you have solutions to add or improvements to suggest, please follow these steps:

1. Fork the repository.
2. Create a new branch (git checkout -b feature/your-feature).
3. Make your changes.
4. Commit your changes (git commit -am 'Add new feature').
5. Push to the branch (git push origin feature/your-feature).
6. Open a Pull Request.

License

This repository is licensed under the MIT License. See the LICENSE file for more information.

Contact

If you have any questions or feedback, feel free to reach out to me at sktfscm21557034@gmail.com.