{"id":25868544,"url":"https://github.com/nishant25kr/dsa-codes","last_synced_at":"2025-03-02T04:38:51.264Z","repository":{"id":277339630,"uuid":"893737935","full_name":"nishant25kr/DSA-codes","owner":"nishant25kr","description":"A collection of LeetCode questions to ace the coding interview! ","archived":false,"fork":false,"pushed_at":"2025-02-28T10:59:19.000Z","size":250,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-28T17:13:28.565Z","etag":null,"topics":["cpp","dsa-algorithm","leetcode-cpp"],"latest_commit_sha":null,"homepage":"","language":"C++","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/nishant25kr.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-11-25T05:51:15.000Z","updated_at":"2025-02-28T10:59:21.000Z","dependencies_parsed_at":"2025-02-28T11:32:15.151Z","dependency_job_id":"e9309bee-c072-4874-8744-627749bf5369","html_url":"https://github.com/nishant25kr/DSA-codes","commit_stats":null,"previous_names":["nishant25kr/dsa-codes"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nishant25kr%2FDSA-codes","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nishant25kr%2FDSA-codes/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nishant25kr%2FDSA-codes/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nishant25kr%2FDSA-codes/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/nishant25kr","download_url":"https://codeload.github.com/nishant25kr/DSA-codes/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241460062,"owners_count":19966511,"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":["cpp","dsa-algorithm","leetcode-cpp"],"created_at":"2025-03-02T04:38:50.659Z","updated_at":"2025-03-02T04:38:51.256Z","avatar_url":"https://github.com/nishant25kr.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# DSA-codes\nA collection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)\n\n\u003c!---LeetCode Topics Start--\u003e\n# LeetCode Topics\n## Array\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/nishant25kr/DSA-codes/tree/master/0001-two-sum) |\n| [0031-next-permutation](https://github.com/nishant25kr/DSA-codes/tree/master/0031-next-permutation) |\n| [0045-jump-game-ii](https://github.com/nishant25kr/DSA-codes/tree/master/0045-jump-game-ii) |\n| [0048-rotate-image](https://github.com/nishant25kr/DSA-codes/tree/master/0048-rotate-image) |\n| [0053-maximum-subarray](https://github.com/nishant25kr/DSA-codes/tree/master/0053-maximum-subarray) |\n| [0054-spiral-matrix](https://github.com/nishant25kr/DSA-codes/tree/master/0054-spiral-matrix) |\n| [0055-jump-game](https://github.com/nishant25kr/DSA-codes/tree/master/0055-jump-game) |\n| [0073-set-matrix-zeroes](https://github.com/nishant25kr/DSA-codes/tree/master/0073-set-matrix-zeroes) |\n| [0075-sort-colors](https://github.com/nishant25kr/DSA-codes/tree/master/0075-sort-colors) |\n| [0088-merge-sorted-array](https://github.com/nishant25kr/DSA-codes/tree/master/0088-merge-sorted-array) |\n| [0121-best-time-to-buy-and-sell-stock](https://github.com/nishant25kr/DSA-codes/tree/master/0121-best-time-to-buy-and-sell-stock) |\n| [0128-longest-consecutive-sequence](https://github.com/nishant25kr/DSA-codes/tree/master/0128-longest-consecutive-sequence) |\n| [0136-single-number](https://github.com/nishant25kr/DSA-codes/tree/master/0136-single-number) |\n| [0162-find-peak-element](https://github.com/nishant25kr/DSA-codes/tree/master/0162-find-peak-element) |\n| [0169-majority-element](https://github.com/nishant25kr/DSA-codes/tree/master/0169-majority-element) |\n| [0229-majority-element-ii](https://github.com/nishant25kr/DSA-codes/tree/master/0229-majority-element-ii) |\n| [0268-missing-number](https://github.com/nishant25kr/DSA-codes/tree/master/0268-missing-number) |\n| [0455-assign-cookies](https://github.com/nishant25kr/DSA-codes/tree/master/0455-assign-cookies) |\n| [0485-max-consecutive-ones](https://github.com/nishant25kr/DSA-codes/tree/master/0485-max-consecutive-ones) |\n| [0890-lemonade-change](https://github.com/nishant25kr/DSA-codes/tree/master/0890-lemonade-change) |\n| [0966-binary-subarrays-with-sum](https://github.com/nishant25kr/DSA-codes/tree/master/0966-binary-subarrays-with-sum) |\n| [1046-max-consecutive-ones-iii](https://github.com/nishant25kr/DSA-codes/tree/master/1046-max-consecutive-ones-iii) |\n| [1370-count-number-of-nice-subarrays](https://github.com/nishant25kr/DSA-codes/tree/master/1370-count-number-of-nice-subarrays) |\n| [1408-find-the-smallest-divisor-given-a-threshold](https://github.com/nishant25kr/DSA-codes/tree/master/1408-find-the-smallest-divisor-given-a-threshold) |\n| [1538-maximum-points-you-can-obtain-from-cards](https://github.com/nishant25kr/DSA-codes/tree/master/1538-maximum-points-you-can-obtain-from-cards) |\n| [1878-check-if-array-is-sorted-and-rotated](https://github.com/nishant25kr/DSA-codes/tree/master/1878-check-if-array-is-sorted-and-rotated) |\n| [2271-rearrange-array-elements-by-sign](https://github.com/nishant25kr/DSA-codes/tree/master/2271-rearrange-array-elements-by-sign) |\n## Hash Table\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/nishant25kr/DSA-codes/tree/master/0001-two-sum) |\n| [0003-longest-substring-without-repeating-characters](https://github.com/nishant25kr/DSA-codes/tree/master/0003-longest-substring-without-repeating-characters) |\n| [0073-set-matrix-zeroes](https://github.com/nishant25kr/DSA-codes/tree/master/0073-set-matrix-zeroes) |\n| [0128-longest-consecutive-sequence](https://github.com/nishant25kr/DSA-codes/tree/master/0128-longest-consecutive-sequence) |\n| [0141-linked-list-cycle](https://github.com/nishant25kr/DSA-codes/tree/master/0141-linked-list-cycle) |\n| [0142-linked-list-cycle-ii](https://github.com/nishant25kr/DSA-codes/tree/master/0142-linked-list-cycle-ii) |\n| [0160-intersection-of-two-linked-lists](https://github.com/nishant25kr/DSA-codes/tree/master/0160-intersection-of-two-linked-lists) |\n| [0169-majority-element](https://github.com/nishant25kr/DSA-codes/tree/master/0169-majority-element) |\n| [0229-majority-element-ii](https://github.com/nishant25kr/DSA-codes/tree/master/0229-majority-element-ii) |\n| [0268-missing-number](https://github.com/nishant25kr/DSA-codes/tree/master/0268-missing-number) |\n| [0424-longest-repeating-character-replacement](https://github.com/nishant25kr/DSA-codes/tree/master/0424-longest-repeating-character-replacement) |\n| [0966-binary-subarrays-with-sum](https://github.com/nishant25kr/DSA-codes/tree/master/0966-binary-subarrays-with-sum) |\n| [1370-count-number-of-nice-subarrays](https://github.com/nishant25kr/DSA-codes/tree/master/1370-count-number-of-nice-subarrays) |\n| [1460-number-of-substrings-containing-all-three-characters](https://github.com/nishant25kr/DSA-codes/tree/master/1460-number-of-substrings-containing-all-three-characters) |\n## Math\n|  |\n| ------- |\n| [0048-rotate-image](https://github.com/nishant25kr/DSA-codes/tree/master/0048-rotate-image) |\n| [0050-powx-n](https://github.com/nishant25kr/DSA-codes/tree/master/0050-powx-n) |\n| [0231-power-of-two](https://github.com/nishant25kr/DSA-codes/tree/master/0231-power-of-two) |\n| [0268-missing-number](https://github.com/nishant25kr/DSA-codes/tree/master/0268-missing-number) |\n| [1370-count-number-of-nice-subarrays](https://github.com/nishant25kr/DSA-codes/tree/master/1370-count-number-of-nice-subarrays) |\n## Binary Search\n|  |\n| ------- |\n| [0162-find-peak-element](https://github.com/nishant25kr/DSA-codes/tree/master/0162-find-peak-element) |\n| [0268-missing-number](https://github.com/nishant25kr/DSA-codes/tree/master/0268-missing-number) |\n| [1046-max-consecutive-ones-iii](https://github.com/nishant25kr/DSA-codes/tree/master/1046-max-consecutive-ones-iii) |\n| [1408-find-the-smallest-divisor-given-a-threshold](https://github.com/nishant25kr/DSA-codes/tree/master/1408-find-the-smallest-divisor-given-a-threshold) |\n## Bit Manipulation\n|  |\n| ------- |\n| [0136-single-number](https://github.com/nishant25kr/DSA-codes/tree/master/0136-single-number) |\n| [0231-power-of-two](https://github.com/nishant25kr/DSA-codes/tree/master/0231-power-of-two) |\n| [0268-missing-number](https://github.com/nishant25kr/DSA-codes/tree/master/0268-missing-number) |\n## Sorting\n|  |\n| ------- |\n| [0075-sort-colors](https://github.com/nishant25kr/DSA-codes/tree/master/0075-sort-colors) |\n| [0088-merge-sorted-array](https://github.com/nishant25kr/DSA-codes/tree/master/0088-merge-sorted-array) |\n| [0169-majority-element](https://github.com/nishant25kr/DSA-codes/tree/master/0169-majority-element) |\n| [0229-majority-element-ii](https://github.com/nishant25kr/DSA-codes/tree/master/0229-majority-element-ii) |\n| [0268-missing-number](https://github.com/nishant25kr/DSA-codes/tree/master/0268-missing-number) |\n| [0455-assign-cookies](https://github.com/nishant25kr/DSA-codes/tree/master/0455-assign-cookies) |\n## Two Pointers\n|  |\n| ------- |\n| [0019-remove-nth-node-from-end-of-list](https://github.com/nishant25kr/DSA-codes/tree/master/0019-remove-nth-node-from-end-of-list) |\n| [0031-next-permutation](https://github.com/nishant25kr/DSA-codes/tree/master/0031-next-permutation) |\n| [0075-sort-colors](https://github.com/nishant25kr/DSA-codes/tree/master/0075-sort-colors) |\n| [0088-merge-sorted-array](https://github.com/nishant25kr/DSA-codes/tree/master/0088-merge-sorted-array) |\n| [0141-linked-list-cycle](https://github.com/nishant25kr/DSA-codes/tree/master/0141-linked-list-cycle) |\n| [0142-linked-list-cycle-ii](https://github.com/nishant25kr/DSA-codes/tree/master/0142-linked-list-cycle-ii) |\n| [0160-intersection-of-two-linked-lists](https://github.com/nishant25kr/DSA-codes/tree/master/0160-intersection-of-two-linked-lists) |\n| [0455-assign-cookies](https://github.com/nishant25kr/DSA-codes/tree/master/0455-assign-cookies) |\n| [0908-middle-of-the-linked-list](https://github.com/nishant25kr/DSA-codes/tree/master/0908-middle-of-the-linked-list) |\n| [2216-delete-the-middle-node-of-a-linked-list](https://github.com/nishant25kr/DSA-codes/tree/master/2216-delete-the-middle-node-of-a-linked-list) |\n| [2271-rearrange-array-elements-by-sign](https://github.com/nishant25kr/DSA-codes/tree/master/2271-rearrange-array-elements-by-sign) |\n## Dynamic Programming\n|  |\n| ------- |\n| [0045-jump-game-ii](https://github.com/nishant25kr/DSA-codes/tree/master/0045-jump-game-ii) |\n| [0053-maximum-subarray](https://github.com/nishant25kr/DSA-codes/tree/master/0053-maximum-subarray) |\n| [0055-jump-game](https://github.com/nishant25kr/DSA-codes/tree/master/0055-jump-game) |\n| [0121-best-time-to-buy-and-sell-stock](https://github.com/nishant25kr/DSA-codes/tree/master/0121-best-time-to-buy-and-sell-stock) |\n## Simulation\n|  |\n| ------- |\n| [0054-spiral-matrix](https://github.com/nishant25kr/DSA-codes/tree/master/0054-spiral-matrix) |\n| [2271-rearrange-array-elements-by-sign](https://github.com/nishant25kr/DSA-codes/tree/master/2271-rearrange-array-elements-by-sign) |\n## Union Find\n|  |\n| ------- |\n| [0128-longest-consecutive-sequence](https://github.com/nishant25kr/DSA-codes/tree/master/0128-longest-consecutive-sequence) |\n## Linked List\n|  |\n| ------- |\n| [0019-remove-nth-node-from-end-of-list](https://github.com/nishant25kr/DSA-codes/tree/master/0019-remove-nth-node-from-end-of-list) |\n| [0141-linked-list-cycle](https://github.com/nishant25kr/DSA-codes/tree/master/0141-linked-list-cycle) |\n| [0142-linked-list-cycle-ii](https://github.com/nishant25kr/DSA-codes/tree/master/0142-linked-list-cycle-ii) |\n| [0160-intersection-of-two-linked-lists](https://github.com/nishant25kr/DSA-codes/tree/master/0160-intersection-of-two-linked-lists) |\n| [0206-reverse-linked-list](https://github.com/nishant25kr/DSA-codes/tree/master/0206-reverse-linked-list) |\n| [0237-delete-node-in-a-linked-list](https://github.com/nishant25kr/DSA-codes/tree/master/0237-delete-node-in-a-linked-list) |\n| [0908-middle-of-the-linked-list](https://github.com/nishant25kr/DSA-codes/tree/master/0908-middle-of-the-linked-list) |\n| [2216-delete-the-middle-node-of-a-linked-list](https://github.com/nishant25kr/DSA-codes/tree/master/2216-delete-the-middle-node-of-a-linked-list) |\n## Recursion\n|  |\n| ------- |\n| [0050-powx-n](https://github.com/nishant25kr/DSA-codes/tree/master/0050-powx-n) |\n| [0206-reverse-linked-list](https://github.com/nishant25kr/DSA-codes/tree/master/0206-reverse-linked-list) |\n| [0231-power-of-two](https://github.com/nishant25kr/DSA-codes/tree/master/0231-power-of-two) |\n## String\n|  |\n| ------- |\n| [0003-longest-substring-without-repeating-characters](https://github.com/nishant25kr/DSA-codes/tree/master/0003-longest-substring-without-repeating-characters) |\n| [0020-valid-parentheses](https://github.com/nishant25kr/DSA-codes/tree/master/0020-valid-parentheses) |\n| [0424-longest-repeating-character-replacement](https://github.com/nishant25kr/DSA-codes/tree/master/0424-longest-repeating-character-replacement) |\n| [1460-number-of-substrings-containing-all-three-characters](https://github.com/nishant25kr/DSA-codes/tree/master/1460-number-of-substrings-containing-all-three-characters) |\n## Stack\n|  |\n| ------- |\n| [0020-valid-parentheses](https://github.com/nishant25kr/DSA-codes/tree/master/0020-valid-parentheses) |\n| [0094-binary-tree-inorder-traversal](https://github.com/nishant25kr/DSA-codes/tree/master/0094-binary-tree-inorder-traversal) |\n| [0144-binary-tree-preorder-traversal](https://github.com/nishant25kr/DSA-codes/tree/master/0144-binary-tree-preorder-traversal) |\n| [0145-binary-tree-postorder-traversal](https://github.com/nishant25kr/DSA-codes/tree/master/0145-binary-tree-postorder-traversal) |\n## Greedy\n|  |\n| ------- |\n| [0045-jump-game-ii](https://github.com/nishant25kr/DSA-codes/tree/master/0045-jump-game-ii) |\n| [0055-jump-game](https://github.com/nishant25kr/DSA-codes/tree/master/0055-jump-game) |\n| [0455-assign-cookies](https://github.com/nishant25kr/DSA-codes/tree/master/0455-assign-cookies) |\n| [0890-lemonade-change](https://github.com/nishant25kr/DSA-codes/tree/master/0890-lemonade-change) |\n## Sliding Window\n|  |\n| ------- |\n| [0003-longest-substring-without-repeating-characters](https://github.com/nishant25kr/DSA-codes/tree/master/0003-longest-substring-without-repeating-characters) |\n| [0424-longest-repeating-character-replacement](https://github.com/nishant25kr/DSA-codes/tree/master/0424-longest-repeating-character-replacement) |\n| [0966-binary-subarrays-with-sum](https://github.com/nishant25kr/DSA-codes/tree/master/0966-binary-subarrays-with-sum) |\n| [1046-max-consecutive-ones-iii](https://github.com/nishant25kr/DSA-codes/tree/master/1046-max-consecutive-ones-iii) |\n| [1370-count-number-of-nice-subarrays](https://github.com/nishant25kr/DSA-codes/tree/master/1370-count-number-of-nice-subarrays) |\n| [1460-number-of-substrings-containing-all-three-characters](https://github.com/nishant25kr/DSA-codes/tree/master/1460-number-of-substrings-containing-all-three-characters) |\n| [1538-maximum-points-you-can-obtain-from-cards](https://github.com/nishant25kr/DSA-codes/tree/master/1538-maximum-points-you-can-obtain-from-cards) |\n## Prefix Sum\n|  |\n| ------- |\n| [0966-binary-subarrays-with-sum](https://github.com/nishant25kr/DSA-codes/tree/master/0966-binary-subarrays-with-sum) |\n| [1046-max-consecutive-ones-iii](https://github.com/nishant25kr/DSA-codes/tree/master/1046-max-consecutive-ones-iii) |\n| [1370-count-number-of-nice-subarrays](https://github.com/nishant25kr/DSA-codes/tree/master/1370-count-number-of-nice-subarrays) |\n| [1538-maximum-points-you-can-obtain-from-cards](https://github.com/nishant25kr/DSA-codes/tree/master/1538-maximum-points-you-can-obtain-from-cards) |\n## Divide and Conquer\n|  |\n| ------- |\n| [0053-maximum-subarray](https://github.com/nishant25kr/DSA-codes/tree/master/0053-maximum-subarray) |\n| [0169-majority-element](https://github.com/nishant25kr/DSA-codes/tree/master/0169-majority-element) |\n## Counting\n|  |\n| ------- |\n| [0169-majority-element](https://github.com/nishant25kr/DSA-codes/tree/master/0169-majority-element) |\n| [0229-majority-element-ii](https://github.com/nishant25kr/DSA-codes/tree/master/0229-majority-element-ii) |\n## Matrix\n|  |\n| ------- |\n| [0048-rotate-image](https://github.com/nishant25kr/DSA-codes/tree/master/0048-rotate-image) |\n| [0054-spiral-matrix](https://github.com/nishant25kr/DSA-codes/tree/master/0054-spiral-matrix) |\n| [0073-set-matrix-zeroes](https://github.com/nishant25kr/DSA-codes/tree/master/0073-set-matrix-zeroes) |\n## Tree\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/nishant25kr/DSA-codes/tree/master/0094-binary-tree-inorder-traversal) |\n| [0100-same-tree](https://github.com/nishant25kr/DSA-codes/tree/master/0100-same-tree) |\n| [0101-symmetric-tree](https://github.com/nishant25kr/DSA-codes/tree/master/0101-symmetric-tree) |\n| [0102-binary-tree-level-order-traversal](https://github.com/nishant25kr/DSA-codes/tree/master/0102-binary-tree-level-order-traversal) |\n| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/nishant25kr/DSA-codes/tree/master/0103-binary-tree-zigzag-level-order-traversal) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/nishant25kr/DSA-codes/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0144-binary-tree-preorder-traversal](https://github.com/nishant25kr/DSA-codes/tree/master/0144-binary-tree-preorder-traversal) |\n| [0145-binary-tree-postorder-traversal](https://github.com/nishant25kr/DSA-codes/tree/master/0145-binary-tree-postorder-traversal) |\n| [0199-binary-tree-right-side-view](https://github.com/nishant25kr/DSA-codes/tree/master/0199-binary-tree-right-side-view) |\n| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/nishant25kr/DSA-codes/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |\n| [0543-diameter-of-binary-tree](https://github.com/nishant25kr/DSA-codes/tree/master/0543-diameter-of-binary-tree) |\n## Depth-First Search\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/nishant25kr/DSA-codes/tree/master/0094-binary-tree-inorder-traversal) |\n| [0100-same-tree](https://github.com/nishant25kr/DSA-codes/tree/master/0100-same-tree) |\n| [0101-symmetric-tree](https://github.com/nishant25kr/DSA-codes/tree/master/0101-symmetric-tree) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/nishant25kr/DSA-codes/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0144-binary-tree-preorder-traversal](https://github.com/nishant25kr/DSA-codes/tree/master/0144-binary-tree-preorder-traversal) |\n| [0145-binary-tree-postorder-traversal](https://github.com/nishant25kr/DSA-codes/tree/master/0145-binary-tree-postorder-traversal) |\n| [0199-binary-tree-right-side-view](https://github.com/nishant25kr/DSA-codes/tree/master/0199-binary-tree-right-side-view) |\n| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/nishant25kr/DSA-codes/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |\n| [0543-diameter-of-binary-tree](https://github.com/nishant25kr/DSA-codes/tree/master/0543-diameter-of-binary-tree) |\n## Binary Tree\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/nishant25kr/DSA-codes/tree/master/0094-binary-tree-inorder-traversal) |\n| [0100-same-tree](https://github.com/nishant25kr/DSA-codes/tree/master/0100-same-tree) |\n| [0101-symmetric-tree](https://github.com/nishant25kr/DSA-codes/tree/master/0101-symmetric-tree) |\n| [0102-binary-tree-level-order-traversal](https://github.com/nishant25kr/DSA-codes/tree/master/0102-binary-tree-level-order-traversal) |\n| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/nishant25kr/DSA-codes/tree/master/0103-binary-tree-zigzag-level-order-traversal) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/nishant25kr/DSA-codes/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0144-binary-tree-preorder-traversal](https://github.com/nishant25kr/DSA-codes/tree/master/0144-binary-tree-preorder-traversal) |\n| [0145-binary-tree-postorder-traversal](https://github.com/nishant25kr/DSA-codes/tree/master/0145-binary-tree-postorder-traversal) |\n| [0199-binary-tree-right-side-view](https://github.com/nishant25kr/DSA-codes/tree/master/0199-binary-tree-right-side-view) |\n| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/nishant25kr/DSA-codes/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |\n| [0543-diameter-of-binary-tree](https://github.com/nishant25kr/DSA-codes/tree/master/0543-diameter-of-binary-tree) |\n## Breadth-First Search\n|  |\n| ------- |\n| [0100-same-tree](https://github.com/nishant25kr/DSA-codes/tree/master/0100-same-tree) |\n| [0101-symmetric-tree](https://github.com/nishant25kr/DSA-codes/tree/master/0101-symmetric-tree) |\n| [0102-binary-tree-level-order-traversal](https://github.com/nishant25kr/DSA-codes/tree/master/0102-binary-tree-level-order-traversal) |\n| [0103-binary-tree-zigzag-level-order-traversal](https://github.com/nishant25kr/DSA-codes/tree/master/0103-binary-tree-zigzag-level-order-traversal) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/nishant25kr/DSA-codes/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0199-binary-tree-right-side-view](https://github.com/nishant25kr/DSA-codes/tree/master/0199-binary-tree-right-side-view) |\n\u003c!---LeetCode Topics End--\u003e","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnishant25kr%2Fdsa-codes","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fnishant25kr%2Fdsa-codes","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnishant25kr%2Fdsa-codes/lists"}