LEETCODE-SOLUTIONS

Leet Code Profile

►Solutions for random leetcode problems

Table of Contents

• Overview
• Repository Structure
• Modules
• Contributing
• Acknowledgments

---

Overview

► Solutions for random leetcode problems written by me

---

Repository Structure

└── leetcode-solutions/
    ├── 1-two-sum
    │   ├── README.md
    │   └── two-sum.cpp
    ├── 100-same-tree
    │   ├── README.md
    │   └── same-tree.cpp
    ├── 1013-fibonacci-number
    │   ├── README.md
    │   └── fibonacci-number.cpp
    ├── 1137-height-checker
    │   ├── README.md
    │   └── height-checker.cpp
    ├── 1217-relative-sort-array
    │   ├── README.md
    │   └── relative-sort-array.cpp
    ├── 1878-check-if-array-is-sorted-and-rotated
    │   ├── README.md
    │   └── check-if-array-is-sorted-and-rotated.cpp
    ├── 1938-minimum-operations-to-make-the-array-increasing
    │   ├── README.md
    │   └── minimum-operations-to-make-the-array-increasing.cpp
    ├── 1970-sorting-the-sentence
    │   ├── README.md
    │   └── sorting-the-sentence.cpp
    ├── 198-house-robber
    │   ├── README.md
    │   └── house-robber.cpp
    ├── 2148-minimum-number-of-moves-to-seat-everyone
    │   ├── README.md
    │   └── minimum-number-of-moves-to-seat-everyone.cpp
    ├── 330-patching-array
    │   ├── README.md
    │   └── patching-array.cpp
    ├── 3396-valid-word
    │   ├── README.md
    │   └── valid-word.cpp
    ├── 383-ransom-note
    │   ├── README.md
    │   └── ransom-note.cpp
    ├── 502-ipo
    │   ├── README.md
    │   └── ipo.cpp
    ├── 633-sum-of-square-numbers
    │   ├── README.md
    │   └── sum-of-square-numbers.cpp
    ├── 75-sort-colors
    │   ├── README.md
    │   └── sort-colors.cpp
    ├── 77-combinations
    │   ├── README.md
    │   └── combinations.cpp
    ├── 932-monotonic-array
    │   ├── README.md
    │   └── monotonic-array.cpp
    └── 982-minimum-increment-to-make-array-unique
        ├── README.md
        └── minimum-increment-to-make-array-unique.cpp

---

Modules

1878-check-if-array-is-sorted-and-rotated

File	Summary
check-if-array-is-sorted-and-rotated.cpp	► INSERT-TEXT-HERE

1137-height-checker

File	Summary
height-checker.cpp	► INSERT-TEXT-HERE

198-house-robber

File	Summary
house-robber.cpp	► INSERT-TEXT-HERE

982-minimum-increment-to-make-array-unique

File	Summary
minimum-increment-to-make-array-unique.cpp	► INSERT-TEXT-HERE

1-two-sum

File	Summary
two-sum.cpp	► INSERT-TEXT-HERE

1970-sorting-the-sentence

File	Summary
sorting-the-sentence.cpp	► INSERT-TEXT-HERE

1013-fibonacci-number

File	Summary
fibonacci-number.cpp	► INSERT-TEXT-HERE

3396-valid-word

File	Summary
valid-word.cpp	► INSERT-TEXT-HERE

1938-minimum-operations-to-make-the-array-increasing

File	Summary
minimum-operations-to-make-the-array-increasing.cpp	► INSERT-TEXT-HERE

77-combinations

File	Summary
combinations.cpp	► INSERT-TEXT-HERE

383-ransom-note

File	Summary
ransom-note.cpp	► INSERT-TEXT-HERE

2148-minimum-number-of-moves-to-seat-everyone

File	Summary
minimum-number-of-moves-to-seat-everyone.cpp	► INSERT-TEXT-HERE

932-monotonic-array

File	Summary
monotonic-array.cpp	► INSERT-TEXT-HERE

1217-relative-sort-array

File	Summary
relative-sort-array.cpp	► INSERT-TEXT-HERE

75-sort-colors

File	Summary
sort-colors.cpp	► INSERT-TEXT-HERE

502-ipo

File	Summary
ipo.cpp	► INSERT-TEXT-HERE

100-same-tree

File	Summary
same-tree.cpp	► INSERT-TEXT-HERE

633-sum-of-square-numbers

File	Summary
sum-of-square-numbers.cpp	► INSERT-TEXT-HERE

330-patching-array

File	Summary
patching-array.cpp	► INSERT-TEXT-HERE

---

Contributing

Contributions are welcome! Here are several ways you can contribute:

• Report Issues: Submit bugs found or log feature requests for the leetcode-solutions project.
• Submit Pull Requests: Review open PRs, and submit your own PRs.
• Join the Discussions: Share your insights, provide feedback, or ask questions.

Contributing Guidelines

1. Fork the Repository: Start by forking the project repository to your github account.
2. Clone Locally: Clone the forked repository to your local machine using a git client.

   git clone https://github.com/thirt33n/leetcode-solutions

3. Create a New Branch: Always work on a new branch, giving it a descriptive name.

   git checkout -b new-feature-x

4. Make Your Changes: Develop and test your changes locally.
5. Commit Your Changes: Commit with a clear message describing your updates.

   git commit -m 'Implemented new feature x.'

6. Push to github: Push the changes to your forked repository.

   git push origin new-feature-x

7. Submit a Pull Request: Create a PR against the original project repository. Clearly describe the changes and their motivations.
8. Review: Once your PR is reviewed and approved, it will be merged into the main branch. Congratulations on your contribution!

Contributor Graph

---

Acknowledgments

• LeetSync for automatically pushing new code into this repo.
• ReadmeAI auto generating this README file.

Return

---