{"id":21018528,"url":"https://github.com/sandyg6/problem-solving","last_synced_at":"2026-04-10T02:04:48.021Z","repository":{"id":238427265,"uuid":"795338972","full_name":"sandyg6/problem-solving","owner":"sandyg6","description":"Problem solving","archived":false,"fork":false,"pushed_at":"2024-05-22T15:24:23.000Z","size":127,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2024-05-22T15:39:17.932Z","etag":null,"topics":["c","cpp","java","python"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/sandyg6.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-05-03T04:15:31.000Z","updated_at":"2024-05-22T15:24:26.000Z","dependencies_parsed_at":"2024-05-22T15:39:17.385Z","dependency_job_id":"8549ea21-1dd1-4c82-8708-393da786cc4e","html_url":"https://github.com/sandyg6/problem-solving","commit_stats":null,"previous_names":["sandyg6/problem-solving"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sandyg6%2Fproblem-solving","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sandyg6%2Fproblem-solving/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sandyg6%2Fproblem-solving/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sandyg6%2Fproblem-solving/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sandyg6","download_url":"https://codeload.github.com/sandyg6/problem-solving/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243447638,"owners_count":20292453,"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":["c","cpp","java","python"],"created_at":"2024-11-19T10:26:28.186Z","updated_at":"2025-12-30T03:38:33.335Z","avatar_url":"https://github.com/sandyg6.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Problem-Solving\nPracticing LeetCode Problems\n\n\u003c!---LeetCode Topics Start--\u003e\n# LeetCode Topics\n## Array\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/sandyg6/Problem-Solving/tree/master/0001-two-sum) |\n| [0004-median-of-two-sorted-arrays](https://github.com/sandyg6/Problem-Solving/tree/master/0004-median-of-two-sorted-arrays) |\n| [0011-container-with-most-water](https://github.com/sandyg6/Problem-Solving/tree/master/0011-container-with-most-water) |\n| [0027-remove-element](https://github.com/sandyg6/Problem-Solving/tree/master/0027-remove-element) |\n| [0048-rotate-image](https://github.com/sandyg6/Problem-Solving/tree/master/0048-rotate-image) |\n| [0049-group-anagrams](https://github.com/sandyg6/Problem-Solving/tree/master/0049-group-anagrams) |\n| [0084-largest-rectangle-in-histogram](https://github.com/sandyg6/Problem-Solving/tree/master/0084-largest-rectangle-in-histogram) |\n| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0108-convert-sorted-array-to-binary-search-tree) |\n| [0134-gas-station](https://github.com/sandyg6/Problem-Solving/tree/master/0134-gas-station) |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/sandyg6/Problem-Solving/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n| [0283-move-zeroes](https://github.com/sandyg6/Problem-Solving/tree/master/0283-move-zeroes) |\n| [0645-set-mismatch](https://github.com/sandyg6/Problem-Solving/tree/master/0645-set-mismatch) |\n| [1319-unique-number-of-occurrences](https://github.com/sandyg6/Problem-Solving/tree/master/1319-unique-number-of-occurrences) |\n| [1505-create-target-array-in-the-given-order](https://github.com/sandyg6/Problem-Solving/tree/master/1505-create-target-array-in-the-given-order) |\n| [2058-concatenation-of-array](https://github.com/sandyg6/Problem-Solving/tree/master/2058-concatenation-of-array) |\n## Hash Table\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/sandyg6/Problem-Solving/tree/master/0001-two-sum) |\n| [0049-group-anagrams](https://github.com/sandyg6/Problem-Solving/tree/master/0049-group-anagrams) |\n| [0141-linked-list-cycle](https://github.com/sandyg6/Problem-Solving/tree/master/0141-linked-list-cycle) |\n| [0142-linked-list-cycle-ii](https://github.com/sandyg6/Problem-Solving/tree/master/0142-linked-list-cycle-ii) |\n| [0160-intersection-of-two-linked-lists](https://github.com/sandyg6/Problem-Solving/tree/master/0160-intersection-of-two-linked-lists) |\n| [0202-happy-number](https://github.com/sandyg6/Problem-Solving/tree/master/0202-happy-number) |\n| [0387-first-unique-character-in-a-string](https://github.com/sandyg6/Problem-Solving/tree/master/0387-first-unique-character-in-a-string) |\n| [0645-set-mismatch](https://github.com/sandyg6/Problem-Solving/tree/master/0645-set-mismatch) |\n| [1319-unique-number-of-occurrences](https://github.com/sandyg6/Problem-Solving/tree/master/1319-unique-number-of-occurrences) |\n## Stack\n|  |\n| ------- |\n| [0084-largest-rectangle-in-histogram](https://github.com/sandyg6/Problem-Solving/tree/master/0084-largest-rectangle-in-histogram) |\n| [0094-binary-tree-inorder-traversal](https://github.com/sandyg6/Problem-Solving/tree/master/0094-binary-tree-inorder-traversal) |\n| [0144-binary-tree-preorder-traversal](https://github.com/sandyg6/Problem-Solving/tree/master/0144-binary-tree-preorder-traversal) |\n| [0145-binary-tree-postorder-traversal](https://github.com/sandyg6/Problem-Solving/tree/master/0145-binary-tree-postorder-traversal) |\n| [0225-implement-stack-using-queues](https://github.com/sandyg6/Problem-Solving/tree/master/0225-implement-stack-using-queues) |\n| [0234-palindrome-linked-list](https://github.com/sandyg6/Problem-Solving/tree/master/0234-palindrome-linked-list) |\n## Monotonic Stack\n|  |\n| ------- |\n| [0084-largest-rectangle-in-histogram](https://github.com/sandyg6/Problem-Solving/tree/master/0084-largest-rectangle-in-histogram) |\n## String\n|  |\n| ------- |\n| [0049-group-anagrams](https://github.com/sandyg6/Problem-Solving/tree/master/0049-group-anagrams) |\n| [0125-valid-palindrome](https://github.com/sandyg6/Problem-Solving/tree/master/0125-valid-palindrome) |\n| [0151-reverse-words-in-a-string](https://github.com/sandyg6/Problem-Solving/tree/master/0151-reverse-words-in-a-string) |\n| [0297-serialize-and-deserialize-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0297-serialize-and-deserialize-binary-tree) |\n| [0344-reverse-string](https://github.com/sandyg6/Problem-Solving/tree/master/0344-reverse-string) |\n| [0345-reverse-vowels-of-a-string](https://github.com/sandyg6/Problem-Solving/tree/master/0345-reverse-vowels-of-a-string) |\n| [0387-first-unique-character-in-a-string](https://github.com/sandyg6/Problem-Solving/tree/master/0387-first-unique-character-in-a-string) |\n| [3636-check-balanced-string](https://github.com/sandyg6/Problem-Solving/tree/master/3636-check-balanced-string) |\n## Queue\n|  |\n| ------- |\n| [0225-implement-stack-using-queues](https://github.com/sandyg6/Problem-Solving/tree/master/0225-implement-stack-using-queues) |\n| [0387-first-unique-character-in-a-string](https://github.com/sandyg6/Problem-Solving/tree/master/0387-first-unique-character-in-a-string) |\n## Counting\n|  |\n| ------- |\n| [0387-first-unique-character-in-a-string](https://github.com/sandyg6/Problem-Solving/tree/master/0387-first-unique-character-in-a-string) |\n## Design\n|  |\n| ------- |\n| [0225-implement-stack-using-queues](https://github.com/sandyg6/Problem-Solving/tree/master/0225-implement-stack-using-queues) |\n| [0297-serialize-and-deserialize-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0297-serialize-and-deserialize-binary-tree) |\n## Greedy\n|  |\n| ------- |\n| [0011-container-with-most-water](https://github.com/sandyg6/Problem-Solving/tree/master/0011-container-with-most-water) |\n| [0134-gas-station](https://github.com/sandyg6/Problem-Solving/tree/master/0134-gas-station) |\n## Two Pointers\n|  |\n| ------- |\n| [0011-container-with-most-water](https://github.com/sandyg6/Problem-Solving/tree/master/0011-container-with-most-water) |\n| [0019-remove-nth-node-from-end-of-list](https://github.com/sandyg6/Problem-Solving/tree/master/0019-remove-nth-node-from-end-of-list) |\n| [0027-remove-element](https://github.com/sandyg6/Problem-Solving/tree/master/0027-remove-element) |\n| [0125-valid-palindrome](https://github.com/sandyg6/Problem-Solving/tree/master/0125-valid-palindrome) |\n| [0141-linked-list-cycle](https://github.com/sandyg6/Problem-Solving/tree/master/0141-linked-list-cycle) |\n| [0142-linked-list-cycle-ii](https://github.com/sandyg6/Problem-Solving/tree/master/0142-linked-list-cycle-ii) |\n| [0151-reverse-words-in-a-string](https://github.com/sandyg6/Problem-Solving/tree/master/0151-reverse-words-in-a-string) |\n| [0160-intersection-of-two-linked-lists](https://github.com/sandyg6/Problem-Solving/tree/master/0160-intersection-of-two-linked-lists) |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/sandyg6/Problem-Solving/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n| [0202-happy-number](https://github.com/sandyg6/Problem-Solving/tree/master/0202-happy-number) |\n| [0234-palindrome-linked-list](https://github.com/sandyg6/Problem-Solving/tree/master/0234-palindrome-linked-list) |\n| [0283-move-zeroes](https://github.com/sandyg6/Problem-Solving/tree/master/0283-move-zeroes) |\n| [0344-reverse-string](https://github.com/sandyg6/Problem-Solving/tree/master/0344-reverse-string) |\n| [0345-reverse-vowels-of-a-string](https://github.com/sandyg6/Problem-Solving/tree/master/0345-reverse-vowels-of-a-string) |\n| [0908-middle-of-the-linked-list](https://github.com/sandyg6/Problem-Solving/tree/master/0908-middle-of-the-linked-list) |\n## Linked List\n|  |\n| ------- |\n| [0019-remove-nth-node-from-end-of-list](https://github.com/sandyg6/Problem-Solving/tree/master/0019-remove-nth-node-from-end-of-list) |\n| [0021-merge-two-sorted-lists](https://github.com/sandyg6/Problem-Solving/tree/master/0021-merge-two-sorted-lists) |\n| [0083-remove-duplicates-from-sorted-list](https://github.com/sandyg6/Problem-Solving/tree/master/0083-remove-duplicates-from-sorted-list) |\n| [0141-linked-list-cycle](https://github.com/sandyg6/Problem-Solving/tree/master/0141-linked-list-cycle) |\n| [0142-linked-list-cycle-ii](https://github.com/sandyg6/Problem-Solving/tree/master/0142-linked-list-cycle-ii) |\n| [0160-intersection-of-two-linked-lists](https://github.com/sandyg6/Problem-Solving/tree/master/0160-intersection-of-two-linked-lists) |\n| [0206-reverse-linked-list](https://github.com/sandyg6/Problem-Solving/tree/master/0206-reverse-linked-list) |\n| [0234-palindrome-linked-list](https://github.com/sandyg6/Problem-Solving/tree/master/0234-palindrome-linked-list) |\n| [0908-middle-of-the-linked-list](https://github.com/sandyg6/Problem-Solving/tree/master/0908-middle-of-the-linked-list) |\n## Recursion\n|  |\n| ------- |\n| [0021-merge-two-sorted-lists](https://github.com/sandyg6/Problem-Solving/tree/master/0021-merge-two-sorted-lists) |\n| [0050-powx-n](https://github.com/sandyg6/Problem-Solving/tree/master/0050-powx-n) |\n| [0206-reverse-linked-list](https://github.com/sandyg6/Problem-Solving/tree/master/0206-reverse-linked-list) |\n| [0234-palindrome-linked-list](https://github.com/sandyg6/Problem-Solving/tree/master/0234-palindrome-linked-list) |\n## Binary Search\n|  |\n| ------- |\n| [0004-median-of-two-sorted-arrays](https://github.com/sandyg6/Problem-Solving/tree/master/0004-median-of-two-sorted-arrays) |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/sandyg6/Problem-Solving/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n## Tree\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/sandyg6/Problem-Solving/tree/master/0094-binary-tree-inorder-traversal) |\n| [0102-binary-tree-level-order-traversal](https://github.com/sandyg6/Problem-Solving/tree/master/0102-binary-tree-level-order-traversal) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0108-convert-sorted-array-to-binary-search-tree) |\n| [0110-balanced-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0110-balanced-binary-tree) |\n| [0112-path-sum](https://github.com/sandyg6/Problem-Solving/tree/master/0112-path-sum) |\n| [0144-binary-tree-preorder-traversal](https://github.com/sandyg6/Problem-Solving/tree/master/0144-binary-tree-preorder-traversal) |\n| [0145-binary-tree-postorder-traversal](https://github.com/sandyg6/Problem-Solving/tree/master/0145-binary-tree-postorder-traversal) |\n| [0199-binary-tree-right-side-view](https://github.com/sandyg6/Problem-Solving/tree/master/0199-binary-tree-right-side-view) |\n| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |\n| [0297-serialize-and-deserialize-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0297-serialize-and-deserialize-binary-tree) |\n| [0450-delete-node-in-a-bst](https://github.com/sandyg6/Problem-Solving/tree/master/0450-delete-node-in-a-bst) |\n| [0637-average-of-levels-in-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0637-average-of-levels-in-binary-tree) |\n| [0783-search-in-a-binary-search-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0783-search-in-a-binary-search-tree) |\n## Depth-First Search\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/sandyg6/Problem-Solving/tree/master/0094-binary-tree-inorder-traversal) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0110-balanced-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0110-balanced-binary-tree) |\n| [0112-path-sum](https://github.com/sandyg6/Problem-Solving/tree/master/0112-path-sum) |\n| [0144-binary-tree-preorder-traversal](https://github.com/sandyg6/Problem-Solving/tree/master/0144-binary-tree-preorder-traversal) |\n| [0145-binary-tree-postorder-traversal](https://github.com/sandyg6/Problem-Solving/tree/master/0145-binary-tree-postorder-traversal) |\n| [0199-binary-tree-right-side-view](https://github.com/sandyg6/Problem-Solving/tree/master/0199-binary-tree-right-side-view) |\n| [0207-course-schedule](https://github.com/sandyg6/Problem-Solving/tree/master/0207-course-schedule) |\n| [0210-course-schedule-ii](https://github.com/sandyg6/Problem-Solving/tree/master/0210-course-schedule-ii) |\n| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |\n| [0297-serialize-and-deserialize-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0297-serialize-and-deserialize-binary-tree) |\n| [0637-average-of-levels-in-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0637-average-of-levels-in-binary-tree) |\n| [0813-all-paths-from-source-to-target](https://github.com/sandyg6/Problem-Solving/tree/master/0813-all-paths-from-source-to-target) |\n## Binary Tree\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/sandyg6/Problem-Solving/tree/master/0094-binary-tree-inorder-traversal) |\n| [0102-binary-tree-level-order-traversal](https://github.com/sandyg6/Problem-Solving/tree/master/0102-binary-tree-level-order-traversal) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0108-convert-sorted-array-to-binary-search-tree) |\n| [0110-balanced-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0110-balanced-binary-tree) |\n| [0112-path-sum](https://github.com/sandyg6/Problem-Solving/tree/master/0112-path-sum) |\n| [0144-binary-tree-preorder-traversal](https://github.com/sandyg6/Problem-Solving/tree/master/0144-binary-tree-preorder-traversal) |\n| [0145-binary-tree-postorder-traversal](https://github.com/sandyg6/Problem-Solving/tree/master/0145-binary-tree-postorder-traversal) |\n| [0199-binary-tree-right-side-view](https://github.com/sandyg6/Problem-Solving/tree/master/0199-binary-tree-right-side-view) |\n| [0236-lowest-common-ancestor-of-a-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0236-lowest-common-ancestor-of-a-binary-tree) |\n| [0297-serialize-and-deserialize-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0297-serialize-and-deserialize-binary-tree) |\n| [0450-delete-node-in-a-bst](https://github.com/sandyg6/Problem-Solving/tree/master/0450-delete-node-in-a-bst) |\n| [0637-average-of-levels-in-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0637-average-of-levels-in-binary-tree) |\n| [0783-search-in-a-binary-search-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0783-search-in-a-binary-search-tree) |\n## Breadth-First Search\n|  |\n| ------- |\n| [0102-binary-tree-level-order-traversal](https://github.com/sandyg6/Problem-Solving/tree/master/0102-binary-tree-level-order-traversal) |\n| [0104-maximum-depth-of-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0104-maximum-depth-of-binary-tree) |\n| [0112-path-sum](https://github.com/sandyg6/Problem-Solving/tree/master/0112-path-sum) |\n| [0199-binary-tree-right-side-view](https://github.com/sandyg6/Problem-Solving/tree/master/0199-binary-tree-right-side-view) |\n| [0207-course-schedule](https://github.com/sandyg6/Problem-Solving/tree/master/0207-course-schedule) |\n| [0210-course-schedule-ii](https://github.com/sandyg6/Problem-Solving/tree/master/0210-course-schedule-ii) |\n| [0297-serialize-and-deserialize-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0297-serialize-and-deserialize-binary-tree) |\n| [0637-average-of-levels-in-binary-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0637-average-of-levels-in-binary-tree) |\n| [0813-all-paths-from-source-to-target](https://github.com/sandyg6/Problem-Solving/tree/master/0813-all-paths-from-source-to-target) |\n## Binary Search Tree\n|  |\n| ------- |\n| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0108-convert-sorted-array-to-binary-search-tree) |\n| [0450-delete-node-in-a-bst](https://github.com/sandyg6/Problem-Solving/tree/master/0450-delete-node-in-a-bst) |\n| [0783-search-in-a-binary-search-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0783-search-in-a-binary-search-tree) |\n## Math\n|  |\n| ------- |\n| [0009-palindrome-number](https://github.com/sandyg6/Problem-Solving/tree/master/0009-palindrome-number) |\n| [0048-rotate-image](https://github.com/sandyg6/Problem-Solving/tree/master/0048-rotate-image) |\n| [0050-powx-n](https://github.com/sandyg6/Problem-Solving/tree/master/0050-powx-n) |\n| [0202-happy-number](https://github.com/sandyg6/Problem-Solving/tree/master/0202-happy-number) |\n## Divide and Conquer\n|  |\n| ------- |\n| [0004-median-of-two-sorted-arrays](https://github.com/sandyg6/Problem-Solving/tree/master/0004-median-of-two-sorted-arrays) |\n| [0108-convert-sorted-array-to-binary-search-tree](https://github.com/sandyg6/Problem-Solving/tree/master/0108-convert-sorted-array-to-binary-search-tree) |\n## Graph\n|  |\n| ------- |\n| [0207-course-schedule](https://github.com/sandyg6/Problem-Solving/tree/master/0207-course-schedule) |\n| [0210-course-schedule-ii](https://github.com/sandyg6/Problem-Solving/tree/master/0210-course-schedule-ii) |\n| [0813-all-paths-from-source-to-target](https://github.com/sandyg6/Problem-Solving/tree/master/0813-all-paths-from-source-to-target) |\n## Topological Sort\n|  |\n| ------- |\n| [0207-course-schedule](https://github.com/sandyg6/Problem-Solving/tree/master/0207-course-schedule) |\n| [0210-course-schedule-ii](https://github.com/sandyg6/Problem-Solving/tree/master/0210-course-schedule-ii) |\n## Matrix\n|  |\n| ------- |\n| [0048-rotate-image](https://github.com/sandyg6/Problem-Solving/tree/master/0048-rotate-image) |\n## Simulation\n|  |\n| ------- |\n| [1505-create-target-array-in-the-given-order](https://github.com/sandyg6/Problem-Solving/tree/master/1505-create-target-array-in-the-given-order) |\n| [2058-concatenation-of-array](https://github.com/sandyg6/Problem-Solving/tree/master/2058-concatenation-of-array) |\n## Backtracking\n|  |\n| ------- |\n| [0813-all-paths-from-source-to-target](https://github.com/sandyg6/Problem-Solving/tree/master/0813-all-paths-from-source-to-target) |\n## Bit Manipulation\n|  |\n| ------- |\n| [0645-set-mismatch](https://github.com/sandyg6/Problem-Solving/tree/master/0645-set-mismatch) |\n## Sorting\n|  |\n| ------- |\n| [0049-group-anagrams](https://github.com/sandyg6/Problem-Solving/tree/master/0049-group-anagrams) |\n| [0645-set-mismatch](https://github.com/sandyg6/Problem-Solving/tree/master/0645-set-mismatch) |\n\u003c!---LeetCode Topics End--\u003e","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsandyg6%2Fproblem-solving","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsandyg6%2Fproblem-solving","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsandyg6%2Fproblem-solving/lists"}