{"id":18059459,"url":"https://github.com/devxoshakya/leetcode","last_synced_at":"2025-04-05T11:44:13.259Z","repository":{"id":221810269,"uuid":"747017287","full_name":"devxoshakya/leetcode","owner":"devxoshakya","description":"Collection of LeetCode questions","archived":false,"fork":false,"pushed_at":"2024-04-13T13:45:26.000Z","size":132,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2024-04-14T04:09:12.775Z","etag":null,"topics":[],"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/devxoshakya.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}},"created_at":"2024-01-23T05:04:39.000Z","updated_at":"2024-04-19T13:44:41.030Z","dependencies_parsed_at":"2024-04-19T07:31:10.896Z","dependency_job_id":null,"html_url":"https://github.com/devxoshakya/leetcode","commit_stats":null,"previous_names":["devxoshakya/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/devxoshakya%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/devxoshakya%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/devxoshakya%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/devxoshakya%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/devxoshakya","download_url":"https://codeload.github.com/devxoshakya/leetcode/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247332525,"owners_count":20921852,"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":[],"created_at":"2024-10-31T03:42:04.656Z","updated_at":"2025-04-05T11:44:13.253Z","avatar_url":"https://github.com/devxoshakya.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# leetcode\nCollection of LeetCode questions and their solutions.\n\n\u003c!---LeetCode Topics Start--\u003e\n# LeetCode Topics\n## Linked List\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/devxoshakya/leetcode/tree/master/0002-add-two-numbers) |\n| [0021-merge-two-sorted-lists](https://github.com/devxoshakya/leetcode/tree/master/0021-merge-two-sorted-lists) |\n| [0061-rotate-list](https://github.com/devxoshakya/leetcode/tree/master/0061-rotate-list) |\n| [0083-remove-duplicates-from-sorted-list](https://github.com/devxoshakya/leetcode/tree/master/0083-remove-duplicates-from-sorted-list) |\n| [0092-reverse-linked-list-ii](https://github.com/devxoshakya/leetcode/tree/master/0092-reverse-linked-list-ii) |\n| [0114-flatten-binary-tree-to-linked-list](https://github.com/devxoshakya/leetcode/tree/master/0114-flatten-binary-tree-to-linked-list) |\n| [0116-populating-next-right-pointers-in-each-node](https://github.com/devxoshakya/leetcode/tree/master/0116-populating-next-right-pointers-in-each-node) |\n| [0141-linked-list-cycle](https://github.com/devxoshakya/leetcode/tree/master/0141-linked-list-cycle) |\n| [0142-linked-list-cycle-ii](https://github.com/devxoshakya/leetcode/tree/master/0142-linked-list-cycle-ii) |\n| [0143-reorder-list](https://github.com/devxoshakya/leetcode/tree/master/0143-reorder-list) |\n| [0148-sort-list](https://github.com/devxoshakya/leetcode/tree/master/0148-sort-list) |\n| [0160-intersection-of-two-linked-lists](https://github.com/devxoshakya/leetcode/tree/master/0160-intersection-of-two-linked-lists) |\n| [0206-reverse-linked-list](https://github.com/devxoshakya/leetcode/tree/master/0206-reverse-linked-list) |\n| [0234-palindrome-linked-list](https://github.com/devxoshakya/leetcode/tree/master/0234-palindrome-linked-list) |\n| [0237-delete-node-in-a-linked-list](https://github.com/devxoshakya/leetcode/tree/master/0237-delete-node-in-a-linked-list) |\n| [0817-design-hashmap](https://github.com/devxoshakya/leetcode/tree/master/0817-design-hashmap) |\n| [0908-middle-of-the-linked-list](https://github.com/devxoshakya/leetcode/tree/master/0908-middle-of-the-linked-list) |\n| [1411-convert-binary-number-in-a-linked-list-to-integer](https://github.com/devxoshakya/leetcode/tree/master/1411-convert-binary-number-in-a-linked-list-to-integer) |\n## Recursion\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/devxoshakya/leetcode/tree/master/0002-add-two-numbers) |\n| [0021-merge-two-sorted-lists](https://github.com/devxoshakya/leetcode/tree/master/0021-merge-two-sorted-lists) |\n| [0143-reorder-list](https://github.com/devxoshakya/leetcode/tree/master/0143-reorder-list) |\n| [0206-reverse-linked-list](https://github.com/devxoshakya/leetcode/tree/master/0206-reverse-linked-list) |\n| [0234-palindrome-linked-list](https://github.com/devxoshakya/leetcode/tree/master/0234-palindrome-linked-list) |\n## Hash Table\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/devxoshakya/leetcode/tree/master/0001-two-sum) |\n| [0013-roman-to-integer](https://github.com/devxoshakya/leetcode/tree/master/0013-roman-to-integer) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/devxoshakya/leetcode/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0141-linked-list-cycle](https://github.com/devxoshakya/leetcode/tree/master/0141-linked-list-cycle) |\n| [0142-linked-list-cycle-ii](https://github.com/devxoshakya/leetcode/tree/master/0142-linked-list-cycle-ii) |\n| [0160-intersection-of-two-linked-lists](https://github.com/devxoshakya/leetcode/tree/master/0160-intersection-of-two-linked-lists) |\n| [0202-happy-number](https://github.com/devxoshakya/leetcode/tree/master/0202-happy-number) |\n| [0817-design-hashmap](https://github.com/devxoshakya/leetcode/tree/master/0817-design-hashmap) |\n| [1482-how-many-numbers-are-smaller-than-the-current-number](https://github.com/devxoshakya/leetcode/tree/master/1482-how-many-numbers-are-smaller-than-the-current-number) |\n| [1635-number-of-good-pairs](https://github.com/devxoshakya/leetcode/tree/master/1635-number-of-good-pairs) |\n| [1960-check-if-the-sentence-is-pangram](https://github.com/devxoshakya/leetcode/tree/master/1960-check-if-the-sentence-is-pangram) |\n## Two Pointers\n|  |\n| ------- |\n| [0027-remove-element](https://github.com/devxoshakya/leetcode/tree/master/0027-remove-element) |\n| [0061-rotate-list](https://github.com/devxoshakya/leetcode/tree/master/0061-rotate-list) |\n| [0141-linked-list-cycle](https://github.com/devxoshakya/leetcode/tree/master/0141-linked-list-cycle) |\n| [0142-linked-list-cycle-ii](https://github.com/devxoshakya/leetcode/tree/master/0142-linked-list-cycle-ii) |\n| [0143-reorder-list](https://github.com/devxoshakya/leetcode/tree/master/0143-reorder-list) |\n| [0148-sort-list](https://github.com/devxoshakya/leetcode/tree/master/0148-sort-list) |\n| [0160-intersection-of-two-linked-lists](https://github.com/devxoshakya/leetcode/tree/master/0160-intersection-of-two-linked-lists) |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/devxoshakya/leetcode/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n| [0202-happy-number](https://github.com/devxoshakya/leetcode/tree/master/0202-happy-number) |\n| [0234-palindrome-linked-list](https://github.com/devxoshakya/leetcode/tree/master/0234-palindrome-linked-list) |\n| [0861-flipping-an-image](https://github.com/devxoshakya/leetcode/tree/master/0861-flipping-an-image) |\n| [0908-middle-of-the-linked-list](https://github.com/devxoshakya/leetcode/tree/master/0908-middle-of-the-linked-list) |\n## Math\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/devxoshakya/leetcode/tree/master/0002-add-two-numbers) |\n| [0007-reverse-integer](https://github.com/devxoshakya/leetcode/tree/master/0007-reverse-integer) |\n| [0009-palindrome-number](https://github.com/devxoshakya/leetcode/tree/master/0009-palindrome-number) |\n| [0013-roman-to-integer](https://github.com/devxoshakya/leetcode/tree/master/0013-roman-to-integer) |\n| [0067-add-binary](https://github.com/devxoshakya/leetcode/tree/master/0067-add-binary) |\n| [0069-sqrtx](https://github.com/devxoshakya/leetcode/tree/master/0069-sqrtx) |\n| [0202-happy-number](https://github.com/devxoshakya/leetcode/tree/master/0202-happy-number) |\n| [0367-valid-perfect-square](https://github.com/devxoshakya/leetcode/tree/master/0367-valid-perfect-square) |\n| [0441-arranging-coins](https://github.com/devxoshakya/leetcode/tree/master/0441-arranging-coins) |\n| [1031-add-to-array-form-of-integer](https://github.com/devxoshakya/leetcode/tree/master/1031-add-to-array-form-of-integer) |\n| [1378-cells-with-odd-values-in-a-matrix](https://github.com/devxoshakya/leetcode/tree/master/1378-cells-with-odd-values-in-a-matrix) |\n| [1411-convert-binary-number-in-a-linked-list-to-integer](https://github.com/devxoshakya/leetcode/tree/master/1411-convert-binary-number-in-a-linked-list-to-integer) |\n| [1421-find-numbers-with-even-number-of-digits](https://github.com/devxoshakya/leetcode/tree/master/1421-find-numbers-with-even-number-of-digits) |\n| [1426-find-n-unique-integers-sum-up-to-zero](https://github.com/devxoshakya/leetcode/tree/master/1426-find-n-unique-integers-sum-up-to-zero) |\n| [1635-number-of-good-pairs](https://github.com/devxoshakya/leetcode/tree/master/1635-number-of-good-pairs) |\n## Divide and Conquer\n|  |\n| ------- |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/devxoshakya/leetcode/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/devxoshakya/leetcode/tree/master/0108-convert-sorted-array-to-binary-search-tree) |\n| [0148-sort-list](https://github.com/devxoshakya/leetcode/tree/master/0148-sort-list) |\n## Sorting\n|  |\n| ------- |\n| [0148-sort-list](https://github.com/devxoshakya/leetcode/tree/master/0148-sort-list) |\n| [1482-how-many-numbers-are-smaller-than-the-current-number](https://github.com/devxoshakya/leetcode/tree/master/1482-how-many-numbers-are-smaller-than-the-current-number) |\n## Merge Sort\n|  |\n| ------- |\n| [0148-sort-list](https://github.com/devxoshakya/leetcode/tree/master/0148-sort-list) |\n## Stack\n|  |\n| ------- |\n| [0020-valid-parentheses](https://github.com/devxoshakya/leetcode/tree/master/0020-valid-parentheses) |\n| [0084-largest-rectangle-in-histogram](https://github.com/devxoshakya/leetcode/tree/master/0084-largest-rectangle-in-histogram) |\n| [0094-binary-tree-inorder-traversal](https://github.com/devxoshakya/leetcode/tree/master/0094-binary-tree-inorder-traversal) |\n| [0114-flatten-binary-tree-to-linked-list](https://github.com/devxoshakya/leetcode/tree/master/0114-flatten-binary-tree-to-linked-list) |\n| [0143-reorder-list](https://github.com/devxoshakya/leetcode/tree/master/0143-reorder-list) |\n| [0145-binary-tree-postorder-traversal](https://github.com/devxoshakya/leetcode/tree/master/0145-binary-tree-postorder-traversal) |\n| [0232-implement-queue-using-stacks](https://github.com/devxoshakya/leetcode/tree/master/0232-implement-queue-using-stacks) |\n| [0234-palindrome-linked-list](https://github.com/devxoshakya/leetcode/tree/master/0234-palindrome-linked-list) |\n| [0957-minimum-add-to-make-parentheses-valid](https://github.com/devxoshakya/leetcode/tree/master/0957-minimum-add-to-make-parentheses-valid) |\n| [1648-minimum-insertions-to-balance-a-parentheses-string](https://github.com/devxoshakya/leetcode/tree/master/1648-minimum-insertions-to-balance-a-parentheses-string) |\n## Design\n|  |\n| ------- |\n| [0232-implement-queue-using-stacks](https://github.com/devxoshakya/leetcode/tree/master/0232-implement-queue-using-stacks) |\n| [0817-design-hashmap](https://github.com/devxoshakya/leetcode/tree/master/0817-design-hashmap) |\n## Queue\n|  |\n| ------- |\n| [0232-implement-queue-using-stacks](https://github.com/devxoshakya/leetcode/tree/master/0232-implement-queue-using-stacks) |\n## Array\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/devxoshakya/leetcode/tree/master/0001-two-sum) |\n| [0027-remove-element](https://github.com/devxoshakya/leetcode/tree/master/0027-remove-element) |\n| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/devxoshakya/leetcode/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |\n| [0084-largest-rectangle-in-histogram](https://github.com/devxoshakya/leetcode/tree/master/0084-largest-rectangle-in-histogram) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/devxoshakya/leetcode/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/devxoshakya/leetcode/tree/master/0108-convert-sorted-array-to-binary-search-tree) |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/devxoshakya/leetcode/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n| [0817-design-hashmap](https://github.com/devxoshakya/leetcode/tree/master/0817-design-hashmap) |\n| [0861-flipping-an-image](https://github.com/devxoshakya/leetcode/tree/master/0861-flipping-an-image) |\n| [0898-transpose-matrix](https://github.com/devxoshakya/leetcode/tree/master/0898-transpose-matrix) |\n| [1031-add-to-array-form-of-integer](https://github.com/devxoshakya/leetcode/tree/master/1031-add-to-array-form-of-integer) |\n| [1378-cells-with-odd-values-in-a-matrix](https://github.com/devxoshakya/leetcode/tree/master/1378-cells-with-odd-values-in-a-matrix) |\n| [1421-find-numbers-with-even-number-of-digits](https://github.com/devxoshakya/leetcode/tree/master/1421-find-numbers-with-even-number-of-digits) |\n| [1426-find-n-unique-integers-sum-up-to-zero](https://github.com/devxoshakya/leetcode/tree/master/1426-find-n-unique-integers-sum-up-to-zero) |\n| [1482-how-many-numbers-are-smaller-than-the-current-number](https://github.com/devxoshakya/leetcode/tree/master/1482-how-many-numbers-are-smaller-than-the-current-number) |\n| [1496-lucky-numbers-in-a-matrix](https://github.com/devxoshakya/leetcode/tree/master/1496-lucky-numbers-in-a-matrix) |\n| [1505-create-target-array-in-the-given-order](https://github.com/devxoshakya/leetcode/tree/master/1505-create-target-array-in-the-given-order) |\n| [1528-kids-with-the-greatest-number-of-candies](https://github.com/devxoshakya/leetcode/tree/master/1528-kids-with-the-greatest-number-of-candies) |\n| [1580-shuffle-the-array](https://github.com/devxoshakya/leetcode/tree/master/1580-shuffle-the-array) |\n| [1603-running-sum-of-1d-array](https://github.com/devxoshakya/leetcode/tree/master/1603-running-sum-of-1d-array) |\n| [1635-number-of-good-pairs](https://github.com/devxoshakya/leetcode/tree/master/1635-number-of-good-pairs) |\n| [1677-matrix-diagonal-sum](https://github.com/devxoshakya/leetcode/tree/master/1677-matrix-diagonal-sum) |\n| [1791-richest-customer-wealth](https://github.com/devxoshakya/leetcode/tree/master/1791-richest-customer-wealth) |\n| [1899-count-items-matching-a-rule](https://github.com/devxoshakya/leetcode/tree/master/1899-count-items-matching-a-rule) |\n| [2048-build-array-from-permutation](https://github.com/devxoshakya/leetcode/tree/master/2048-build-array-from-permutation) |\n| [2058-concatenation-of-array](https://github.com/devxoshakya/leetcode/tree/master/2058-concatenation-of-array) |\n| [2350-find-closest-number-to-zero](https://github.com/devxoshakya/leetcode/tree/master/2350-find-closest-number-to-zero) |\n## Monotonic Stack\n|  |\n| ------- |\n| [0084-largest-rectangle-in-histogram](https://github.com/devxoshakya/leetcode/tree/master/0084-largest-rectangle-in-histogram) |\n## String\n|  |\n| ------- |\n| [0013-roman-to-integer](https://github.com/devxoshakya/leetcode/tree/master/0013-roman-to-integer) |\n| [0014-longest-common-prefix](https://github.com/devxoshakya/leetcode/tree/master/0014-longest-common-prefix) |\n| [0020-valid-parentheses](https://github.com/devxoshakya/leetcode/tree/master/0020-valid-parentheses) |\n| [0067-add-binary](https://github.com/devxoshakya/leetcode/tree/master/0067-add-binary) |\n| [0957-minimum-add-to-make-parentheses-valid](https://github.com/devxoshakya/leetcode/tree/master/0957-minimum-add-to-make-parentheses-valid) |\n| [1648-minimum-insertions-to-balance-a-parentheses-string](https://github.com/devxoshakya/leetcode/tree/master/1648-minimum-insertions-to-balance-a-parentheses-string) |\n| [1899-count-items-matching-a-rule](https://github.com/devxoshakya/leetcode/tree/master/1899-count-items-matching-a-rule) |\n| [1960-check-if-the-sentence-is-pangram](https://github.com/devxoshakya/leetcode/tree/master/1960-check-if-the-sentence-is-pangram) |\n## Greedy\n|  |\n| ------- |\n| [0957-minimum-add-to-make-parentheses-valid](https://github.com/devxoshakya/leetcode/tree/master/0957-minimum-add-to-make-parentheses-valid) |\n| [1648-minimum-insertions-to-balance-a-parentheses-string](https://github.com/devxoshakya/leetcode/tree/master/1648-minimum-insertions-to-balance-a-parentheses-string) |\n## Tree\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/devxoshakya/leetcode/tree/master/0094-binary-tree-inorder-traversal) |\n| [0098-validate-binary-search-tree](https://github.com/devxoshakya/leetcode/tree/master/0098-validate-binary-search-tree) |\n| [0100-same-tree](https://github.com/devxoshakya/leetcode/tree/master/0100-same-tree) |\n| [0101-symmetric-tree](https://github.com/devxoshakya/leetcode/tree/master/0101-symmetric-tree) |\n| [0102-binary-tree-level-order-traversal](https://github.com/devxoshakya/leetcode/tree/master/0102-binary-tree-level-order-traversal) |\n| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/devxoshakya/leetcode/tree/master/0103-binary-tree-zigzag-level-order-traversal) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/devxoshakya/leetcode/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/devxoshakya/leetcode/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0107-binary-tree-level-order-traversal-ii](https://github.com/devxoshakya/leetcode/tree/master/0107-binary-tree-level-order-traversal-ii) |\n| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/devxoshakya/leetcode/tree/master/0108-convert-sorted-array-to-binary-search-tree) |\n| [0114-flatten-binary-tree-to-linked-list](https://github.com/devxoshakya/leetcode/tree/master/0114-flatten-binary-tree-to-linked-list) |\n| [0116-populating-next-right-pointers-in-each-node](https://github.com/devxoshakya/leetcode/tree/master/0116-populating-next-right-pointers-in-each-node) |\n| [0145-binary-tree-postorder-traversal](https://github.com/devxoshakya/leetcode/tree/master/0145-binary-tree-postorder-traversal) |\n| [0199-binary-tree-right-side-view](https://github.com/devxoshakya/leetcode/tree/master/0199-binary-tree-right-side-view) |\n| [0222-count-complete-tree-nodes](https://github.com/devxoshakya/leetcode/tree/master/0222-count-complete-tree-nodes) |\n| [0226-invert-binary-tree](https://github.com/devxoshakya/leetcode/tree/master/0226-invert-binary-tree) |\n| [0230-kth-smallest-element-in-a-bst](https://github.com/devxoshakya/leetcode/tree/master/0230-kth-smallest-element-in-a-bst) |\n| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/devxoshakya/leetcode/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |\n| [0543-diameter-of-binary-tree](https://github.com/devxoshakya/leetcode/tree/master/0543-diameter-of-binary-tree) |\n| [0637-average-of-levels-in-binary-tree](https://github.com/devxoshakya/leetcode/tree/master/0637-average-of-levels-in-binary-tree) |\n| [1035-cousins-in-binary-tree](https://github.com/devxoshakya/leetcode/tree/master/1035-cousins-in-binary-tree) |\n## Breadth-First Search\n|  |\n| ------- |\n| [0100-same-tree](https://github.com/devxoshakya/leetcode/tree/master/0100-same-tree) |\n| [0101-symmetric-tree](https://github.com/devxoshakya/leetcode/tree/master/0101-symmetric-tree) |\n| [0102-binary-tree-level-order-traversal](https://github.com/devxoshakya/leetcode/tree/master/0102-binary-tree-level-order-traversal) |\n| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/devxoshakya/leetcode/tree/master/0103-binary-tree-zigzag-level-order-traversal) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/devxoshakya/leetcode/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0107-binary-tree-level-order-traversal-ii](https://github.com/devxoshakya/leetcode/tree/master/0107-binary-tree-level-order-traversal-ii) |\n| [0116-populating-next-right-pointers-in-each-node](https://github.com/devxoshakya/leetcode/tree/master/0116-populating-next-right-pointers-in-each-node) |\n| [0199-binary-tree-right-side-view](https://github.com/devxoshakya/leetcode/tree/master/0199-binary-tree-right-side-view) |\n| [0226-invert-binary-tree](https://github.com/devxoshakya/leetcode/tree/master/0226-invert-binary-tree) |\n| [0637-average-of-levels-in-binary-tree](https://github.com/devxoshakya/leetcode/tree/master/0637-average-of-levels-in-binary-tree) |\n| [1035-cousins-in-binary-tree](https://github.com/devxoshakya/leetcode/tree/master/1035-cousins-in-binary-tree) |\n## Binary Tree\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/devxoshakya/leetcode/tree/master/0094-binary-tree-inorder-traversal) |\n| [0098-validate-binary-search-tree](https://github.com/devxoshakya/leetcode/tree/master/0098-validate-binary-search-tree) |\n| [0100-same-tree](https://github.com/devxoshakya/leetcode/tree/master/0100-same-tree) |\n| [0101-symmetric-tree](https://github.com/devxoshakya/leetcode/tree/master/0101-symmetric-tree) |\n| [0102-binary-tree-level-order-traversal](https://github.com/devxoshakya/leetcode/tree/master/0102-binary-tree-level-order-traversal) |\n| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/devxoshakya/leetcode/tree/master/0103-binary-tree-zigzag-level-order-traversal) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/devxoshakya/leetcode/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0105-construct-binary-tree-from-preorder-and-inorder-traversal](https://github.com/devxoshakya/leetcode/tree/master/0105-construct-binary-tree-from-preorder-and-inorder-traversal) |\n| [0107-binary-tree-level-order-traversal-ii](https://github.com/devxoshakya/leetcode/tree/master/0107-binary-tree-level-order-traversal-ii) |\n| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/devxoshakya/leetcode/tree/master/0108-convert-sorted-array-to-binary-search-tree) |\n| [0114-flatten-binary-tree-to-linked-list](https://github.com/devxoshakya/leetcode/tree/master/0114-flatten-binary-tree-to-linked-list) |\n| [0116-populating-next-right-pointers-in-each-node](https://github.com/devxoshakya/leetcode/tree/master/0116-populating-next-right-pointers-in-each-node) |\n| [0145-binary-tree-postorder-traversal](https://github.com/devxoshakya/leetcode/tree/master/0145-binary-tree-postorder-traversal) |\n| [0199-binary-tree-right-side-view](https://github.com/devxoshakya/leetcode/tree/master/0199-binary-tree-right-side-view) |\n| [0222-count-complete-tree-nodes](https://github.com/devxoshakya/leetcode/tree/master/0222-count-complete-tree-nodes) |\n| [0226-invert-binary-tree](https://github.com/devxoshakya/leetcode/tree/master/0226-invert-binary-tree) |\n| [0230-kth-smallest-element-in-a-bst](https://github.com/devxoshakya/leetcode/tree/master/0230-kth-smallest-element-in-a-bst) |\n| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/devxoshakya/leetcode/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |\n| [0543-diameter-of-binary-tree](https://github.com/devxoshakya/leetcode/tree/master/0543-diameter-of-binary-tree) |\n| [0637-average-of-levels-in-binary-tree](https://github.com/devxoshakya/leetcode/tree/master/0637-average-of-levels-in-binary-tree) |\n| [1035-cousins-in-binary-tree](https://github.com/devxoshakya/leetcode/tree/master/1035-cousins-in-binary-tree) |\n## Depth-First Search\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/devxoshakya/leetcode/tree/master/0094-binary-tree-inorder-traversal) |\n| [0098-validate-binary-search-tree](https://github.com/devxoshakya/leetcode/tree/master/0098-validate-binary-search-tree) |\n| [0100-same-tree](https://github.com/devxoshakya/leetcode/tree/master/0100-same-tree) |\n| [0101-symmetric-tree](https://github.com/devxoshakya/leetcode/tree/master/0101-symmetric-tree) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/devxoshakya/leetcode/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0114-flatten-binary-tree-to-linked-list](https://github.com/devxoshakya/leetcode/tree/master/0114-flatten-binary-tree-to-linked-list) |\n| [0116-populating-next-right-pointers-in-each-node](https://github.com/devxoshakya/leetcode/tree/master/0116-populating-next-right-pointers-in-each-node) |\n| [0145-binary-tree-postorder-traversal](https://github.com/devxoshakya/leetcode/tree/master/0145-binary-tree-postorder-traversal) |\n| [0199-binary-tree-right-side-view](https://github.com/devxoshakya/leetcode/tree/master/0199-binary-tree-right-side-view) |\n| [0226-invert-binary-tree](https://github.com/devxoshakya/leetcode/tree/master/0226-invert-binary-tree) |\n| [0230-kth-smallest-element-in-a-bst](https://github.com/devxoshakya/leetcode/tree/master/0230-kth-smallest-element-in-a-bst) |\n| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/devxoshakya/leetcode/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |\n| [0543-diameter-of-binary-tree](https://github.com/devxoshakya/leetcode/tree/master/0543-diameter-of-binary-tree) |\n| [0637-average-of-levels-in-binary-tree](https://github.com/devxoshakya/leetcode/tree/master/0637-average-of-levels-in-binary-tree) |\n| [1035-cousins-in-binary-tree](https://github.com/devxoshakya/leetcode/tree/master/1035-cousins-in-binary-tree) |\n## Binary Search Tree\n|  |\n| ------- |\n| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/devxoshakya/leetcode/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |\n| [0069-sqrtx](https://github.com/devxoshakya/leetcode/tree/master/0069-sqrtx) |\n| [0098-validate-binary-search-tree](https://github.com/devxoshakya/leetcode/tree/master/0098-validate-binary-search-tree) |\n| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/devxoshakya/leetcode/tree/master/0108-convert-sorted-array-to-binary-search-tree) |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/devxoshakya/leetcode/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n| [0222-count-complete-tree-nodes](https://github.com/devxoshakya/leetcode/tree/master/0222-count-complete-tree-nodes) |\n| [0230-kth-smallest-element-in-a-bst](https://github.com/devxoshakya/leetcode/tree/master/0230-kth-smallest-element-in-a-bst) |\n| [0278-first-bad-version](https://github.com/devxoshakya/leetcode/tree/master/0278-first-bad-version) |\n| [0367-valid-perfect-square](https://github.com/devxoshakya/leetcode/tree/master/0367-valid-perfect-square) |\n| [0374-guess-number-higher-or-lower](https://github.com/devxoshakya/leetcode/tree/master/0374-guess-number-higher-or-lower) |\n| [0441-arranging-coins](https://github.com/devxoshakya/leetcode/tree/master/0441-arranging-coins) |\n## Simulation\n|  |\n| ------- |\n| [0067-add-binary](https://github.com/devxoshakya/leetcode/tree/master/0067-add-binary) |\n| [0861-flipping-an-image](https://github.com/devxoshakya/leetcode/tree/master/0861-flipping-an-image) |\n| [0898-transpose-matrix](https://github.com/devxoshakya/leetcode/tree/master/0898-transpose-matrix) |\n| [1378-cells-with-odd-values-in-a-matrix](https://github.com/devxoshakya/leetcode/tree/master/1378-cells-with-odd-values-in-a-matrix) |\n| [1505-create-target-array-in-the-given-order](https://github.com/devxoshakya/leetcode/tree/master/1505-create-target-array-in-the-given-order) |\n| [2048-build-array-from-permutation](https://github.com/devxoshakya/leetcode/tree/master/2048-build-array-from-permutation) |\n| [2058-concatenation-of-array](https://github.com/devxoshakya/leetcode/tree/master/2058-concatenation-of-array) |\n## Prefix Sum\n|  |\n| ------- |\n| [1603-running-sum-of-1d-array](https://github.com/devxoshakya/leetcode/tree/master/1603-running-sum-of-1d-array) |\n## Matrix\n|  |\n| ------- |\n| [0861-flipping-an-image](https://github.com/devxoshakya/leetcode/tree/master/0861-flipping-an-image) |\n| [0898-transpose-matrix](https://github.com/devxoshakya/leetcode/tree/master/0898-transpose-matrix) |\n| [1496-lucky-numbers-in-a-matrix](https://github.com/devxoshakya/leetcode/tree/master/1496-lucky-numbers-in-a-matrix) |\n| [1677-matrix-diagonal-sum](https://github.com/devxoshakya/leetcode/tree/master/1677-matrix-diagonal-sum) |\n| [1791-richest-customer-wealth](https://github.com/devxoshakya/leetcode/tree/master/1791-richest-customer-wealth) |\n## Counting\n|  |\n| ------- |\n| [1482-how-many-numbers-are-smaller-than-the-current-number](https://github.com/devxoshakya/leetcode/tree/master/1482-how-many-numbers-are-smaller-than-the-current-number) |\n| [1635-number-of-good-pairs](https://github.com/devxoshakya/leetcode/tree/master/1635-number-of-good-pairs) |\n## Bit Manipulation\n|  |\n| ------- |\n| [0067-add-binary](https://github.com/devxoshakya/leetcode/tree/master/0067-add-binary) |\n| [0222-count-complete-tree-nodes](https://github.com/devxoshakya/leetcode/tree/master/0222-count-complete-tree-nodes) |\n| [0861-flipping-an-image](https://github.com/devxoshakya/leetcode/tree/master/0861-flipping-an-image) |\n## Trie\n|  |\n| ------- |\n| [0014-longest-common-prefix](https://github.com/devxoshakya/leetcode/tree/master/0014-longest-common-prefix) |\n## Hash Function\n|  |\n| ------- |\n| [0817-design-hashmap](https://github.com/devxoshakya/leetcode/tree/master/0817-design-hashmap) |\n## Interactive\n|  |\n| ------- |\n| [0278-first-bad-version](https://github.com/devxoshakya/leetcode/tree/master/0278-first-bad-version) |\n| [0374-guess-number-higher-or-lower](https://github.com/devxoshakya/leetcode/tree/master/0374-guess-number-higher-or-lower) |\n## Concurrency\n|  |\n| ------- |\n| [1203-print-in-order](https://github.com/devxoshakya/leetcode/tree/master/1203-print-in-order) |\n\u003c!---LeetCode Topics End--\u003e","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdevxoshakya%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdevxoshakya%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdevxoshakya%2Fleetcode/lists"}