Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/ayushverma135/leetcode
Dive into the world of coding challenges with our curated collection of Leetcode programs. Covering a wide range of algorithms and data structures, these programs offer valuable practice for technical interviews and algorithmic problem-solving. With detailed explanations and optimized solutions.
https://github.com/ayushverma135/leetcode
leetcode leetcode-cpp leetcode-java leetcode-python
Last synced: 4 days ago
JSON representation
Dive into the world of coding challenges with our curated collection of Leetcode programs. Covering a wide range of algorithms and data structures, these programs offer valuable practice for technical interviews and algorithmic problem-solving. With detailed explanations and optimized solutions.
- Host: GitHub
- URL: https://github.com/ayushverma135/leetcode
- Owner: Ayushverma135
- Created: 2023-05-09T08:06:35.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2024-08-13T17:33:27.000Z (3 months ago)
- Last Synced: 2024-08-13T20:56:14.271Z (3 months ago)
- Topics: leetcode, leetcode-cpp, leetcode-java, leetcode-python
- Language: Java
- Homepage:
- Size: 849 KB
- Stars: 2
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# leetcode
Dive into the world of coding challenges with our curated collection of LeetCode programs. Covering a wide range of algorithms and data structures, these programs offer valuable practice for technical interviews and algorithmic problem-solving. With detailed explanations and optimized solutions, both beginners and experienced coders can sharpen their skills and tackle complex problems with confidence.
Collection of LeetCode questions to ace the coding interview! - Created using [LeetHub](https://github.com/QasimWani/LeetHub)
# Array
| |
| ------- |
| [0330-patching-array](https://github.com/ayushuv/leetcode/tree/master/0330-patching-array) |
| [0491-non-decreasing-subsequences](https://github.com/ayushuv/leetcode/tree/master/0491-non-decreasing-subsequences) |
| [0502-ipo](https://github.com/ayushuv/leetcode/tree/master/0502-ipo) |
| [0648-replace-words](https://github.com/ayushuv/leetcode/tree/master/0648-replace-words) |
| [0982-minimum-increment-to-make-array-unique](https://github.com/ayushuv/leetcode/tree/master/0982-minimum-increment-to-make-array-unique) |
| [1016-subarray-sums-divisible-by-k](https://github.com/ayushuv/leetcode/tree/master/1016-subarray-sums-divisible-by-k) |
| [1037-minimum-number-of-k-consecutive-bit-flips](https://github.com/ayushuv/leetcode/tree/master/1037-minimum-number-of-k-consecutive-bit-flips) |
| [1044-find-common-characters](https://github.com/ayushuv/leetcode/tree/master/1044-find-common-characters) |
| [1138-grumpy-bookstore-owner](https://github.com/ayushuv/leetcode/tree/master/1138-grumpy-bookstore-owner) |
| [1217-relative-sort-array](https://github.com/ayushuv/leetcode/tree/master/1217-relative-sort-array) |
| [1370-count-number-of-nice-subarrays](https://github.com/ayushuv/leetcode/tree/master/1370-count-number-of-nice-subarrays) |
| [1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit](https://github.com/ayushuv/leetcode/tree/master/1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit) |
| [1605-minimum-number-of-days-to-make-m-bouquets](https://github.com/ayushuv/leetcode/tree/master/1605-minimum-number-of-days-to-make-m-bouquets) |
| [2148-minimum-number-of-moves-to-seat-everyone](https://github.com/ayushuv/leetcode/tree/master/2148-minimum-number-of-moves-to-seat-everyone) |
# Hash Table
| |
| ------- |
| [0491-non-decreasing-subsequences](https://github.com/ayushuv/leetcode/tree/master/0491-non-decreasing-subsequences) |
| [0648-replace-words](https://github.com/ayushuv/leetcode/tree/master/0648-replace-words) |
| [1016-subarray-sums-divisible-by-k](https://github.com/ayushuv/leetcode/tree/master/1016-subarray-sums-divisible-by-k) |
| [1044-find-common-characters](https://github.com/ayushuv/leetcode/tree/master/1044-find-common-characters) |
| [1217-relative-sort-array](https://github.com/ayushuv/leetcode/tree/master/1217-relative-sort-array) |
| [1370-count-number-of-nice-subarrays](https://github.com/ayushuv/leetcode/tree/master/1370-count-number-of-nice-subarrays) |
# String
| |
| ------- |
| [0648-replace-words](https://github.com/ayushuv/leetcode/tree/master/0648-replace-words) |
| [1044-find-common-characters](https://github.com/ayushuv/leetcode/tree/master/1044-find-common-characters) |
# Trie
| |
| ------- |
| [0648-replace-words](https://github.com/ayushuv/leetcode/tree/master/0648-replace-words) |
# Prefix Sum
| |
| ------- |
| [1016-subarray-sums-divisible-by-k](https://github.com/ayushuv/leetcode/tree/master/1016-subarray-sums-divisible-by-k) |
| [1037-minimum-number-of-k-consecutive-bit-flips](https://github.com/ayushuv/leetcode/tree/master/1037-minimum-number-of-k-consecutive-bit-flips) |
# Sorting
| |
| ------- |
| [0502-ipo](https://github.com/ayushuv/leetcode/tree/master/0502-ipo) |
| [0982-minimum-increment-to-make-array-unique](https://github.com/ayushuv/leetcode/tree/master/0982-minimum-increment-to-make-array-unique) |
| [1217-relative-sort-array](https://github.com/ayushuv/leetcode/tree/master/1217-relative-sort-array) |
| [2148-minimum-number-of-moves-to-seat-everyone](https://github.com/ayushuv/leetcode/tree/master/2148-minimum-number-of-moves-to-seat-everyone) |
# Counting Sort
| |
| ------- |
| [0982-minimum-increment-to-make-array-unique](https://github.com/ayushuv/leetcode/tree/master/0982-minimum-increment-to-make-array-unique) |
| [1217-relative-sort-array](https://github.com/ayushuv/leetcode/tree/master/1217-relative-sort-array) |
# Greedy
| |
| ------- |
| [0330-patching-array](https://github.com/ayushuv/leetcode/tree/master/0330-patching-array) |
| [0502-ipo](https://github.com/ayushuv/leetcode/tree/master/0502-ipo) |
| [0982-minimum-increment-to-make-array-unique](https://github.com/ayushuv/leetcode/tree/master/0982-minimum-increment-to-make-array-unique) |
| [1285-balance-a-binary-search-tree](https://github.com/ayushuv/leetcode/tree/master/1285-balance-a-binary-search-tree) |
| [2148-minimum-number-of-moves-to-seat-everyone](https://github.com/ayushuv/leetcode/tree/master/2148-minimum-number-of-moves-to-seat-everyone) |
# Backtracking
| |
| ------- |
| [0491-non-decreasing-subsequences](https://github.com/ayushuv/leetcode/tree/master/0491-non-decreasing-subsequences) |
# Bit Manipulation
| |
| ------- |
| [0491-non-decreasing-subsequences](https://github.com/ayushuv/leetcode/tree/master/0491-non-decreasing-subsequences) |
| [1037-minimum-number-of-k-consecutive-bit-flips](https://github.com/ayushuv/leetcode/tree/master/1037-minimum-number-of-k-consecutive-bit-flips) |
# Heap (Priority Queue)
| |
| ------- |
| [0502-ipo](https://github.com/ayushuv/leetcode/tree/master/0502-ipo) |
| [1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit](https://github.com/ayushuv/leetcode/tree/master/1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit) |
# Math
| |
| ------- |
| [0633-sum-of-square-numbers](https://github.com/ayushuv/leetcode/tree/master/0633-sum-of-square-numbers) |
| [1370-count-number-of-nice-subarrays](https://github.com/ayushuv/leetcode/tree/master/1370-count-number-of-nice-subarrays) |
# Two Pointers
| |
| ------- |
| [0633-sum-of-square-numbers](https://github.com/ayushuv/leetcode/tree/master/0633-sum-of-square-numbers) |
# Binary Search
| |
| ------- |
| [0633-sum-of-square-numbers](https://github.com/ayushuv/leetcode/tree/master/0633-sum-of-square-numbers) |
| [1605-minimum-number-of-days-to-make-m-bouquets](https://github.com/ayushuv/leetcode/tree/master/1605-minimum-number-of-days-to-make-m-bouquets) |
# Sliding Window
| |
| ------- |
| [1037-minimum-number-of-k-consecutive-bit-flips](https://github.com/ayushuv/leetcode/tree/master/1037-minimum-number-of-k-consecutive-bit-flips) |
| [1138-grumpy-bookstore-owner](https://github.com/ayushuv/leetcode/tree/master/1138-grumpy-bookstore-owner) |
| [1370-count-number-of-nice-subarrays](https://github.com/ayushuv/leetcode/tree/master/1370-count-number-of-nice-subarrays) |
| [1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit](https://github.com/ayushuv/leetcode/tree/master/1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit) |
# Queue
| |
| ------- |
| [1037-minimum-number-of-k-consecutive-bit-flips](https://github.com/ayushuv/leetcode/tree/master/1037-minimum-number-of-k-consecutive-bit-flips) |
| [1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit](https://github.com/ayushuv/leetcode/tree/master/1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit) |
# Ordered Set
| |
| ------- |
| [1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit](https://github.com/ayushuv/leetcode/tree/master/1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit) |
# Monotonic Queue
| |
| ------- |
| [1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit](https://github.com/ayushuv/leetcode/tree/master/1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit) |
# Tree
| |
| ------- |
| [0538-convert-bst-to-greater-tree](https://github.com/ayushuv/leetcode/tree/master/0538-convert-bst-to-greater-tree) |
| [1114-binary-search-tree-to-greater-sum-tree](https://github.com/ayushuv/leetcode/tree/master/1114-binary-search-tree-to-greater-sum-tree) |
| [1285-balance-a-binary-search-tree](https://github.com/ayushuv/leetcode/tree/master/1285-balance-a-binary-search-tree) |
# Depth-First Search
| |
| ------- |
| [0538-convert-bst-to-greater-tree](https://github.com/ayushuv/leetcode/tree/master/0538-convert-bst-to-greater-tree) |
| [1114-binary-search-tree-to-greater-sum-tree](https://github.com/ayushuv/leetcode/tree/master/1114-binary-search-tree-to-greater-sum-tree) |
| [1285-balance-a-binary-search-tree](https://github.com/ayushuv/leetcode/tree/master/1285-balance-a-binary-search-tree) |
# Binary Search Tree
| |
| ------- |
| [0538-convert-bst-to-greater-tree](https://github.com/ayushuv/leetcode/tree/master/0538-convert-bst-to-greater-tree) |
| [1114-binary-search-tree-to-greater-sum-tree](https://github.com/ayushuv/leetcode/tree/master/1114-binary-search-tree-to-greater-sum-tree) |
| [1285-balance-a-binary-search-tree](https://github.com/ayushuv/leetcode/tree/master/1285-balance-a-binary-search-tree) |
# Binary Tree
| |
| ------- |
| [0538-convert-bst-to-greater-tree](https://github.com/ayushuv/leetcode/tree/master/0538-convert-bst-to-greater-tree) |
| [1114-binary-search-tree-to-greater-sum-tree](https://github.com/ayushuv/leetcode/tree/master/1114-binary-search-tree-to-greater-sum-tree) |
| [1285-balance-a-binary-search-tree](https://github.com/ayushuv/leetcode/tree/master/1285-balance-a-binary-search-tree) |
# Divide and Conquer
| |
| ------- |
| [1285-balance-a-binary-search-tree](https://github.com/ayushuv/leetcode/tree/master/1285-balance-a-binary-search-tree) |
# Graph
| |
| ------- |
| [1916-find-center-of-star-graph](https://github.com/ayushuv/leetcode/tree/master/1916-find-center-of-star-graph) |
# Database
| |
| ------- |
| [0584-find-customer-referee](https://github.com/ayushuv/leetcode/tree/master/0584-find-customer-referee) |
| [0595-big-countries](https://github.com/ayushuv/leetcode/tree/master/0595-big-countries) |
| [1258-article-views-i](https://github.com/ayushuv/leetcode/tree/master/1258-article-views-i) |
| [1827-invalid-tweets](https://github.com/ayushuv/leetcode/tree/master/1827-invalid-tweets) |
| [1908-recyclable-and-low-fat-products](https://github.com/ayushuv/leetcode/tree/master/1908-recyclable-and-low-fat-products) |
# LeetCode Topics
## Depth-First Search
| |
| ------- |
| [1207-delete-nodes-and-return-forest](https://github.com/ayushuv/leetcode/tree/master/1207-delete-nodes-and-return-forest) |
| [1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph](https://github.com/ayushuv/leetcode/tree/master/1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph) |
## Breadth-First Search
| |
| ------- |
| [1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph](https://github.com/ayushuv/leetcode/tree/master/1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph) |
## Graph
| |
| ------- |
| [1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph](https://github.com/ayushuv/leetcode/tree/master/1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph) |
## Topological Sort
| |
| ------- |
| [1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph](https://github.com/ayushuv/leetcode/tree/master/1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph) |
## Database
| |
| ------- |
| [0197-rising-temperature](https://github.com/ayushuv/leetcode/tree/master/0197-rising-temperature) |
| [0570-managers-with-at-least-5-direct-reports](https://github.com/ayushuv/leetcode/tree/master/0570-managers-with-at-least-5-direct-reports) |
| [0577-employee-bonus](https://github.com/ayushuv/leetcode/tree/master/0577-employee-bonus) |
| [0620-not-boring-movies](https://github.com/ayushuv/leetcode/tree/master/0620-not-boring-movies) |
| [1153-product-sales-analysis-i](https://github.com/ayushuv/leetcode/tree/master/1153-product-sales-analysis-i) |
| [1415-students-and-examinations](https://github.com/ayushuv/leetcode/tree/master/1415-students-and-examinations) |
| [1509-replace-employee-id-with-the-unique-identifier](https://github.com/ayushuv/leetcode/tree/master/1509-replace-employee-id-with-the-unique-identifier) |
| [1724-customer-who-visited-but-did-not-make-any-transactions](https://github.com/ayushuv/leetcode/tree/master/1724-customer-who-visited-but-did-not-make-any-transactions) |
| [1801-average-time-of-process-per-machine](https://github.com/ayushuv/leetcode/tree/master/1801-average-time-of-process-per-machine) |
| [2087-confirmation-rate](https://github.com/ayushuv/leetcode/tree/master/2087-confirmation-rate) |
## Array
| |
| ------- |
| [0350-intersection-of-two-arrays-ii](https://github.com/ayushuv/leetcode/tree/master/0350-intersection-of-two-arrays-ii) |
| [0948-sort-an-array](https://github.com/ayushuv/leetcode/tree/master/0948-sort-an-array) |
| [1207-delete-nodes-and-return-forest](https://github.com/ayushuv/leetcode/tree/master/1207-delete-nodes-and-return-forest) |
| [1288-maximum-subarray-sum-with-one-deletion](https://github.com/ayushuv/leetcode/tree/master/1288-maximum-subarray-sum-with-one-deletion) |
| [1293-three-consecutive-odds](https://github.com/ayushuv/leetcode/tree/master/1293-three-consecutive-odds) |
| [1333-sort-the-jumbled-numbers](https://github.com/ayushuv/leetcode/tree/master/1333-sort-the-jumbled-numbers) |
| [1615-range-sum-of-sorted-subarray-sums](https://github.com/ayushuv/leetcode/tree/master/1615-range-sum-of-sorted-subarray-sums) |
| [1616-minimum-difference-between-largest-and-smallest-value-in-three-moves](https://github.com/ayushuv/leetcode/tree/master/1616-minimum-difference-between-largest-and-smallest-value-in-three-moves) |
| [1741-sort-array-by-increasing-frequency](https://github.com/ayushuv/leetcode/tree/master/1741-sort-array-by-increasing-frequency) |
| [2502-sort-the-people](https://github.com/ayushuv/leetcode/tree/master/2502-sort-the-people) |
| [2727-number-of-senior-citizens](https://github.com/ayushuv/leetcode/tree/master/2727-number-of-senior-citizens) |
| [3501-delete-nodes-from-linked-list-present-in-array](https://github.com/ayushuv/leetcode/tree/master/3501-delete-nodes-from-linked-list-present-in-array) |
## Hash Table
| |
| ------- |
| [0350-intersection-of-two-arrays-ii](https://github.com/ayushuv/leetcode/tree/master/0350-intersection-of-two-arrays-ii) |
| [1207-delete-nodes-and-return-forest](https://github.com/ayushuv/leetcode/tree/master/1207-delete-nodes-and-return-forest) |
| [1741-sort-array-by-increasing-frequency](https://github.com/ayushuv/leetcode/tree/master/1741-sort-array-by-increasing-frequency) |
| [2502-sort-the-people](https://github.com/ayushuv/leetcode/tree/master/2502-sort-the-people) |
| [3501-delete-nodes-from-linked-list-present-in-array](https://github.com/ayushuv/leetcode/tree/master/3501-delete-nodes-from-linked-list-present-in-array) |
## Two Pointers
| |
| ------- |
| [0350-intersection-of-two-arrays-ii](https://github.com/ayushuv/leetcode/tree/master/0350-intersection-of-two-arrays-ii) |
| [1615-range-sum-of-sorted-subarray-sums](https://github.com/ayushuv/leetcode/tree/master/1615-range-sum-of-sorted-subarray-sums) |
## Binary Search
| |
| ------- |
| [0350-intersection-of-two-arrays-ii](https://github.com/ayushuv/leetcode/tree/master/0350-intersection-of-two-arrays-ii) |
| [1615-range-sum-of-sorted-subarray-sums](https://github.com/ayushuv/leetcode/tree/master/1615-range-sum-of-sorted-subarray-sums) |
## Sorting
| |
| ------- |
| [0350-intersection-of-two-arrays-ii](https://github.com/ayushuv/leetcode/tree/master/0350-intersection-of-two-arrays-ii) |
| [0948-sort-an-array](https://github.com/ayushuv/leetcode/tree/master/0948-sort-an-array) |
| [1333-sort-the-jumbled-numbers](https://github.com/ayushuv/leetcode/tree/master/1333-sort-the-jumbled-numbers) |
| [1615-range-sum-of-sorted-subarray-sums](https://github.com/ayushuv/leetcode/tree/master/1615-range-sum-of-sorted-subarray-sums) |
| [1616-minimum-difference-between-largest-and-smallest-value-in-three-moves](https://github.com/ayushuv/leetcode/tree/master/1616-minimum-difference-between-largest-and-smallest-value-in-three-moves) |
| [1741-sort-array-by-increasing-frequency](https://github.com/ayushuv/leetcode/tree/master/1741-sort-array-by-increasing-frequency) |
| [2502-sort-the-people](https://github.com/ayushuv/leetcode/tree/master/2502-sort-the-people) |
## Greedy
| |
| ------- |
| [1616-minimum-difference-between-largest-and-smallest-value-in-three-moves](https://github.com/ayushuv/leetcode/tree/master/1616-minimum-difference-between-largest-and-smallest-value-in-three-moves) |
## Dynamic Programming
| |
| ------- |
| [1288-maximum-subarray-sum-with-one-deletion](https://github.com/ayushuv/leetcode/tree/master/1288-maximum-subarray-sum-with-one-deletion) |
## Tree
| |
| ------- |
| [1207-delete-nodes-and-return-forest](https://github.com/ayushuv/leetcode/tree/master/1207-delete-nodes-and-return-forest) |
## Binary Tree
| |
| ------- |
| [1207-delete-nodes-and-return-forest](https://github.com/ayushuv/leetcode/tree/master/1207-delete-nodes-and-return-forest) |
## String
| |
| ------- |
| [2502-sort-the-people](https://github.com/ayushuv/leetcode/tree/master/2502-sort-the-people) |
| [2727-number-of-senior-citizens](https://github.com/ayushuv/leetcode/tree/master/2727-number-of-senior-citizens) |
## Divide and Conquer
| |
| ------- |
| [0948-sort-an-array](https://github.com/ayushuv/leetcode/tree/master/0948-sort-an-array) |
## Heap (Priority Queue)
| |
| ------- |
| [0948-sort-an-array](https://github.com/ayushuv/leetcode/tree/master/0948-sort-an-array) |
## Merge Sort
| |
| ------- |
| [0948-sort-an-array](https://github.com/ayushuv/leetcode/tree/master/0948-sort-an-array) |
## Bucket Sort
| |
| ------- |
| [0948-sort-an-array](https://github.com/ayushuv/leetcode/tree/master/0948-sort-an-array) |
## Radix Sort
| |
| ------- |
| [0948-sort-an-array](https://github.com/ayushuv/leetcode/tree/master/0948-sort-an-array) |
## Counting Sort
| |
| ------- |
| [0948-sort-an-array](https://github.com/ayushuv/leetcode/tree/master/0948-sort-an-array) |
## Linked List
| |
| ------- |
| [3501-delete-nodes-from-linked-list-present-in-array](https://github.com/ayushuv/leetcode/tree/master/3501-delete-nodes-from-linked-list-present-in-array) |