{"id":18950331,"url":"https://github.com/ayushverma135/leetcode","last_synced_at":"2026-03-10T06:32:24.401Z","repository":{"id":192046601,"uuid":"638163366","full_name":"Ayushverma135/leetcode","owner":"Ayushverma135","description":"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.","archived":false,"fork":false,"pushed_at":"2024-09-06T05:36:57.000Z","size":942,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-03-16T18:14:14.494Z","etag":null,"topics":["leetcode","leetcode-cpp","leetcode-java","leetcode-python"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Ayushverma135.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-05-09T08:06:35.000Z","updated_at":"2024-12-05T06:02:43.000Z","dependencies_parsed_at":null,"dependency_job_id":"a1f87093-9e9a-4b5d-b91e-a94b6da32902","html_url":"https://github.com/Ayushverma135/leetcode","commit_stats":null,"previous_names":["ayushuv/leetcode","ayushverma135/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Ayushverma135/leetcode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Ayushverma135%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Ayushverma135%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Ayushverma135%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Ayushverma135%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Ayushverma135","download_url":"https://codeload.github.com/Ayushverma135/leetcode/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Ayushverma135%2Fleetcode/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":30326891,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-03-10T05:25:20.737Z","status":"ssl_error","status_checked_at":"2026-03-10T05:25:17.430Z","response_time":106,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["leetcode","leetcode-cpp","leetcode-java","leetcode-python"],"created_at":"2024-11-08T13:22:26.583Z","updated_at":"2026-03-10T06:32:24.344Z","avatar_url":"https://github.com/Ayushverma135.png","language":"Java","readme":"# leetcode\n\nDive 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.\n\nCollection of LeetCode questions to ace the coding interview! - Created using [LeetHub](https://github.com/QasimWani/LeetHub)\n\n\n# Array\n|  |\n| ------- |\n| [0330-patching-array](https://github.com/ayushuv/leetcode/tree/master/0330-patching-array) |\n| [0491-non-decreasing-subsequences](https://github.com/ayushuv/leetcode/tree/master/0491-non-decreasing-subsequences) |\n| [0502-ipo](https://github.com/ayushuv/leetcode/tree/master/0502-ipo) |\n| [0648-replace-words](https://github.com/ayushuv/leetcode/tree/master/0648-replace-words) |\n| [0982-minimum-increment-to-make-array-unique](https://github.com/ayushuv/leetcode/tree/master/0982-minimum-increment-to-make-array-unique) |\n| [1016-subarray-sums-divisible-by-k](https://github.com/ayushuv/leetcode/tree/master/1016-subarray-sums-divisible-by-k) |\n| [1037-minimum-number-of-k-consecutive-bit-flips](https://github.com/ayushuv/leetcode/tree/master/1037-minimum-number-of-k-consecutive-bit-flips) |\n| [1044-find-common-characters](https://github.com/ayushuv/leetcode/tree/master/1044-find-common-characters) |\n| [1138-grumpy-bookstore-owner](https://github.com/ayushuv/leetcode/tree/master/1138-grumpy-bookstore-owner) |\n| [1217-relative-sort-array](https://github.com/ayushuv/leetcode/tree/master/1217-relative-sort-array) |\n| [1370-count-number-of-nice-subarrays](https://github.com/ayushuv/leetcode/tree/master/1370-count-number-of-nice-subarrays) |\n| [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) |\n| [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) |\n| [2148-minimum-number-of-moves-to-seat-everyone](https://github.com/ayushuv/leetcode/tree/master/2148-minimum-number-of-moves-to-seat-everyone) |\n# Hash Table\n|  |\n| ------- |\n| [0491-non-decreasing-subsequences](https://github.com/ayushuv/leetcode/tree/master/0491-non-decreasing-subsequences) |\n| [0648-replace-words](https://github.com/ayushuv/leetcode/tree/master/0648-replace-words) |\n| [1016-subarray-sums-divisible-by-k](https://github.com/ayushuv/leetcode/tree/master/1016-subarray-sums-divisible-by-k) |\n| [1044-find-common-characters](https://github.com/ayushuv/leetcode/tree/master/1044-find-common-characters) |\n| [1217-relative-sort-array](https://github.com/ayushuv/leetcode/tree/master/1217-relative-sort-array) |\n| [1370-count-number-of-nice-subarrays](https://github.com/ayushuv/leetcode/tree/master/1370-count-number-of-nice-subarrays) |\n# String\n|  |\n| ------- |\n| [0648-replace-words](https://github.com/ayushuv/leetcode/tree/master/0648-replace-words) |\n| [1044-find-common-characters](https://github.com/ayushuv/leetcode/tree/master/1044-find-common-characters) |\n# Trie\n|  |\n| ------- |\n| [0648-replace-words](https://github.com/ayushuv/leetcode/tree/master/0648-replace-words) |\n# Prefix Sum\n|  |\n| ------- |\n| [1016-subarray-sums-divisible-by-k](https://github.com/ayushuv/leetcode/tree/master/1016-subarray-sums-divisible-by-k) |\n| [1037-minimum-number-of-k-consecutive-bit-flips](https://github.com/ayushuv/leetcode/tree/master/1037-minimum-number-of-k-consecutive-bit-flips) |\n# Sorting\n|  |\n| ------- |\n| [0502-ipo](https://github.com/ayushuv/leetcode/tree/master/0502-ipo) |\n| [0982-minimum-increment-to-make-array-unique](https://github.com/ayushuv/leetcode/tree/master/0982-minimum-increment-to-make-array-unique) |\n| [1217-relative-sort-array](https://github.com/ayushuv/leetcode/tree/master/1217-relative-sort-array) |\n| [2148-minimum-number-of-moves-to-seat-everyone](https://github.com/ayushuv/leetcode/tree/master/2148-minimum-number-of-moves-to-seat-everyone) |\n# Counting Sort\n|  |\n| ------- |\n| [0982-minimum-increment-to-make-array-unique](https://github.com/ayushuv/leetcode/tree/master/0982-minimum-increment-to-make-array-unique) |\n| [1217-relative-sort-array](https://github.com/ayushuv/leetcode/tree/master/1217-relative-sort-array) |\n# Greedy\n|  |\n| ------- |\n| [0330-patching-array](https://github.com/ayushuv/leetcode/tree/master/0330-patching-array) |\n| [0502-ipo](https://github.com/ayushuv/leetcode/tree/master/0502-ipo) |\n| [0982-minimum-increment-to-make-array-unique](https://github.com/ayushuv/leetcode/tree/master/0982-minimum-increment-to-make-array-unique) |\n| [1285-balance-a-binary-search-tree](https://github.com/ayushuv/leetcode/tree/master/1285-balance-a-binary-search-tree) |\n| [2148-minimum-number-of-moves-to-seat-everyone](https://github.com/ayushuv/leetcode/tree/master/2148-minimum-number-of-moves-to-seat-everyone) |\n# Backtracking\n|  |\n| ------- |\n| [0491-non-decreasing-subsequences](https://github.com/ayushuv/leetcode/tree/master/0491-non-decreasing-subsequences) |\n# Bit Manipulation\n|  |\n| ------- |\n| [0491-non-decreasing-subsequences](https://github.com/ayushuv/leetcode/tree/master/0491-non-decreasing-subsequences) |\n| [1037-minimum-number-of-k-consecutive-bit-flips](https://github.com/ayushuv/leetcode/tree/master/1037-minimum-number-of-k-consecutive-bit-flips) |\n# Heap (Priority Queue)\n|  |\n| ------- |\n| [0502-ipo](https://github.com/ayushuv/leetcode/tree/master/0502-ipo) |\n| [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) |\n# Math\n|  |\n| ------- |\n| [0633-sum-of-square-numbers](https://github.com/ayushuv/leetcode/tree/master/0633-sum-of-square-numbers) |\n| [1370-count-number-of-nice-subarrays](https://github.com/ayushuv/leetcode/tree/master/1370-count-number-of-nice-subarrays) |\n# Two Pointers\n|  |\n| ------- |\n| [0633-sum-of-square-numbers](https://github.com/ayushuv/leetcode/tree/master/0633-sum-of-square-numbers) |\n# Binary Search\n|  |\n| ------- |\n| [0633-sum-of-square-numbers](https://github.com/ayushuv/leetcode/tree/master/0633-sum-of-square-numbers) |\n| [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) |\n# Sliding Window\n|  |\n| ------- |\n| [1037-minimum-number-of-k-consecutive-bit-flips](https://github.com/ayushuv/leetcode/tree/master/1037-minimum-number-of-k-consecutive-bit-flips) |\n| [1138-grumpy-bookstore-owner](https://github.com/ayushuv/leetcode/tree/master/1138-grumpy-bookstore-owner) |\n| [1370-count-number-of-nice-subarrays](https://github.com/ayushuv/leetcode/tree/master/1370-count-number-of-nice-subarrays) |\n| [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) |\n# Queue\n|  |\n| ------- |\n| [1037-minimum-number-of-k-consecutive-bit-flips](https://github.com/ayushuv/leetcode/tree/master/1037-minimum-number-of-k-consecutive-bit-flips) |\n| [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) |\n# Ordered Set\n|  |\n| ------- |\n| [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) |\n# Monotonic Queue\n|  |\n| ------- |\n| [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) |\n# Tree\n|  |\n| ------- |\n| [0538-convert-bst-to-greater-tree](https://github.com/ayushuv/leetcode/tree/master/0538-convert-bst-to-greater-tree) |\n| [1114-binary-search-tree-to-greater-sum-tree](https://github.com/ayushuv/leetcode/tree/master/1114-binary-search-tree-to-greater-sum-tree) |\n| [1285-balance-a-binary-search-tree](https://github.com/ayushuv/leetcode/tree/master/1285-balance-a-binary-search-tree) |\n# Depth-First Search\n|  |\n| ------- |\n| [0538-convert-bst-to-greater-tree](https://github.com/ayushuv/leetcode/tree/master/0538-convert-bst-to-greater-tree) |\n| [1114-binary-search-tree-to-greater-sum-tree](https://github.com/ayushuv/leetcode/tree/master/1114-binary-search-tree-to-greater-sum-tree) |\n| [1285-balance-a-binary-search-tree](https://github.com/ayushuv/leetcode/tree/master/1285-balance-a-binary-search-tree) |\n# Binary Search Tree\n|  |\n| ------- |\n| [0538-convert-bst-to-greater-tree](https://github.com/ayushuv/leetcode/tree/master/0538-convert-bst-to-greater-tree) |\n| [1114-binary-search-tree-to-greater-sum-tree](https://github.com/ayushuv/leetcode/tree/master/1114-binary-search-tree-to-greater-sum-tree) |\n| [1285-balance-a-binary-search-tree](https://github.com/ayushuv/leetcode/tree/master/1285-balance-a-binary-search-tree) |\n# Binary Tree\n|  |\n| ------- |\n| [0538-convert-bst-to-greater-tree](https://github.com/ayushuv/leetcode/tree/master/0538-convert-bst-to-greater-tree) |\n| [1114-binary-search-tree-to-greater-sum-tree](https://github.com/ayushuv/leetcode/tree/master/1114-binary-search-tree-to-greater-sum-tree) |\n| [1285-balance-a-binary-search-tree](https://github.com/ayushuv/leetcode/tree/master/1285-balance-a-binary-search-tree) |\n# Divide and Conquer\n|  |\n| ------- |\n| [1285-balance-a-binary-search-tree](https://github.com/ayushuv/leetcode/tree/master/1285-balance-a-binary-search-tree) |\n# Graph\n|  |\n| ------- |\n| [1916-find-center-of-star-graph](https://github.com/ayushuv/leetcode/tree/master/1916-find-center-of-star-graph) |\n# Database\n|  |\n| ------- |\n| [0584-find-customer-referee](https://github.com/ayushuv/leetcode/tree/master/0584-find-customer-referee) |\n| [0595-big-countries](https://github.com/ayushuv/leetcode/tree/master/0595-big-countries) |\n| [1258-article-views-i](https://github.com/ayushuv/leetcode/tree/master/1258-article-views-i) |\n| [1827-invalid-tweets](https://github.com/ayushuv/leetcode/tree/master/1827-invalid-tweets) |\n| [1908-recyclable-and-low-fat-products](https://github.com/ayushuv/leetcode/tree/master/1908-recyclable-and-low-fat-products) |\n\u003c!---LeetCode Topics Start--\u003e\n# LeetCode Topics\n## Depth-First Search\n|  |\n| ------- |\n| [1207-delete-nodes-and-return-forest](https://github.com/ayushuv/leetcode/tree/master/1207-delete-nodes-and-return-forest) |\n| [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) |\n## Breadth-First Search\n|  |\n| ------- |\n| [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) |\n## Graph\n|  |\n| ------- |\n| [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) |\n## Topological Sort\n|  |\n| ------- |\n| [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) |\n## Database\n|  |\n| ------- |\n| [0197-rising-temperature](https://github.com/ayushuv/leetcode/tree/master/0197-rising-temperature) |\n| [0570-managers-with-at-least-5-direct-reports](https://github.com/ayushuv/leetcode/tree/master/0570-managers-with-at-least-5-direct-reports) |\n| [0577-employee-bonus](https://github.com/ayushuv/leetcode/tree/master/0577-employee-bonus) |\n| [0620-not-boring-movies](https://github.com/ayushuv/leetcode/tree/master/0620-not-boring-movies) |\n| [1153-product-sales-analysis-i](https://github.com/ayushuv/leetcode/tree/master/1153-product-sales-analysis-i) |\n| [1415-students-and-examinations](https://github.com/ayushuv/leetcode/tree/master/1415-students-and-examinations) |\n| [1509-replace-employee-id-with-the-unique-identifier](https://github.com/ayushuv/leetcode/tree/master/1509-replace-employee-id-with-the-unique-identifier) |\n| [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) |\n| [1801-average-time-of-process-per-machine](https://github.com/ayushuv/leetcode/tree/master/1801-average-time-of-process-per-machine) |\n| [2087-confirmation-rate](https://github.com/ayushuv/leetcode/tree/master/2087-confirmation-rate) |\n## Array\n|  |\n| ------- |\n| [0350-intersection-of-two-arrays-ii](https://github.com/ayushuv/leetcode/tree/master/0350-intersection-of-two-arrays-ii) |\n| [0948-sort-an-array](https://github.com/ayushuv/leetcode/tree/master/0948-sort-an-array) |\n| [1207-delete-nodes-and-return-forest](https://github.com/ayushuv/leetcode/tree/master/1207-delete-nodes-and-return-forest) |\n| [1288-maximum-subarray-sum-with-one-deletion](https://github.com/ayushuv/leetcode/tree/master/1288-maximum-subarray-sum-with-one-deletion) |\n| [1293-three-consecutive-odds](https://github.com/ayushuv/leetcode/tree/master/1293-three-consecutive-odds) |\n| [1333-sort-the-jumbled-numbers](https://github.com/ayushuv/leetcode/tree/master/1333-sort-the-jumbled-numbers) |\n| [1615-range-sum-of-sorted-subarray-sums](https://github.com/ayushuv/leetcode/tree/master/1615-range-sum-of-sorted-subarray-sums) |\n| [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) |\n| [1741-sort-array-by-increasing-frequency](https://github.com/ayushuv/leetcode/tree/master/1741-sort-array-by-increasing-frequency) |\n| [2502-sort-the-people](https://github.com/ayushuv/leetcode/tree/master/2502-sort-the-people) |\n| [2727-number-of-senior-citizens](https://github.com/ayushuv/leetcode/tree/master/2727-number-of-senior-citizens) |\n| [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) |\n## Hash Table\n|  |\n| ------- |\n| [0350-intersection-of-two-arrays-ii](https://github.com/ayushuv/leetcode/tree/master/0350-intersection-of-two-arrays-ii) |\n| [1207-delete-nodes-and-return-forest](https://github.com/ayushuv/leetcode/tree/master/1207-delete-nodes-and-return-forest) |\n| [1741-sort-array-by-increasing-frequency](https://github.com/ayushuv/leetcode/tree/master/1741-sort-array-by-increasing-frequency) |\n| [2502-sort-the-people](https://github.com/ayushuv/leetcode/tree/master/2502-sort-the-people) |\n| [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) |\n## Two Pointers\n|  |\n| ------- |\n| [0350-intersection-of-two-arrays-ii](https://github.com/ayushuv/leetcode/tree/master/0350-intersection-of-two-arrays-ii) |\n| [1615-range-sum-of-sorted-subarray-sums](https://github.com/ayushuv/leetcode/tree/master/1615-range-sum-of-sorted-subarray-sums) |\n## Binary Search\n|  |\n| ------- |\n| [0350-intersection-of-two-arrays-ii](https://github.com/ayushuv/leetcode/tree/master/0350-intersection-of-two-arrays-ii) |\n| [1615-range-sum-of-sorted-subarray-sums](https://github.com/ayushuv/leetcode/tree/master/1615-range-sum-of-sorted-subarray-sums) |\n## Sorting\n|  |\n| ------- |\n| [0350-intersection-of-two-arrays-ii](https://github.com/ayushuv/leetcode/tree/master/0350-intersection-of-two-arrays-ii) |\n| [0948-sort-an-array](https://github.com/ayushuv/leetcode/tree/master/0948-sort-an-array) |\n| [1333-sort-the-jumbled-numbers](https://github.com/ayushuv/leetcode/tree/master/1333-sort-the-jumbled-numbers) |\n| [1615-range-sum-of-sorted-subarray-sums](https://github.com/ayushuv/leetcode/tree/master/1615-range-sum-of-sorted-subarray-sums) |\n| [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) |\n| [1741-sort-array-by-increasing-frequency](https://github.com/ayushuv/leetcode/tree/master/1741-sort-array-by-increasing-frequency) |\n| [2502-sort-the-people](https://github.com/ayushuv/leetcode/tree/master/2502-sort-the-people) |\n## Greedy\n|  |\n| ------- |\n| [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) |\n## Dynamic Programming\n|  |\n| ------- |\n| [1288-maximum-subarray-sum-with-one-deletion](https://github.com/ayushuv/leetcode/tree/master/1288-maximum-subarray-sum-with-one-deletion) |\n## Tree\n|  |\n| ------- |\n| [1207-delete-nodes-and-return-forest](https://github.com/ayushuv/leetcode/tree/master/1207-delete-nodes-and-return-forest) |\n## Binary Tree\n|  |\n| ------- |\n| [1207-delete-nodes-and-return-forest](https://github.com/ayushuv/leetcode/tree/master/1207-delete-nodes-and-return-forest) |\n## String\n|  |\n| ------- |\n| [2502-sort-the-people](https://github.com/ayushuv/leetcode/tree/master/2502-sort-the-people) |\n| [2727-number-of-senior-citizens](https://github.com/ayushuv/leetcode/tree/master/2727-number-of-senior-citizens) |\n## Divide and Conquer\n|  |\n| ------- |\n| [0948-sort-an-array](https://github.com/ayushuv/leetcode/tree/master/0948-sort-an-array) |\n## Heap (Priority Queue)\n|  |\n| ------- |\n| [0948-sort-an-array](https://github.com/ayushuv/leetcode/tree/master/0948-sort-an-array) |\n## Merge Sort\n|  |\n| ------- |\n| [0948-sort-an-array](https://github.com/ayushuv/leetcode/tree/master/0948-sort-an-array) |\n## Bucket Sort\n|  |\n| ------- |\n| [0948-sort-an-array](https://github.com/ayushuv/leetcode/tree/master/0948-sort-an-array) |\n## Radix Sort\n|  |\n| ------- |\n| [0948-sort-an-array](https://github.com/ayushuv/leetcode/tree/master/0948-sort-an-array) |\n## Counting Sort\n|  |\n| ------- |\n| [0948-sort-an-array](https://github.com/ayushuv/leetcode/tree/master/0948-sort-an-array) |\n## Linked List\n|  |\n| ------- |\n| [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) |\n\u003c!---LeetCode Topics End--\u003e","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fayushverma135%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fayushverma135%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fayushverma135%2Fleetcode/lists"}