{"id":20315052,"url":"https://github.com/mj-awad17/leetcode-problems-solutions","last_synced_at":"2026-04-19T00:03:52.115Z","repository":{"id":242272505,"uuid":"789557944","full_name":"mj-awad17/LeetCode-Problems-Solutions","owner":"mj-awad17","description":"Collection of @LeetCode problems Daily Challenges and their possible solutions with different approaches along side the @leetcode @topics of DSA.Below review the LeetCode-Profile","archived":false,"fork":false,"pushed_at":"2024-10-29T18:38:14.000Z","size":668,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2024-10-29T20:38:59.831Z","etag":null,"topics":["arrays","backtracking","binary-search-tree","graph","hash-table","leetcode","leetcode-python","leetcode-solutions","linked-list","math","sorting","string","tree","two-pointers"],"latest_commit_sha":null,"homepage":"https://leetcode.com/jawadrana660/","language":"Python","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/mj-awad17.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":"2024-04-20T22:16:33.000Z","updated_at":"2024-10-29T18:38:18.000Z","dependencies_parsed_at":"2024-06-01T21:40:54.447Z","dependency_job_id":"a6849487-6f34-4b74-8536-9947a4bbbce3","html_url":"https://github.com/mj-awad17/LeetCode-Problems-Solutions","commit_stats":null,"previous_names":["mj-awad17/leetcode-problems-solutioins"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mj-awad17%2FLeetCode-Problems-Solutions","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mj-awad17%2FLeetCode-Problems-Solutions/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mj-awad17%2FLeetCode-Problems-Solutions/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mj-awad17%2FLeetCode-Problems-Solutions/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/mj-awad17","download_url":"https://codeload.github.com/mj-awad17/LeetCode-Problems-Solutions/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241818879,"owners_count":20025210,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","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":["arrays","backtracking","binary-search-tree","graph","hash-table","leetcode","leetcode-python","leetcode-solutions","linked-list","math","sorting","string","tree","two-pointers"],"created_at":"2024-11-14T18:17:44.757Z","updated_at":"2026-04-19T00:03:52.101Z","avatar_url":"https://github.com/mj-awad17.png","language":"Python","readme":"# LeetCode-Solutioins\n\nEmbark on a journey of growth and mastery with this comprehensive collection of [LeetCode](https://leetcode.com/problems/) questions. Equip yourself with the necessary tools and techniques to excel in your coding interviews.\n\n\n# Backtracking\n|  |\n| ------- |\n| [0077-combinations](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0077-combinations) |\n# Array\n|  |\n| ------- |\n| [1833-find-the-highest-altitude](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1833-find-the-highest-altitude) |\n# Prefix Sum\n|  |\n| ------- |\n| [1833-find-the-highest-altitude](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1833-find-the-highest-altitude) |\n# Graph\n|  |\n| ------- |\n| [1916-find-center-of-star-graph](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1916-find-center-of-star-graph) |\n# Hash Table\n|  |\n| ------- |\n| [0782-jewels-and-stones](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0782-jewels-and-stones) |\n# String\n|  |\n| ------- |\n| [0782-jewels-and-stones](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0782-jewels-and-stones) |\n\u003c!---LeetCode Topics Start--\u003e\n# LeetCode Topics\n## Array\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0001-two-sum) |\n| [0004-median-of-two-sorted-arrays](https://github.com/mj-awad17/LeetCode-Problems-Solutions/tree/master/0004-median-of-two-sorted-arrays) |\n| [0011-container-with-most-water](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0011-container-with-most-water) |\n| [0027-remove-element](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0027-remove-element) |\n| [0035-search-insert-position](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0035-search-insert-position) |\n| [0040-combination-sum-ii](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0040-combination-sum-ii) |\n| [0056-merge-intervals](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0056-merge-intervals) |\n| [0088-merge-sorted-array](https://github.com/mj-awad17/LeetCode-Problems-Solutions/tree/master/0088-merge-sorted-array) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0152-maximum-product-subarray](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0152-maximum-product-subarray) |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n| [0217-contains-duplicate](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0217-contains-duplicate) |\n| [0238-product-of-array-except-self](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0238-product-of-array-except-self) |\n| [0283-move-zeroes](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0283-move-zeroes) |\n| [0334-increasing-triplet-subsequence](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0334-increasing-triplet-subsequence) |\n| [0350-intersection-of-two-arrays-ii](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0350-intersection-of-two-arrays-ii) |\n| [0435-non-overlapping-intervals](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0435-non-overlapping-intervals) |\n| [0452-minimum-number-of-arrows-to-burst-balloons](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0452-minimum-number-of-arrows-to-burst-balloons) |\n| [0500-keyboard-row](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0500-keyboard-row) |\n| [0605-can-place-flowers](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0605-can-place-flowers) |\n| [0624-maximum-distance-in-arrays](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0624-maximum-distance-in-arrays) |\n| [0643-maximum-average-subarray-i](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0643-maximum-average-subarray-i) |\n| [0735-asteroid-collision](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0735-asteroid-collision) |\n| [0739-daily-temperatures](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0739-daily-temperatures) |\n| [0810-valid-tic-tac-toe-state](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0810-valid-tic-tac-toe-state) |\n| [0854-making-a-large-island](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0854-making-a-large-island) |\n| [0870-magic-squares-in-grid](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0870-magic-squares-in-grid) |\n| [1046-max-consecutive-ones-iii](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1046-max-consecutive-ones-iii) |\n| [1231-replace-elements-with-greatest-element-on-right-side](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1231-replace-elements-with-greatest-element-on-right-side) |\n| [1256-rank-transform-of-an-array](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1256-rank-transform-of-an-array) |\n| [1293-three-consecutive-odds](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1293-three-consecutive-odds) |\n| [1319-unique-number-of-occurrences](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1319-unique-number-of-occurrences) |\n| [1364-tuple-with-same-product](https://github.com/mj-awad17/LeetCode-Problems-Solutions/tree/master/1364-tuple-with-same-product) |\n| [1392-find-the-difference-of-two-arrays](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1392-find-the-difference-of-two-arrays) |\n| [1435-xor-queries-of-a-subarray](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1435-xor-queries-of-a-subarray) |\n| [1528-kids-with-the-greatest-number-of-candies](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1528-kids-with-the-greatest-number-of-candies) |\n| [1580-shuffle-the-array](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1580-shuffle-the-array) |\n| [1586-longest-subarray-of-1s-after-deleting-one-element](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1586-longest-subarray-of-1s-after-deleting-one-element) |\n| [1616-minimum-difference-between-largest-and-smallest-value-in-three-moves](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1616-minimum-difference-between-largest-and-smallest-value-in-three-moves) |\n| [1620-check-if-array-pairs-are-divisible-by-k](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1620-check-if-array-pairs-are-divisible-by-k) |\n| [1786-count-the-number-of-consistent-strings](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1786-count-the-number-of-consistent-strings) |\n| [1798-max-number-of-k-sum-pairs](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1798-max-number-of-k-sum-pairs) |\n| [1803-average-waiting-time](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1803-average-waiting-time) |\n| [1833-find-the-highest-altitude](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1833-find-the-highest-altitude) |\n| [1951-find-the-winner-of-the-circular-game](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1951-find-the-winner-of-the-circular-game) |\n| [2058-concatenation-of-array](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2058-concatenation-of-array) |\n| [2163-kth-distinct-string-in-an-array](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2163-kth-distinct-string-in-an-array) |\n| [2164-two-best-non-overlapping-events](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2164-two-best-non-overlapping-events) |\n| [2232-adding-spaces-to-a-string](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2232-adding-spaces-to-a-string) |\n| [2356-largest-combination-with-bitwise-and-greater-than-zero](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2356-largest-combination-with-bitwise-and-greater-than-zero) |\n| [2392-successful-pairs-of-spells-and-potions](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2392-successful-pairs-of-spells-and-potions) |\n| [2428-equal-row-and-column-pairs](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2428-equal-row-and-column-pairs) |\n| [2503-longest-subarray-with-maximum-bitwise-and](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2503-longest-subarray-with-maximum-bitwise-and) |\n| [3372-longest-strictly-increasing-or-strictly-decreasing-subarray](https://github.com/mj-awad17/LeetCode-Problems-Solutions/tree/master/3372-longest-strictly-increasing-or-strictly-decreasing-subarray) |\n| [3501-delete-nodes-from-linked-list-present-in-array](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/3501-delete-nodes-from-linked-list-present-in-array) |\n## Hash Table\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0001-two-sum) |\n| [0013-roman-to-integer](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0013-roman-to-integer) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0142-linked-list-cycle-ii](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0142-linked-list-cycle-ii) |\n| [0217-contains-duplicate](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0217-contains-duplicate) |\n| [0350-intersection-of-two-arrays-ii](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0350-intersection-of-two-arrays-ii) |\n| [0500-keyboard-row](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0500-keyboard-row) |\n| [0870-magic-squares-in-grid](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0870-magic-squares-in-grid) |\n| [1256-rank-transform-of-an-array](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1256-rank-transform-of-an-array) |\n| [1319-unique-number-of-occurrences](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1319-unique-number-of-occurrences) |\n| [1364-tuple-with-same-product](https://github.com/mj-awad17/LeetCode-Problems-Solutions/tree/master/1364-tuple-with-same-product) |\n| [1392-find-the-difference-of-two-arrays](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1392-find-the-difference-of-two-arrays) |\n| [1620-check-if-array-pairs-are-divisible-by-k](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1620-check-if-array-pairs-are-divisible-by-k) |\n| [1786-count-the-number-of-consistent-strings](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1786-count-the-number-of-consistent-strings) |\n| [1798-max-number-of-k-sum-pairs](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1798-max-number-of-k-sum-pairs) |\n| [2163-kth-distinct-string-in-an-array](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2163-kth-distinct-string-in-an-array) |\n| [2356-largest-combination-with-bitwise-and-greater-than-zero](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2356-largest-combination-with-bitwise-and-greater-than-zero) |\n| [2428-equal-row-and-column-pairs](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2428-equal-row-and-column-pairs) |\n| [3353-existence-of-a-substring-in-a-string-and-its-reverse](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/3353-existence-of-a-substring-in-a-string-and-its-reverse) |\n| [3501-delete-nodes-from-linked-list-present-in-array](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/3501-delete-nodes-from-linked-list-present-in-array) |\n## Sorting\n|  |\n| ------- |\n| [0056-merge-intervals](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0056-merge-intervals) |\n| [0088-merge-sorted-array](https://github.com/mj-awad17/LeetCode-Problems-Solutions/tree/master/0088-merge-sorted-array) |\n| [0217-contains-duplicate](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0217-contains-duplicate) |\n| [0350-intersection-of-two-arrays-ii](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0350-intersection-of-two-arrays-ii) |\n| [0435-non-overlapping-intervals](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0435-non-overlapping-intervals) |\n| [0452-minimum-number-of-arrows-to-burst-balloons](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0452-minimum-number-of-arrows-to-burst-balloons) |\n| [1256-rank-transform-of-an-array](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1256-rank-transform-of-an-array) |\n| [1616-minimum-difference-between-largest-and-smallest-value-in-three-moves](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1616-minimum-difference-between-largest-and-smallest-value-in-three-moves) |\n| [1798-max-number-of-k-sum-pairs](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1798-max-number-of-k-sum-pairs) |\n| [2164-two-best-non-overlapping-events](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2164-two-best-non-overlapping-events) |\n| [2379-maximum-total-importance-of-roads](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2379-maximum-total-importance-of-roads) |\n| [2392-successful-pairs-of-spells-and-potions](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2392-successful-pairs-of-spells-and-potions) |\n## Greedy\n|  |\n| ------- |\n| [0011-container-with-most-water](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0011-container-with-most-water) |\n| [0334-increasing-triplet-subsequence](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0334-increasing-triplet-subsequence) |\n| [0435-non-overlapping-intervals](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0435-non-overlapping-intervals) |\n| [0452-minimum-number-of-arrows-to-burst-balloons](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0452-minimum-number-of-arrows-to-burst-balloons) |\n| [0605-can-place-flowers](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0605-can-place-flowers) |\n| [0624-maximum-distance-in-arrays](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0624-maximum-distance-in-arrays) |\n| [0649-dota2-senate](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0649-dota2-senate) |\n| [0680-valid-palindrome-ii](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0680-valid-palindrome-ii) |\n| [1616-minimum-difference-between-largest-and-smallest-value-in-three-moves](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1616-minimum-difference-between-largest-and-smallest-value-in-three-moves) |\n| [2379-maximum-total-importance-of-roads](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2379-maximum-total-importance-of-roads) |\n## Graph\n|  |\n| ------- |\n| [0547-number-of-provinces](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0547-number-of-provinces) |\n| [0871-keys-and-rooms](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0871-keys-and-rooms) |\n| [2379-maximum-total-importance-of-roads](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2379-maximum-total-importance-of-roads) |\n## Heap (Priority Queue)\n|  |\n| ------- |\n| [2164-two-best-non-overlapping-events](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2164-two-best-non-overlapping-events) |\n| [2379-maximum-total-importance-of-roads](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2379-maximum-total-importance-of-roads) |\n## Linked List\n|  |\n| ------- |\n| [0019-remove-nth-node-from-end-of-list](https://github.com/mj-awad17/LeetCode-Problems-Solutions/tree/master/0019-remove-nth-node-from-end-of-list) |\n| [0021-merge-two-sorted-lists](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0021-merge-two-sorted-lists) |\n| [0142-linked-list-cycle-ii](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0142-linked-list-cycle-ii) |\n| [0143-reorder-list](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0143-reorder-list) |\n| [0206-reverse-linked-list](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0206-reverse-linked-list) |\n| [0328-odd-even-linked-list](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0328-odd-even-linked-list) |\n| [2182-find-the-minimum-and-maximum-number-of-nodes-between-critical-points](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2182-find-the-minimum-and-maximum-number-of-nodes-between-critical-points) |\n| [2216-delete-the-middle-node-of-a-linked-list](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2216-delete-the-middle-node-of-a-linked-list) |\n| [2236-maximum-twin-sum-of-a-linked-list](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2236-maximum-twin-sum-of-a-linked-list) |\n| [2871-double-a-number-represented-as-a-linked-list](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2871-double-a-number-represented-as-a-linked-list) |\n| [3501-delete-nodes-from-linked-list-present-in-array](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/3501-delete-nodes-from-linked-list-present-in-array) |\n## Math\n|  |\n| ------- |\n| [0013-roman-to-integer](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0013-roman-to-integer) |\n| [0029-divide-two-integers](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0029-divide-two-integers) |\n| [0069-sqrtx](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0069-sqrtx) |\n| [0070-climbing-stairs](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0070-climbing-stairs) |\n| [0096-unique-binary-search-trees](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0096-unique-binary-search-trees) |\n| [0231-power-of-two](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0231-power-of-two) |\n| [0870-magic-squares-in-grid](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0870-magic-squares-in-grid) |\n| [1146-greatest-common-divisor-of-strings](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1146-greatest-common-divisor-of-strings) |\n| [1642-water-bottles](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1642-water-bottles) |\n| [1951-find-the-winner-of-the-circular-game](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1951-find-the-winner-of-the-circular-game) |\n| [2871-double-a-number-represented-as-a-linked-list](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2871-double-a-number-represented-as-a-linked-list) |\n| [3172-divisible-and-non-divisible-sums-difference](https://github.com/mj-awad17/LeetCode-Problems-Solutions/tree/master/3172-divisible-and-non-divisible-sums-difference) |\n## Stack\n|  |\n| ------- |\n| [0020-valid-parentheses](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0020-valid-parentheses) |\n| [0143-reorder-list](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0143-reorder-list) |\n| [0394-decode-string](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0394-decode-string) |\n| [0735-asteroid-collision](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0735-asteroid-collision) |\n| [0739-daily-temperatures](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0739-daily-temperatures) |\n| [2236-maximum-twin-sum-of-a-linked-list](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2236-maximum-twin-sum-of-a-linked-list) |\n| [2470-removing-stars-from-a-string](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2470-removing-stars-from-a-string) |\n| [2871-double-a-number-represented-as-a-linked-list](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2871-double-a-number-represented-as-a-linked-list) |\n## Simulation\n|  |\n| ------- |\n| [0735-asteroid-collision](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0735-asteroid-collision) |\n| [1642-water-bottles](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1642-water-bottles) |\n| [1803-average-waiting-time](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1803-average-waiting-time) |\n| [1951-find-the-winner-of-the-circular-game](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1951-find-the-winner-of-the-circular-game) |\n| [2058-concatenation-of-array](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2058-concatenation-of-array) |\n| [2232-adding-spaces-to-a-string](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2232-adding-spaces-to-a-string) |\n| [2428-equal-row-and-column-pairs](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2428-equal-row-and-column-pairs) |\n| [2470-removing-stars-from-a-string](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2470-removing-stars-from-a-string) |\n## Two Pointers\n|  |\n| ------- |\n| [0005-longest-palindromic-substring](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0005-longest-palindromic-substring) |\n| [0011-container-with-most-water](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0011-container-with-most-water) |\n| [0019-remove-nth-node-from-end-of-list](https://github.com/mj-awad17/LeetCode-Problems-Solutions/tree/master/0019-remove-nth-node-from-end-of-list) |\n| [0027-remove-element](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0027-remove-element) |\n| [0088-merge-sorted-array](https://github.com/mj-awad17/LeetCode-Problems-Solutions/tree/master/0088-merge-sorted-array) |\n| [0142-linked-list-cycle-ii](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0142-linked-list-cycle-ii) |\n| [0143-reorder-list](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0143-reorder-list) |\n| [0151-reverse-words-in-a-string](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0151-reverse-words-in-a-string) |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n| [0283-move-zeroes](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0283-move-zeroes) |\n| [0344-reverse-string](https://github.com/mj-awad17/LeetCode-Problems-Solutions/tree/master/0344-reverse-string) |\n| [0345-reverse-vowels-of-a-string](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0345-reverse-vowels-of-a-string) |\n| [0350-intersection-of-two-arrays-ii](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0350-intersection-of-two-arrays-ii) |\n| [0392-is-subsequence](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0392-is-subsequence) |\n| [0443-string-compression](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0443-string-compression) |\n| [0680-valid-palindrome-ii](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0680-valid-palindrome-ii) |\n| [1798-max-number-of-k-sum-pairs](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1798-max-number-of-k-sum-pairs) |\n| [1894-merge-strings-alternately](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1894-merge-strings-alternately) |\n| [2216-delete-the-middle-node-of-a-linked-list](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2216-delete-the-middle-node-of-a-linked-list) |\n| [2232-adding-spaces-to-a-string](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2232-adding-spaces-to-a-string) |\n| [2236-maximum-twin-sum-of-a-linked-list](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2236-maximum-twin-sum-of-a-linked-list) |\n| [2392-successful-pairs-of-spells-and-potions](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2392-successful-pairs-of-spells-and-potions) |\n| [3018-make-string-a-subsequence-using-cyclic-increments](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/3018-make-string-a-subsequence-using-cyclic-increments) |\n## String\n|  |\n| ------- |\n| [0005-longest-palindromic-substring](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0005-longest-palindromic-substring) |\n| [0006-zigzag-conversion](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0006-zigzag-conversion) |\n| [0013-roman-to-integer](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0013-roman-to-integer) |\n| [0014-longest-common-prefix](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0014-longest-common-prefix) |\n| [0020-valid-parentheses](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0020-valid-parentheses) |\n| [0151-reverse-words-in-a-string](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0151-reverse-words-in-a-string) |\n| [0344-reverse-string](https://github.com/mj-awad17/LeetCode-Problems-Solutions/tree/master/0344-reverse-string) |\n| [0345-reverse-vowels-of-a-string](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0345-reverse-vowels-of-a-string) |\n| [0392-is-subsequence](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0392-is-subsequence) |\n| [0394-decode-string](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0394-decode-string) |\n| [0443-string-compression](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0443-string-compression) |\n| [0500-keyboard-row](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0500-keyboard-row) |\n| [0649-dota2-senate](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0649-dota2-senate) |\n| [0680-valid-palindrome-ii](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0680-valid-palindrome-ii) |\n| [0812-rotate-string](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0812-rotate-string) |\n| [1146-greatest-common-divisor-of-strings](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1146-greatest-common-divisor-of-strings) |\n| [1567-maximum-number-of-vowels-in-a-substring-of-given-length](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1567-maximum-number-of-vowels-in-a-substring-of-given-length) |\n| [1786-count-the-number-of-consistent-strings](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1786-count-the-number-of-consistent-strings) |\n| [1894-merge-strings-alternately](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1894-merge-strings-alternately) |\n| [2163-kth-distinct-string-in-an-array](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2163-kth-distinct-string-in-an-array) |\n| [2232-adding-spaces-to-a-string](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2232-adding-spaces-to-a-string) |\n| [2470-removing-stars-from-a-string](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2470-removing-stars-from-a-string) |\n| [3018-make-string-a-subsequence-using-cyclic-increments](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/3018-make-string-a-subsequence-using-cyclic-increments) |\n| [3353-existence-of-a-substring-in-a-string-and-its-reverse](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/3353-existence-of-a-substring-in-a-string-and-its-reverse) |\n## Dynamic Programming\n|  |\n| ------- |\n| [0005-longest-palindromic-substring](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0005-longest-palindromic-substring) |\n| [0070-climbing-stairs](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0070-climbing-stairs) |\n| [0096-unique-binary-search-trees](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0096-unique-binary-search-trees) |\n| [0152-maximum-product-subarray](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0152-maximum-product-subarray) |\n| [0338-counting-bits](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0338-counting-bits) |\n| [0392-is-subsequence](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0392-is-subsequence) |\n| [0435-non-overlapping-intervals](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0435-non-overlapping-intervals) |\n| [1586-longest-subarray-of-1s-after-deleting-one-element](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1586-longest-subarray-of-1s-after-deleting-one-element) |\n| [2164-two-best-non-overlapping-events](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2164-two-best-non-overlapping-events) |\n## Binary Search\n|  |\n| ------- |\n| [0004-median-of-two-sorted-arrays](https://github.com/mj-awad17/LeetCode-Problems-Solutions/tree/master/0004-median-of-two-sorted-arrays) |\n| [0035-search-insert-position](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0035-search-insert-position) |\n| [0069-sqrtx](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0069-sqrtx) |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n| [0350-intersection-of-two-arrays-ii](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0350-intersection-of-two-arrays-ii) |\n| [0374-guess-number-higher-or-lower](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0374-guess-number-higher-or-lower) |\n| [1046-max-consecutive-ones-iii](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1046-max-consecutive-ones-iii) |\n| [2164-two-best-non-overlapping-events](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2164-two-best-non-overlapping-events) |\n| [2392-successful-pairs-of-spells-and-potions](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2392-successful-pairs-of-spells-and-potions) |\n## Interactive\n|  |\n| ------- |\n| [0374-guess-number-higher-or-lower](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0374-guess-number-higher-or-lower) |\n## Recursion\n|  |\n| ------- |\n| [0021-merge-two-sorted-lists](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0021-merge-two-sorted-lists) |\n| [0143-reorder-list](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0143-reorder-list) |\n| [0206-reverse-linked-list](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0206-reverse-linked-list) |\n| [0231-power-of-two](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0231-power-of-two) |\n| [0394-decode-string](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0394-decode-string) |\n| [1951-find-the-winner-of-the-circular-game](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1951-find-the-winner-of-the-circular-game) |\n## Queue\n|  |\n| ------- |\n| [0649-dota2-senate](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0649-dota2-senate) |\n| [0969-number-of-recent-calls](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0969-number-of-recent-calls) |\n| [1951-find-the-winner-of-the-circular-game](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1951-find-the-winner-of-the-circular-game) |\n## Trie\n|  |\n| ------- |\n| [0014-longest-common-prefix](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0014-longest-common-prefix) |\n## Memoization\n|  |\n| ------- |\n| [0070-climbing-stairs](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0070-climbing-stairs) |\n## Counting\n|  |\n| ------- |\n| [1364-tuple-with-same-product](https://github.com/mj-awad17/LeetCode-Problems-Solutions/tree/master/1364-tuple-with-same-product) |\n| [1620-check-if-array-pairs-are-divisible-by-k](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1620-check-if-array-pairs-are-divisible-by-k) |\n| [1786-count-the-number-of-consistent-strings](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1786-count-the-number-of-consistent-strings) |\n| [2163-kth-distinct-string-in-an-array](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2163-kth-distinct-string-in-an-array) |\n| [2356-largest-combination-with-bitwise-and-greater-than-zero](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2356-largest-combination-with-bitwise-and-greater-than-zero) |\n## Matrix\n|  |\n| ------- |\n| [0810-valid-tic-tac-toe-state](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0810-valid-tic-tac-toe-state) |\n| [0854-making-a-large-island](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0854-making-a-large-island) |\n| [0870-magic-squares-in-grid](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0870-magic-squares-in-grid) |\n| [2428-equal-row-and-column-pairs](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2428-equal-row-and-column-pairs) |\n## Backtracking\n|  |\n| ------- |\n| [0040-combination-sum-ii](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0040-combination-sum-ii) |\n## Depth-First Search\n|  |\n| ------- |\n| [0104-maximum-depth-of-binary-tree](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0199-binary-tree-right-side-view](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0199-binary-tree-right-side-view) |\n| [0230-kth-smallest-element-in-a-bst](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0230-kth-smallest-element-in-a-bst) |\n| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |\n| [0437-path-sum-iii](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0437-path-sum-iii) |\n| [0547-number-of-provinces](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0547-number-of-provinces) |\n| [0854-making-a-large-island](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0854-making-a-large-island) |\n| [0871-keys-and-rooms](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0871-keys-and-rooms) |\n| [0904-leaf-similar-trees](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0904-leaf-similar-trees) |\n| [1116-maximum-level-sum-of-a-binary-tree](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1116-maximum-level-sum-of-a-binary-tree) |\n## Breadth-First Search\n|  |\n| ------- |\n| [0102-binary-tree-level-order-traversal](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0102-binary-tree-level-order-traversal) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0199-binary-tree-right-side-view](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0199-binary-tree-right-side-view) |\n| [0547-number-of-provinces](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0547-number-of-provinces) |\n| [0854-making-a-large-island](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0854-making-a-large-island) |\n| [0871-keys-and-rooms](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0871-keys-and-rooms) |\n| [1116-maximum-level-sum-of-a-binary-tree](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1116-maximum-level-sum-of-a-binary-tree) |\n## Union Find\n|  |\n| ------- |\n| [0547-number-of-provinces](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0547-number-of-provinces) |\n| [0854-making-a-large-island](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0854-making-a-large-island) |\n## Tree\n|  |\n| ------- |\n| [0096-unique-binary-search-trees](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0096-unique-binary-search-trees) |\n| [0102-binary-tree-level-order-traversal](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0102-binary-tree-level-order-traversal) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0199-binary-tree-right-side-view](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0199-binary-tree-right-side-view) |\n| [0230-kth-smallest-element-in-a-bst](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0230-kth-smallest-element-in-a-bst) |\n| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |\n| [0437-path-sum-iii](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0437-path-sum-iii) |\n| [0450-delete-node-in-a-bst](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0450-delete-node-in-a-bst) |\n| [0783-search-in-a-binary-search-tree](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0783-search-in-a-binary-search-tree) |\n| [0904-leaf-similar-trees](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0904-leaf-similar-trees) |\n| [1116-maximum-level-sum-of-a-binary-tree](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1116-maximum-level-sum-of-a-binary-tree) |\n## Binary Tree\n|  |\n| ------- |\n| [0096-unique-binary-search-trees](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0096-unique-binary-search-trees) |\n| [0102-binary-tree-level-order-traversal](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0102-binary-tree-level-order-traversal) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0199-binary-tree-right-side-view](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0199-binary-tree-right-side-view) |\n| [0230-kth-smallest-element-in-a-bst](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0230-kth-smallest-element-in-a-bst) |\n| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |\n| [0437-path-sum-iii](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0437-path-sum-iii) |\n| [0450-delete-node-in-a-bst](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0450-delete-node-in-a-bst) |\n| [0783-search-in-a-binary-search-tree](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0783-search-in-a-binary-search-tree) |\n| [0904-leaf-similar-trees](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0904-leaf-similar-trees) |\n| [1116-maximum-level-sum-of-a-binary-tree](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1116-maximum-level-sum-of-a-binary-tree) |\n## Binary Search Tree\n|  |\n| ------- |\n| [0096-unique-binary-search-trees](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0096-unique-binary-search-trees) |\n| [0230-kth-smallest-element-in-a-bst](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0230-kth-smallest-element-in-a-bst) |\n| [0450-delete-node-in-a-bst](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0450-delete-node-in-a-bst) |\n| [0783-search-in-a-binary-search-tree](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0783-search-in-a-binary-search-tree) |\n## Bit Manipulation\n|  |\n| ------- |\n| [0029-divide-two-integers](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0029-divide-two-integers) |\n| [0231-power-of-two](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0231-power-of-two) |\n| [0338-counting-bits](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0338-counting-bits) |\n| [1435-xor-queries-of-a-subarray](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1435-xor-queries-of-a-subarray) |\n| [1441-minimum-flips-to-make-a-or-b-equal-to-c](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1441-minimum-flips-to-make-a-or-b-equal-to-c) |\n| [1786-count-the-number-of-consistent-strings](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1786-count-the-number-of-consistent-strings) |\n| [2323-minimum-bit-flips-to-convert-number](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2323-minimum-bit-flips-to-convert-number) |\n| [2356-largest-combination-with-bitwise-and-greater-than-zero](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2356-largest-combination-with-bitwise-and-greater-than-zero) |\n| [2503-longest-subarray-with-maximum-bitwise-and](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2503-longest-subarray-with-maximum-bitwise-and) |\n## Prefix Sum\n|  |\n| ------- |\n| [0238-product-of-array-except-self](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0238-product-of-array-except-self) |\n| [1046-max-consecutive-ones-iii](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1046-max-consecutive-ones-iii) |\n| [1435-xor-queries-of-a-subarray](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1435-xor-queries-of-a-subarray) |\n| [1833-find-the-highest-altitude](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1833-find-the-highest-altitude) |\n## Brainteaser\n|  |\n| ------- |\n| [2503-longest-subarray-with-maximum-bitwise-and](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/2503-longest-subarray-with-maximum-bitwise-and) |\n## Divide and Conquer\n|  |\n| ------- |\n| [0004-median-of-two-sorted-arrays](https://github.com/mj-awad17/LeetCode-Problems-Solutions/tree/master/0004-median-of-two-sorted-arrays) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n## Sliding Window\n|  |\n| ------- |\n| [0643-maximum-average-subarray-i](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0643-maximum-average-subarray-i) |\n| [1046-max-consecutive-ones-iii](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1046-max-consecutive-ones-iii) |\n| [1567-maximum-number-of-vowels-in-a-substring-of-given-length](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1567-maximum-number-of-vowels-in-a-substring-of-given-length) |\n| [1586-longest-subarray-of-1s-after-deleting-one-element](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/1586-longest-subarray-of-1s-after-deleting-one-element) |\n## String Matching\n|  |\n| ------- |\n| [0812-rotate-string](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0812-rotate-string) |\n## Design\n|  |\n| ------- |\n| [0969-number-of-recent-calls](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0969-number-of-recent-calls) |\n## Data Stream\n|  |\n| ------- |\n| [0969-number-of-recent-calls](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0969-number-of-recent-calls) |\n## Monotonic Stack\n|  |\n| ------- |\n| [0739-daily-temperatures](https://github.com/mj-awad17/LeetCode-Problems-Solutioins/tree/master/0739-daily-temperatures) |\n\u003c!---LeetCode Topics End--\u003e","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmj-awad17%2Fleetcode-problems-solutions","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmj-awad17%2Fleetcode-problems-solutions","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmj-awad17%2Fleetcode-problems-solutions/lists"}