https://github.com/vaibhavpal7549/leetcode

This repository contains my solutions to various **LeetCode problems** written in **Java**, categorized by difficulty (Easy, Medium, Hard) and topics like Arrays, Strings, Trees, and more. Each solution is clean, optimized, and well-documented. Follow my progress on [LeetCode](https://www.leetcode.com/vaibhavpal7549). Contributions are welcome!
https://github.com/vaibhavpal7549/leetcode

java mysql mysql-database oracle sql sqlite

Last synced: 2 months ago
JSON representation

This repository contains my solutions to various **LeetCode problems** written in **Java**, categorized by difficulty (Easy, Medium, Hard) and topics like Arrays, Strings, Trees, and more. Each solution is clean, optimized, and well-documented. Follow my progress on [LeetCode](https://www.leetcode.com/vaibhavpal7549). Contributions are welcome!

• Host: GitHub
• URL: https://github.com/vaibhavpal7549/leetcode
• Owner: vaibhavpal7549
• License: mit
• Created: 2024-09-07T20:30:53.000Z (almost 2 years ago)
• Default Branch: main
• Last Pushed: 2026-04-04T19:32:39.000Z (3 months ago)
• Last Synced: 2026-04-04T21:57:59.094Z (3 months ago)
• Topics: java, mysql, mysql-database, oracle, sql, sqlite
• Language: Java
• Homepage: https://github.com/vaibhavpal7549/Leetcode
• Size: 397 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# Leetcode  

This repository contains all my solutions to various **LeetCode problems**, written in **Java**. It is a collection of problems I have solved during my **DSA (Data Structures and Algorithms)** journey, categorized by difficulty and topic.  

---

## ✅ LeetCode Topics (Index)

A topic-wise index of solved problems (similar to the format in the provided image). Links point to the solution folder in this repo and to the original LeetCode problem.

> Note: GitHub API listing is paginated; if you feel any solved problem is missing from this index, tell me and I’ll regenerate it.

### Array

- [1 Two Sum](./1-two-sum) — [LeetCode](https://leetcode.com/problems/two-sum/)

- [11 Container With Most Water](./11-container-with-most-water) — [LeetCode](https://leetcode.com/problems/container-with-most-water/)

- [15 3Sum](./15-3sum) — [LeetCode](https://leetcode.com/problems/3sum/)

- [26 Remove Duplicates from Sorted Array](./26-remove-duplicates-from-sorted-array) — [LeetCode](https://leetcode.com/problems/remove-duplicates-from-sorted-array/)

- [27 Remove Element](./27-remove-element) — [LeetCode](https://leetcode.com/problems/remove-element/)

- [33 Search in Rotated Sorted Array](./33-search-in-rotated-sorted-array) — [LeetCode](https://leetcode.com/problems/search-in-rotated-sorted-array/)

- [34 Find First and Last Position of Element in Sorted Array](./34-find-first-and-last-position-of-element-in-sorted-array) — [LeetCode](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/)

- [35 Search Insert Position](./35-search-insert-position) — [LeetCode](https://leetcode.com/problems/search-insert-position/)

- [53 Maximum Subarray](./53-maximum-subarray) — [LeetCode](https://leetcode.com/problems/maximum-subarray/)

- [54 Spiral Matrix](./54-spiral-matrix) — [LeetCode](https://leetcode.com/problems/spiral-matrix/)

- [66 Plus One](./66-plus-one) — [LeetCode](https://leetcode.com/problems/plus-one/)

- [74 Search a 2D Matrix](./74-search-a-2d-matrix) — [LeetCode](https://leetcode.com/problems/search-a-2d-matrix/)

- [75 Sort Colors](./75-sort-colors) — [LeetCode](https://leetcode.com/problems/sort-colors/)

- [88 Merge Sorted Array](./88-merge-sorted-array) — [LeetCode](https://leetcode.com/problems/merge-sorted-array/)

- [121 Best Time to Buy and Sell Stock](./121-best-time-to-buy-and-sell-stock) — [LeetCode](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)

- [167 Two Sum II - Input Array Is Sorted](./167-two-sum-ii-input-array-is-sorted) — [LeetCode](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/)

- [169 Majority Element](./169-majority-element) — [LeetCode](https://leetcode.com/problems/majority-element/)

- [189 Rotate Array](./189-rotate-array) — [LeetCode](https://leetcode.com/problems/rotate-array/)

- [217 Contains Duplicate](./217-contains-duplicate) — [LeetCode](https://leetcode.com/problems/contains-duplicate/)

- [219 Contains Duplicate II](./219-contains-duplicate-ii) — [LeetCode](https://leetcode.com/problems/contains-duplicate-ii/)

- [283 Move Zeroes](./283-move-zeroes) — [LeetCode](https://leetcode.com/problems/move-zeroes/)

- [349 Intersection of Two Arrays](./349-intersection-of-two-arrays) — [LeetCode](https://leetcode.com/problems/intersection-of-two-arrays/)

- [941 Sort Array By Parity](./941-sort-array-by-parity) — [LeetCode](https://leetcode.com/problems/sort-array-by-parity/)

- [932 Monotonic Array](./932-monotonic-array) — [LeetCode](https://leetcode.com/problems/monotonic-array/)

- [958 Sort Array By Parity II](./958-sort-array-by-parity-ii) — [LeetCode](https://leetcode.com/problems/sort-array-by-parity-ii/)

- [1677 Matrix Diagonal Sum](./1677-matrix-diagonal-sum) — [LeetCode](https://leetcode.com/problems/matrix-diagonal-sum/)

- [1848 Sum of Unique Elements](./1848-sum-of-unique-elements) — [LeetCode](https://leetcode.com/problems/sum-of-unique-elements/)

- [1878 Check if Array Is Sorted and Rotated](./1878-check-if-array-is-sorted-and-rotated) — [LeetCode](https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/)

- [2058 Concatenation of Array](./2058-concatenation-of-array) — [LeetCode](https://leetcode.com/problems/concatenation-of-array/)

- [2106 Find Greatest Common Divisor of Array](./2106-find-greatest-common-divisor-of-array) — [LeetCode](https://leetcode.com/problems/find-greatest-common-divisor-of-array/)

- [2212 Removing Minimum and Maximum From Array](./2212-removing-minimum-and-maximum-from-array) — [LeetCode](https://leetcode.com/problems/removing-minimum-and-maximum-from-array/)

- [2270 Find All Lonely Numbers in the Array](./2270-find-all-lonely-numbers-in-the-array) — [LeetCode](https://leetcode.com/problems/find-all-lonely-numbers-in-the-array/)

- [2277 Count Equal and Divisible Pairs in an Array](./2277-count-equal-and-divisible-pairs-in-an-array) — [LeetCode](https://leetcode.com/problems/count-equal-and-divisible-pairs-in-an-array/)

- [2552 Maximum Sum of Distinct Subarrays With Length K](./2552-maximum-sum-of-distinct-subarrays-with-length-k) — [LeetCode](https://leetcode.com/problems/maximum-sum-of-distinct-subarrays-with-length-k/)

- [2608 Count the Digits That Divide a Number](./2608-count-the-digits-that-divide-a-number) — [LeetCode](https://leetcode.com/problems/count-the-digits-that-divide-a-number/)

- [2737 Row With Maximum Ones](./2737-row-with-maximum-ones) — [LeetCode](https://leetcode.com/problems/row-with-maximum-ones/)

- [3152 Maximum Value of an Ordered Triplet II](./3152-maximum-value-of-an-ordered-triplet-ii) — [LeetCode](https://leetcode.com/problems/maximum-value-of-an-ordered-triplet-ii/)

- [3154 Maximum Value of an Ordered Triplet I](./3154-maximum-value-of-an-ordered-triplet-i) — [LeetCode](https://leetcode.com/problems/maximum-value-of-an-ordered-triplet-i/)

- [3394 Minimum Array End](./3394-minimum-array-end) — [LeetCode](https://leetcode.com/problems/minimum-array-end/)

- [3429 Special Array I](./3429-special-array-i) — [LeetCode](https://leetcode.com/problems/special-array-i/)

- [3605 Construct the Minimum Bitwise Array I](./3605-construct-the-minimum-bitwise-array-i) — [LeetCode](https://leetcode.com/problems/construct-the-minimum-bitwise-array-i/)

### String

- [6 Zigzag Conversion](./6-zigzag-conversion) — [LeetCode](https://leetcode.com/problems/zigzag-conversion/)

- [13 Roman to Integer](./13-roman-to-integer) — [LeetCode](https://leetcode.com/problems/roman-to-integer/)

- [14 Longest Common Prefix](./14-longest-common-prefix) — [LeetCode](https://leetcode.com/problems/longest-common-prefix/)

- [28 Find the Index of the First Occurrence in a String](./28-find-the-index-of-the-first-occurrence-in-a-string) — [LeetCode](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/)

- [38 Count and Say](./38-count-and-say) — [LeetCode](https://leetcode.com/problems/count-and-say/)

- [58 Length of Last Word](./58-length-of-last-word) — [LeetCode](https://leetcode.com/problems/length-of-last-word/)

- [67 Add Binary](./67-add-binary) — [LeetCode](https://leetcode.com/problems/add-binary/)

- [125 Valid Palindrome](./125-valid-palindrome) — [LeetCode](https://leetcode.com/problems/valid-palindrome/)

- [151 Reverse Words in a String](./151-reverse-words-in-a-string) — [LeetCode](https://leetcode.com/problems/reverse-words-in-a-string/)

- [344 Reverse String](./344-reverse-string) — [LeetCode](https://leetcode.com/problems/reverse-string/)

- [345 Reverse Vowels of a String](./345-reverse-vowels-of-a-string) — [LeetCode](https://leetcode.com/problems/reverse-vowels-of-a-string/)

- [387 First Unique Character in a String](./387-first-unique-character-in-a-string) — [LeetCode](https://leetcode.com/problems/first-unique-character-in-a-string/)

- [394 Decode String](./394-decode-string) — [LeetCode](https://leetcode.com/problems/decode-string/)

- [415 Add Strings](./415-add-strings) — [LeetCode](https://leetcode.com/problems/add-strings/)

- [957 Minimum Add to Make Parentheses Valid](./957-minimum-add-to-make-parentheses-valid) — [LeetCode](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/)

- [1341 Split a String in Balanced Strings](./1341-split-a-string-in-balanced-strings) — [LeetCode](https://leetcode.com/problems/split-a-string-in-balanced-strings/)

- [1987 Substrings of Size Three With Distinct Characters](./1987-substrings-of-size-three-with-distinct-characters) — [LeetCode](https://leetcode.com/problems/substrings-of-size-three-with-distinct-characters/)

- [2654 Count the Number of Vowel Strings in Range](./2654-count-the-number-of-vowel-strings-in-range) — [LeetCode](https://leetcode.com/problems/count-the-number-of-vowel-strings-in-range/)

### Linked List

- [83 Remove Duplicates from Sorted List](./83-remove-duplicates-from-sorted-list) — [LeetCode](https://leetcode.com/problems/remove-duplicates-from-sorted-list/)

- [141 Linked List Cycle](./141-linked-list-cycle) — [LeetCode](https://leetcode.com/problems/linked-list-cycle/)

- [160 Intersection of Two Linked Lists](./160-intersection-of-two-linked-lists) — [LeetCode](https://leetcode.com/problems/intersection-of-two-linked-lists/)

- [203 Remove Linked List Elements](./203-remove-linked-list-elements) — [LeetCode](https://leetcode.com/problems/remove-linked-list-elements/)

- [206 Reverse Linked List](./206-reverse-linked-list) — [LeetCode](https://leetcode.com/problems/reverse-linked-list/)

- [234 Palindrome Linked List](./234-palindrome-linked-list) — [LeetCode](https://leetcode.com/problems/palindrome-linked-list/)

- [908 Middle of the Linked List](./908-middle-of-the-linked-list) — [LeetCode](https://leetcode.com/problems/middle-of-the-linked-list/)

### Tree

- [94 Binary Tree Inorder Traversal](./94-binary-tree-inorder-traversal) — [LeetCode](https://leetcode.com/problems/binary-tree-inorder-traversal/)

- [98 Validate Binary Search Tree](./98-validate-binary-search-tree) — [LeetCode](https://leetcode.com/problems/validate-binary-search-tree/)

- [104 Maximum Depth of Binary Tree](./104-maximum-depth-of-binary-tree) — [LeetCode](https://leetcode.com/problems/maximum-depth-of-binary-tree/)

- [113 Path Sum II](./113-path-sum-ii) — [LeetCode](https://leetcode.com/problems/path-sum-ii/)

- [144 Binary Tree Preorder Traversal](./144-binary-tree-preorder-traversal) — [LeetCode](https://leetcode.com/problems/binary-tree-preorder-traversal/)

- [145 Binary Tree Postorder Traversal](./145-binary-tree-postorder-traversal) — [LeetCode](https://leetcode.com/problems/binary-tree-postorder-traversal/)

- [222 Count Complete Tree Nodes](./222-count-complete-tree-nodes) — [LeetCode](https://leetcode.com/problems/count-complete-tree-nodes/)

- [1005 Univalued Binary Tree](./1005-univalued-binary-tree) — [LeetCode](https://leetcode.com/problems/univalued-binary-tree/)

- [1285 Balance a Binary Search Tree](./1285-balance-a-binary-search-tree) — [LeetCode](https://leetcode.com/problems/balance-a-binary-search-tree/)

### Stack

- [20 Valid Parentheses](./20-valid-parentheses) — [LeetCode](https://leetcode.com/problems/valid-parentheses/)

- [150 Evaluate Reverse Polish Notation](./150-evaluate-reverse-polish-notation) — [LeetCode](https://leetcode.com/problems/evaluate-reverse-polish-notation/)

### Backtracking

- [22 Generate Parentheses](./22-generate-parentheses) — [LeetCode](https://leetcode.com/problems/generate-parentheses/)

- [52 N-Queens II](./52-n-queens-ii) — [LeetCode](https://leetcode.com/problems/n-queens-ii/)

- [78 Subsets](./78-subsets) — [LeetCode](https://leetcode.com/problems/subsets/)

### Binary Search

- [162 Find Peak Element](./162-find-peak-element) — [LeetCode](https://leetcode.com/problems/find-peak-element/)

- [410 Split Array Largest Sum](./410-split-array-largest-sum) — [LeetCode](https://leetcode.com/problems/split-array-largest-sum/)

- [792 Binary Search](./792-binary-search) — [LeetCode](https://leetcode.com/problems/binary-search/)

- [1056 Capacity To Ship Packages Within D Days](./1056-capacity-to-ship-packages-within-d-days) — [LeetCode](https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/)

### Dynamic Programming

- [70 Climbing Stairs](./70-climbing-stairs) — [LeetCode](https://leetcode.com/problems/climbing-stairs/)

- [416 Partition Equal Subset Sum](./416-partition-equal-subset-sum) — [LeetCode](https://leetcode.com/problems/partition-equal-subset-sum/)

### Math / Bit Manipulation

- [7 Reverse Integer](./7-reverse-integer) — [LeetCode](https://leetcode.com/problems/reverse-integer/)

- [69 Sqrt(x)](./69-sqrtx) — [LeetCode](https://leetcode.com/problems/sqrtx/)

- [136 Single Number](./136-single-number) — [LeetCode](https://leetcode.com/problems/single-number/)

- [171 Excel Sheet Column Number](./171-excel-sheet-column-number) — [LeetCode](https://leetcode.com/problems/excel-sheet-column-number/)

- [190 Reverse Bits](./190-reverse-bits) — [LeetCode](https://leetcode.com/problems/reverse-bits/)

- [191 Number of 1 Bits](./191-number-of-1-bits) — [LeetCode](https://leetcode.com/problems/number-of-1-bits/)

- [202 Happy Number](./202-happy-number) — [LeetCode](https://leetcode.com/problems/happy-number/)

- [204 Count Primes](./204-count-primes) — [LeetCode](https://leetcode.com/problems/count-primes/)

- [231 Power of Two](./231-power-of-two) — [LeetCode](https://leetcode.com/problems/power-of-two/)

- [258 Add Digits](./258-add-digits) — [LeetCode](https://leetcode.com/problems/add-digits/)

- [319 Bulb Switcher](./319-bulb-switcher) — [LeetCode](https://leetcode.com/problems/bulb-switcher/)

- [326 Power of Three](./326-power-of-three) — [LeetCode](https://leetcode.com/problems/power-of-three/)

- [338 Counting Bits](./338-counting-bits) — [LeetCode](https://leetcode.com/problems/counting-bits/)

- [342 Power of Four](./342-power-of-four) — [LeetCode](https://leetcode.com/problems/power-of-four/)

- [371 Sum of Two Integers](./371-sum-of-two-integers) — [LeetCode](https://leetcode.com/problems/sum-of-two-integers/)

- [507 Perfect Number](./507-perfect-number) — [LeetCode](https://leetcode.com/problems/perfect-number/)

- [575 Distribute Candies](./575-distribute-candies) — [LeetCode](https://leetcode.com/problems/distribute-candies/)

- [628 Maximum Product of Three Numbers](./628-maximum-product-of-three-numbers) — [LeetCode](https://leetcode.com/problems/maximum-product-of-three-numbers/)

- [633 Sum of Square Numbers](./633-sum-of-square-numbers) — [LeetCode](https://leetcode.com/problems/sum-of-square-numbers/)

- [643 Maximum Average Subarray I](./643-maximum-average-subarray-i) — [LeetCode](https://leetcode.com/problems/maximum-average-subarray-i/)

- [1064 Smallest Integer Divisible by K](./1064-smallest-integer-divisible-by-k) — [LeetCode](https://leetcode.com/problems/smallest-integer-divisible-by-k/)

- [1421 Find Numbers With Even Number of Digits](./1421-find-numbers-with-even-number-of-digits) — [LeetCode](https://leetcode.com/problems/find-numbers-with-even-number-of-digits/)

- [1477 Product of the Last K Numbers](./1477-product-of-the-last-k-numbers) — [LeetCode](https://leetcode.com/problems/product-of-the-last-k-numbers/)

- [1626 Can Make Arithmetic Progression From Sequence](./1626-can-make-arithmetic-progression-from-sequence/) — [LeetCode](https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/)

- [2383 Add Two Integers](./2383-add-two-integers) — [LeetCode](https://leetcode.com/problems/add-two-integers/)

- [2481 Strictly Palindromic Number](./2481-strictly-palindromic-number) — [LeetCode](https://leetcode.com/problems/strictly-palindromic-number/)

- [3279 Alice and Bob Playing Flower Game](./3279-alice-and-bob-playing-flower-game) — [LeetCode](https://leetcode.com/problems/alice-and-bob-playing-flower-game/)

- [3321 Type of Triangle](./3321-type-of-triangle) — [LeetCode](https://leetcode.com/problems/type-of-triangle/)

### Greedy

- [455 Assign Cookies](./455-assign-cookies) — [LeetCode](https://leetcode.com/problems/assign-cookies/)

### Two Pointers / Sliding Window

- [643 Maximum Average Subarray I](./643-maximum-average-subarray-i) — [LeetCode](https://leetcode.com/problems/maximum-average-subarray-i/)

### SQL

- [584 Find Customer Referee](./584-find-customer-referee) — [LeetCode](https://leetcode.com/problems/find-customer-referee/)

- [595 Big Countries](./595-big-countries) — [LeetCode](https://leetcode.com/problems/big-countries/)

- [1153 Product Sales Analysis I](./1153-product-sales-analysis-i) — [LeetCode](https://leetcode.com/problems/product-sales-analysis-i/)

- [1258 Article Views I](./1258-article-views-i) — [LeetCode](https://leetcode.com/problems/article-views-i/)

- [1509 Replace Employee ID With the Unique Identifier](./1509-replace-employee-id-with-the-unique-identifier) — [LeetCode](https://leetcode.com/problems/replace-employee-id-with-the-unique-identifier/)

- [1827 Invalid Tweets](./1827-invalid-tweets) — [LeetCode](https://leetcode.com/problems/invalid-tweets/)

- [1908 Recyclable and Low Fat Products](./1908-recyclable-and-low-fat-products) — [LeetCode](https://leetcode.com/problems/recyclable-and-low-fat-products/)

---

## 🚀 About the Repository  

The aim of this repository is to:  

- Document my LeetCode problem-solving progress.  

- Serve as a reference for anyone looking for solutions or explanations for similar problems.  

- Improve coding and problem-solving skills by working on a variety of challenges.  

---

## 📂 Folder Structure  

The repository is organized into folders based on:  

1. **Difficulty**:  

   - Easy  

   - Medium  

   - Hard  

2. **Topics**:  

   - Arrays  

   - Strings  

   - Linked Lists  

   - Trees  

   - Graphs  

   - Dynamic Programming (DP)  

   - Backtracking  

   - Sorting and Searching  

Each folder contains files named according to the problem title or LeetCode problem number for easy identification.

---

## 🛠️ Tools and Technologies  

- **Language**: Java  

- **Platform**: [LeetCode](https://leetcode.com/vaibhavpal7549)  

---

## 🔍 Features  

- Clean, readable, and well-commented code for better understanding.  

- Optimized solutions whenever possible, along with explanations of the logic.  

- Categorized problems for quick access.  

---

## 📌 How to Use  

1. Clone the repository:  

   ```bash  

   git clone https://github.com/vaibhavpal7549/Leetcode.git  

   ```  

2. Navigate to the folder of the desired topic or difficulty.  

3. Open the solution file in your favorite IDE to run or study it.  

---

## 📈 Progress Tracker  

You can follow my LeetCode journey:  

- **LeetCode Profile**: [vaibhavpal7549](https://www.leetcode.com/vaibhavpal7549)  

---

## 🤝 Contributions  

Contributions are welcome! If you’ve got a better or alternative solution, feel free to contribute:  

1. Fork the repository.  

2. Create a new branch:  

   ```bash  

   git checkout -b feature-name  

   ```  

3. Make your changes and commit them:  

   ```bash  

   git commit -m "Description of changes"  

   ```  

4. Push to your forked repository and create a pull request.  

---

## 📞 Contact  

If you have questions, suggestions, or feedback, feel free to reach out:  

- **Email**: [vaibhavpal.info@gmail.com](mailto:vaibhavpal.info@gmail.com)  

- **LinkedIn**: [vaibhavpal7549](https://www.linkedin.com/in/vaibhavpal7549)  

---

## 🌍 Acknowledgment  

I would like to thank the **LeetCode community** for their constant motivation and for providing a platform to enhance problem-solving skills.  

---

## License  

This project is licensed under the MIT License - see the [LICENSE](LICENSE) file for details.

## LeetCode Topics

> This section is auto-generated on every push to `main`.

### Array

- [0001-two-sum](./1-two-sum) — [LeetCode](https://leetcode.com/problems/two-sum/)

- [0015-3sum](./15-3sum) — [LeetCode](https://leetcode.com/problems/3sum/)

- [0026-remove-duplicates-from-sorted-array](./26-remove-duplicates-from-sorted-array) — [LeetCode](https://leetcode.com/problems/remove-duplicates-from-sorted-array/)

- [0033-search-in-rotated-sorted-array](./33-search-in-rotated-sorted-array) — [LeetCode](https://leetcode.com/problems/search-in-rotated-sorted-array/)

- [0034-find-first-and-last-position-of-element-in-sorted-array](./34-find-first-and-last-position-of-element-in-sorted-array) — [LeetCode](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/)

- [0053-maximum-subarray](./53-maximum-subarray) — [LeetCode](https://leetcode.com/problems/maximum-subarray/)

- [0054-spiral-matrix](./54-spiral-matrix) — [LeetCode](https://leetcode.com/problems/spiral-matrix/)

- [0074-search-a-2d-matrix](./74-search-a-2d-matrix) — [LeetCode](https://leetcode.com/problems/search-a-2d-matrix/)

- [0088-merge-sorted-array](./88-merge-sorted-array) — [LeetCode](https://leetcode.com/problems/merge-sorted-array/)

- [0167-two-sum-ii-input-array-is-sorted](./167-two-sum-ii-input-array-is-sorted) — [LeetCode](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/)

- [0189-rotate-array](./189-rotate-array) — [LeetCode](https://leetcode.com/problems/rotate-array/)

- [0215-kth-largest-element-in-an-array](./215-kth-largest-element-in-an-array) — [LeetCode](https://leetcode.com/problems/kth-largest-element-in-an-array/)

- [0238-product-of-array-except-self](./238-product-of-array-except-self) — [LeetCode](https://leetcode.com/problems/product-of-array-except-self/)

- [0349-intersection-of-two-arrays](./349-intersection-of-two-arrays) — [LeetCode](https://leetcode.com/problems/intersection-of-two-arrays/)

- [0410-split-array-largest-sum](./410-split-array-largest-sum) — [LeetCode](https://leetcode.com/problems/split-array-largest-sum/)

- [0643-maximum-average-subarray-i](./643-maximum-average-subarray-i) — [LeetCode](https://leetcode.com/problems/maximum-average-subarray-i/)

- [0932-monotonic-array](./932-monotonic-array) — [LeetCode](https://leetcode.com/problems/monotonic-array/)

- [0941-sort-array-by-parity](./941-sort-array-by-parity) — [LeetCode](https://leetcode.com/problems/sort-array-by-parity/)

- [0958-sort-array-by-parity-ii](./958-sort-array-by-parity-ii) — [LeetCode](https://leetcode.com/problems/sort-array-by-parity-ii/)

- [1019-squares-of-a-sorted-array](./1019-squares-of-a-sorted-array) — [LeetCode](https://leetcode.com/problems/squares-of-a-sorted-array/)

- [1677-matrix-diagonal-sum](./1677-matrix-diagonal-sum) — [LeetCode](https://leetcode.com/problems/matrix-diagonal-sum/)

- [1878-check-if-array-is-sorted-and-rotated](./1878-check-if-array-is-sorted-and-rotated) — [LeetCode](https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/)

- [2058-concatenation-of-array](./2058-concatenation-of-array) — [LeetCode](https://leetcode.com/problems/concatenation-of-array/)

- [2106-find-greatest-common-divisor-of-array](./2106-find-greatest-common-divisor-of-array) — [LeetCode](https://leetcode.com/problems/find-greatest-common-divisor-of-array/)

- [2212-removing-minimum-and-maximum-from-array](./2212-removing-minimum-and-maximum-from-array) — [LeetCode](https://leetcode.com/problems/removing-minimum-and-maximum-from-array/)

- [2270-find-all-lonely-numbers-in-the-array](./2270-find-all-lonely-numbers-in-the-array) — [LeetCode](https://leetcode.com/problems/find-all-lonely-numbers-in-the-array/)

- [2277-count-equal-and-divisible-pairs-in-an-array](./2277-count-equal-and-divisible-pairs-in-an-array) — [LeetCode](https://leetcode.com/problems/count-equal-and-divisible-pairs-in-an-array/)

- [2552-maximum-sum-of-distinct-subarrays-with-length-k](./2552-maximum-sum-of-distinct-subarrays-with-length-k) — [LeetCode](https://leetcode.com/problems/maximum-sum-of-distinct-subarrays-with-length-k/)

- [3394-minimum-array-end](./3394-minimum-array-end) — [LeetCode](https://leetcode.com/problems/minimum-array-end/)

- [3429-special-array-i](./3429-special-array-i) — [LeetCode](https://leetcode.com/problems/special-array-i/)

- [3605-construct-the-minimum-bitwise-array-i](./3605-construct-the-minimum-bitwise-array-i) — [LeetCode](https://leetcode.com/problems/construct-the-minimum-bitwise-array-i/)

### Backtracking

- [0052-n-queens-ii](./52-n-queens-ii) — [LeetCode](https://leetcode.com/problems/n-queens-ii/)

- [0078-subsets](./78-subsets) — [LeetCode](https://leetcode.com/problems/subsets/)

### Binary Search

- [0035-search-insert-position](./35-search-insert-position) — [LeetCode](https://leetcode.com/problems/search-insert-position/)

- [0069-sqrtx](./69-sqrtx) — [LeetCode](https://leetcode.com/problems/sqrtx/)

- [0162-find-peak-element](./162-find-peak-element) — [LeetCode](https://leetcode.com/problems/find-peak-element/)

- [0792-binary-search](./792-binary-search) — [LeetCode](https://leetcode.com/problems/binary-search/)

- [1056-capacity-to-ship-packages-within-d-days](./1056-capacity-to-ship-packages-within-d-days) — [LeetCode](https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/)

### Dynamic Programming

- [0070-climbing-stairs](./70-climbing-stairs) — [LeetCode](https://leetcode.com/problems/climbing-stairs/)

- [0416-partition-equal-subset-sum](./416-partition-equal-subset-sum) — [LeetCode](https://leetcode.com/problems/partition-equal-subset-sum/)

### Greedy

- [0455-assign-cookies](./455-assign-cookies) — [LeetCode](https://leetcode.com/problems/assign-cookies/)

### Linked List

- [0141-linked-list-cycle](./141-linked-list-cycle) — [LeetCode](https://leetcode.com/problems/linked-list-cycle/)

- [0160-intersection-of-two-linked-lists](./160-intersection-of-two-linked-lists) — [LeetCode](https://leetcode.com/problems/intersection-of-two-linked-lists/)

- [0203-remove-linked-list-elements](./203-remove-linked-list-elements) — [LeetCode](https://leetcode.com/problems/remove-linked-list-elements/)

- [0206-reverse-linked-list](./206-reverse-linked-list) — [LeetCode](https://leetcode.com/problems/reverse-linked-list/)

- [0908-middle-of-the-linked-list](./908-middle-of-the-linked-list) — [LeetCode](https://leetcode.com/problems/middle-of-the-linked-list/)

### Math / Bit

- [0190-reverse-bits](./190-reverse-bits) — [LeetCode](https://leetcode.com/problems/reverse-bits/)

- [0191-number-of-1-bits](./191-number-of-1-bits) — [LeetCode](https://leetcode.com/problems/number-of-1-bits/)

- [0231-power-of-two](./231-power-of-two) — [LeetCode](https://leetcode.com/problems/power-of-two/)

- [0258-add-digits](./258-add-digits) — [LeetCode](https://leetcode.com/problems/add-digits/)

- [0326-power-of-three](./326-power-of-three) — [LeetCode](https://leetcode.com/problems/power-of-three/)

- [0338-counting-bits](./338-counting-bits) — [LeetCode](https://leetcode.com/problems/counting-bits/)

- [0342-power-of-four](./342-power-of-four) — [LeetCode](https://leetcode.com/problems/power-of-four/)

- [1421-find-numbers-with-even-number-of-digits](./1421-find-numbers-with-even-number-of-digits) — [LeetCode](https://leetcode.com/problems/find-numbers-with-even-number-of-digits/)

- [2608-count-the-digits-that-divide-a-number](./2608-count-the-digits-that-divide-a-number) — [LeetCode](https://leetcode.com/problems/count-the-digits-that-divide-a-number/)

### Other

- [0007-reverse-integer](./7-reverse-integer) — [LeetCode](https://leetcode.com/problems/reverse-integer/)

- [0011-container-with-most-water](./11-container-with-most-water) — [LeetCode](https://leetcode.com/problems/container-with-most-water/)

- [0021-merge-two-sorted-lists](./21-merge-two-sorted-lists) — [LeetCode](https://leetcode.com/problems/merge-two-sorted-lists/)

- [0023-merge-k-sorted-lists](./23-merge-k-sorted-lists) — [LeetCode](https://leetcode.com/problems/merge-k-sorted-lists/)

- [0024-swap-nodes-in-pairs](./24-swap-nodes-in-pairs) — [LeetCode](https://leetcode.com/problems/swap-nodes-in-pairs/)

- [0027-remove-element](./27-remove-element) — [LeetCode](https://leetcode.com/problems/remove-element/)

- [0038-count-and-say](./38-count-and-say) — [LeetCode](https://leetcode.com/problems/count-and-say/)

- [0042-trapping-rain-water](./42-trapping-rain-water) — [LeetCode](https://leetcode.com/problems/trapping-rain-water/)

- [0050-powx-n](./50-powx-n) — [LeetCode](https://leetcode.com/problems/powx-n/)

- [0058-length-of-last-word](./58-length-of-last-word) — [LeetCode](https://leetcode.com/problems/length-of-last-word/)

- [0066-plus-one](./66-plus-one) — [LeetCode](https://leetcode.com/problems/plus-one/)

- [0067-add-binary](./67-add-binary) — [LeetCode](https://leetcode.com/problems/add-binary/)

- [0075-sort-colors](./75-sort-colors) — [LeetCode](https://leetcode.com/problems/sort-colors/)

- [0083-remove-duplicates-from-sorted-list](./83-remove-duplicates-from-sorted-list) — [LeetCode](https://leetcode.com/problems/remove-duplicates-from-sorted-list/)

- [0084-largest-rectangle-in-histogram](./84-largest-rectangle-in-histogram) — [LeetCode](https://leetcode.com/problems/largest-rectangle-in-histogram/)

- [0113-path-sum-ii](./113-path-sum-ii) — [LeetCode](https://leetcode.com/problems/path-sum-ii/)

- [0121-best-time-to-buy-and-sell-stock](./121-best-time-to-buy-and-sell-stock) — [LeetCode](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)

- [0127-word-ladder](./127-word-ladder) — [LeetCode](https://leetcode.com/problems/word-ladder/)

- [0136-single-number](./136-single-number) — [LeetCode](https://leetcode.com/problems/single-number/)

- [0169-majority-element](./169-majority-element) — [LeetCode](https://leetcode.com/problems/majority-element/)

- [0171-excel-sheet-column-number](./171-excel-sheet-column-number) — [LeetCode](https://leetcode.com/problems/excel-sheet-column-number/)

- [0202-happy-number](./202-happy-number) — [LeetCode](https://leetcode.com/problems/happy-number/)

- [0204-count-primes](./204-count-primes) — [LeetCode](https://leetcode.com/problems/count-primes/)

- [0217-contains-duplicate](./217-contains-duplicate) — [LeetCode](https://leetcode.com/problems/contains-duplicate/)

- [0219-contains-duplicate-ii](./219-contains-duplicate-ii) — [LeetCode](https://leetcode.com/problems/contains-duplicate-ii/)

- [0242-valid-anagram](./242-valid-anagram) — [LeetCode](https://leetcode.com/problems/valid-anagram/)

- [0268-missing-number](./268-missing-number) — [LeetCode](https://leetcode.com/problems/missing-number/)

- [0273-integer-to-english-words](./273-integer-to-english-words) — [LeetCode](https://leetcode.com/problems/integer-to-english-words/)

- [0283-move-zeroes](./283-move-zeroes) — [LeetCode](https://leetcode.com/problems/move-zeroes/)

- [0287-find-the-duplicate-number](./287-find-the-duplicate-number) — [LeetCode](https://leetcode.com/problems/find-the-duplicate-number/)

- [0319-bulb-switcher](./319-bulb-switcher) — [LeetCode](https://leetcode.com/problems/bulb-switcher/)

- [0322-coin-change](./322-coin-change) — [LeetCode](https://leetcode.com/problems/coin-change/)

- [0371-sum-of-two-integers](./371-sum-of-two-integers) — [LeetCode](https://leetcode.com/problems/sum-of-two-integers/)

- [0374-guess-number-higher-or-lower](./374-guess-number-higher-or-lower) — [LeetCode](https://leetcode.com/problems/guess-number-higher-or-lower/)

- [0392-is-subsequence](./392-is-subsequence) — [LeetCode](https://leetcode.com/problems/is-subsequence/)

- [0485-max-consecutive-ones](./485-max-consecutive-ones) — [LeetCode](https://leetcode.com/problems/max-consecutive-ones/)

- [0496-next-greater-element-i](./496-next-greater-element-i) — [LeetCode](https://leetcode.com/problems/next-greater-element-i/)

- [0507-perfect-number](./507-perfect-number) — [LeetCode](https://leetcode.com/problems/perfect-number/)

- [0575-distribute-candies](./575-distribute-candies) — [LeetCode](https://leetcode.com/problems/distribute-candies/)

- [0584-find-customer-referee](./584-find-customer-referee) — [LeetCode](https://leetcode.com/problems/find-customer-referee/)

- [0628-maximum-product-of-three-numbers](./628-maximum-product-of-three-numbers) — [LeetCode](https://leetcode.com/problems/maximum-product-of-three-numbers/)

- [0633-sum-of-square-numbers](./633-sum-of-square-numbers) — [LeetCode](https://leetcode.com/problems/sum-of-square-numbers/)

- [0720-longest-word-in-dictionary](./720-longest-word-in-dictionary) — [LeetCode](https://leetcode.com/problems/longest-word-in-dictionary/)

- [0871-keys-and-rooms](./871-keys-and-rooms) — [LeetCode](https://leetcode.com/problems/keys-and-rooms/)

- [1013-fibonacci-number](./1013-fibonacci-number) — [LeetCode](https://leetcode.com/problems/fibonacci-number/)

- [1039-find-the-town-judge](./1039-find-the-town-judge) — [LeetCode](https://leetcode.com/problems/find-the-town-judge/)

- [1064-smallest-integer-divisible-by-k](./1064-smallest-integer-divisible-by-k) — [LeetCode](https://leetcode.com/problems/smallest-integer-divisible-by-k/)

- [1153-product-sales-analysis-i](./1153-product-sales-analysis-i) — [LeetCode](https://leetcode.com/problems/product-sales-analysis-i/)

- [1284-four-divisors](./1284-four-divisors) — [LeetCode](https://leetcode.com/problems/four-divisors/)

- [1450-delete-leaves-with-a-given-value](./1450-delete-leaves-with-a-given-value) — [LeetCode](https://leetcode.com/problems/delete-leaves-with-a-given-value/)

- [1477-product-of-the-last-k-numbers](./1477-product-of-the-last-k-numbers) — [LeetCode](https://leetcode.com/problems/product-of-the-last-k-numbers/)

- [1626-can-make-arithmetic-progression-from-sequence](./1626-can-make-arithmetic-progression-from-sequence) — [LeetCode](https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/)

- [1848-sum-of-unique-elements](./1848-sum-of-unique-elements) — [LeetCode](https://leetcode.com/problems/sum-of-unique-elements/)

- [1916-find-center-of-star-graph](./1916-find-center-of-star-graph) — [LeetCode](https://leetcode.com/problems/find-center-of-star-graph/)

- [2383-add-two-integers](./2383-add-two-integers) — [LeetCode](https://leetcode.com/problems/add-two-integers/)

- [2481-strictly-palindromic-number](./2481-strictly-palindromic-number) — [LeetCode](https://leetcode.com/problems/strictly-palindromic-number/)

- [2737-row-with-maximum-ones](./2737-row-with-maximum-ones) — [LeetCode](https://leetcode.com/problems/row-with-maximum-ones/)

- [3152-maximum-value-of-an-ordered-triplet-ii](./3152-maximum-value-of-an-ordered-triplet-ii) — [LeetCode](https://leetcode.com/problems/maximum-value-of-an-ordered-triplet-ii/)

- [3154-maximum-value-of-an-ordered-triplet-i](./3154-maximum-value-of-an-ordered-triplet-i) — [LeetCode](https://leetcode.com/problems/maximum-value-of-an-ordered-triplet-i/)

- [3227-find-missing-and-repeated-values](./3227-find-missing-and-repeated-values) — [LeetCode](https://leetcode.com/problems/find-missing-and-repeated-values/)

- [3279-alice-and-bob-playing-flower-game](./3279-alice-and-bob-playing-flower-game) — [LeetCode](https://leetcode.com/problems/alice-and-bob-playing-flower-game/)

- [3321-type-of-triangle](./3321-type-of-triangle) — [LeetCode](https://leetcode.com/problems/type-of-triangle/)

- [3704-count-partitions-with-even-sum-difference](./3704-count-partitions-with-even-sum-difference) — [LeetCode](https://leetcode.com/problems/count-partitions-with-even-sum-difference/)

### SQL

- [0595-big-countries](./595-big-countries) — [LeetCode](https://leetcode.com/problems/big-countries/)

- [1258-article-views-i](./1258-article-views-i) — [LeetCode](https://leetcode.com/problems/article-views-i/)

- [1509-replace-employee-id-with-the-unique-identifier](./1509-replace-employee-id-with-the-unique-identifier) — [LeetCode](https://leetcode.com/problems/replace-employee-id-with-the-unique-identifier/)

- [1827-invalid-tweets](./1827-invalid-tweets) — [LeetCode](https://leetcode.com/problems/invalid-tweets/)

- [1908-recyclable-and-low-fat-products](./1908-recyclable-and-low-fat-products) — [LeetCode](https://leetcode.com/problems/recyclable-and-low-fat-products/)

### Stack

- [0020-valid-parentheses](./20-valid-parentheses) — [LeetCode](https://leetcode.com/problems/valid-parentheses/)

- [0022-generate-parentheses](./22-generate-parentheses) — [LeetCode](https://leetcode.com/problems/generate-parentheses/)

- [0150-evaluate-reverse-polish-notation](./150-evaluate-reverse-polish-notation) — [LeetCode](https://leetcode.com/problems/evaluate-reverse-polish-notation/)

- [0957-minimum-add-to-make-parentheses-valid](./957-minimum-add-to-make-parentheses-valid) — [LeetCode](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/)

### String

- [0003-longest-substring-without-repeating-characters](./3-longest-substring-without-repeating-characters) — [LeetCode](https://leetcode.com/problems/longest-substring-without-repeating-characters/)

- [0006-zigzag-conversion](./6-zigzag-conversion) — [LeetCode](https://leetcode.com/problems/zigzag-conversion/)

- [0013-roman-to-integer](./13-roman-to-integer) — [LeetCode](https://leetcode.com/problems/roman-to-integer/)

- [0014-longest-common-prefix](./14-longest-common-prefix) — [LeetCode](https://leetcode.com/problems/longest-common-prefix/)

- [0028-find-the-index-of-the-first-occurrence-in-a-string](./28-find-the-index-of-the-first-occurrence-in-a-string) — [LeetCode](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/)

- [0125-valid-palindrome](./125-valid-palindrome) — [LeetCode](https://leetcode.com/problems/valid-palindrome/)

- [0151-reverse-words-in-a-string](./151-reverse-words-in-a-string) — [LeetCode](https://leetcode.com/problems/reverse-words-in-a-string/)

- [0208-implement-trie-prefix-tree](./208-implement-trie-prefix-tree) — [LeetCode](https://leetcode.com/problems/implement-trie-prefix-tree/)

- [0234-palindrome-linked-list](./234-palindrome-linked-list) — [LeetCode](https://leetcode.com/problems/palindrome-linked-list/)

- [0344-reverse-string](./344-reverse-string) — [LeetCode](https://leetcode.com/problems/reverse-string/)

- [0345-reverse-vowels-of-a-string](./345-reverse-vowels-of-a-string) — [LeetCode](https://leetcode.com/problems/reverse-vowels-of-a-string/)

- [0387-first-unique-character-in-a-string](./387-first-unique-character-in-a-string) — [LeetCode](https://leetcode.com/problems/first-unique-character-in-a-string/)

- [0394-decode-string](./394-decode-string) — [LeetCode](https://leetcode.com/problems/decode-string/)

- [0415-add-strings](./415-add-strings) — [LeetCode](https://leetcode.com/problems/add-strings/)

- [1341-split-a-string-in-balanced-strings](./1341-split-a-string-in-balanced-strings) — [LeetCode](https://leetcode.com/problems/split-a-string-in-balanced-strings/)

- [1987-substrings-of-size-three-with-distinct-characters](./1987-substrings-of-size-three-with-distinct-characters) — [LeetCode](https://leetcode.com/problems/substrings-of-size-three-with-distinct-characters/)

- [2654-count-the-number-of-vowel-strings-in-range](./2654-count-the-number-of-vowel-strings-in-range) — [LeetCode](https://leetcode.com/problems/count-the-number-of-vowel-strings-in-range/)

### Tree

- [0094-binary-tree-inorder-traversal](./94-binary-tree-inorder-traversal) — [LeetCode](https://leetcode.com/problems/binary-tree-inorder-traversal/)

- [0098-validate-binary-search-tree](./98-validate-binary-search-tree) — [LeetCode](https://leetcode.com/problems/validate-binary-search-tree/)

- [0100-same-tree](./100-same-tree) — [LeetCode](https://leetcode.com/problems/same-tree/)

- [0101-symmetric-tree](./101-symmetric-tree) — [LeetCode](https://leetcode.com/problems/symmetric-tree/)

- [0104-maximum-depth-of-binary-tree](./104-maximum-depth-of-binary-tree) — [LeetCode](https://leetcode.com/problems/maximum-depth-of-binary-tree/)

- [0124-binary-tree-maximum-path-sum](./124-binary-tree-maximum-path-sum) — [LeetCode](https://leetcode.com/problems/binary-tree-maximum-path-sum/)

- [0144-binary-tree-preorder-traversal](./144-binary-tree-preorder-traversal) — [LeetCode](https://leetcode.com/problems/binary-tree-preorder-traversal/)

- [0145-binary-tree-postorder-traversal](./145-binary-tree-postorder-traversal) — [LeetCode](https://leetcode.com/problems/binary-tree-postorder-traversal/)

- [0222-count-complete-tree-nodes](./222-count-complete-tree-nodes) — [LeetCode](https://leetcode.com/problems/count-complete-tree-nodes/)

- [0226-invert-binary-tree](./226-invert-binary-tree) — [LeetCode](https://leetcode.com/problems/invert-binary-tree/)

- [0230-kth-smallest-element-in-a-bst](./230-kth-smallest-element-in-a-bst) — [LeetCode](https://leetcode.com/problems/kth-smallest-element-in-a-bst/)

- [0235-lowest-common-ancestor-of-a-binary-search-tree](./235-lowest-common-ancestor-of-a-binary-search-tree) — [LeetCode](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/)

- [0530-minimum-absolute-difference-in-bst](./530-minimum-absolute-difference-in-bst) — [LeetCode](https://leetcode.com/problems/minimum-absolute-difference-in-bst/)

- [0783-search-in-a-binary-search-tree](./783-search-in-a-binary-search-tree) — [LeetCode](https://leetcode.com/problems/search-in-a-binary-search-tree/)

- [0975-range-sum-of-bst](./975-range-sum-of-bst) — [LeetCode](https://leetcode.com/problems/range-sum-of-bst/)

- [1005-univalued-binary-tree](./1005-univalued-binary-tree) — [LeetCode](https://leetcode.com/problems/univalued-binary-tree/)

- [1285-balance-a-binary-search-tree](./1285-balance-a-binary-search-tree) — [LeetCode](https://leetcode.com/problems/balance-a-binary-search-tree/)