| Skip to content | https://github.com/lynyam/Problem_Solving_DSA#start-of-content |
| https://github.com/ |
| Sign in | https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2Flynyam%2FProblem_Solving_DSA |
| GitHubRepository hosting, code review, and collaboration | https://github.com/platform |
| CopilotAI coding agent for tasks, projects, and automated work | https://github.com/features/copilot |
| ActionsCI/CD and automation | https://github.com/features/actions |
| Code QualityQuality analysis, fixes, and enforcement | https://github.com/features/code-quality |
| CodespacesCloud development environments | https://github.com/features/codespaces |
| Code SecurityVulnerability detection and remediation | https://github.com/security/advanced-security/code-security |
| Secret ProtectionSecret scanning and leak prevention | https://github.com/security/advanced-security/secret-protection |
| All Features | https://github.com/features |
| Documentation | https://docs.github.com/en |
| Training | https://learn.github.com/skills |
| Certifications | https://learn.github.com/credentials |
| Build with Copilot | https://github.com/features/ai |
| Customize Copilot | https://docs.github.com/en/copilot/how-tos/copilot-on-github/customize-copilot/customize-copilot-overview |
| Integrations | https://github.com/marketplace |
| Trending repos | https://github.com/trending |
| GitHub Sponsors | https://github.com/open-source/sponsors |
| Developer articles | https://github.com/resources/articles |
| ChangelogYour source for the latest features, improvements, and fixes across GitHub products, all in one place. | https://github.blog/changelog/ |
| Enterprises | https://github.com/enterprise |
| Team | https://github.com/team |
| Startups | https://github.com/enterprise/startups |
| Nonprofits | https://github.com/solutions/industry/nonprofits |
| Healthcare | https://github.com/solutions/industry/healthcare |
| Financial services | https://github.com/solutions/industry/financial-services |
| Manufacturing | https://github.com/solutions/industry/manufacturing |
| Government | https://github.com/solutions/industry/government |
| See all industries | https://github.com/solutions/industry |
| Why GitHub | https://github.com/why-github |
| Customer Stories | https://github.com/customer-stories |
| Business insights | https://github.com/solutions/executive-insights |
| Trust Center | https://github.com/trust-center |
| GitHub Advanced SecurityEnterprise-grade code security | https://github.com/security/advanced-security |
| Copilot for businessEnterprise-grade AI features | https://github.com/features/copilot/copilot-business |
| Premium SupportEnterprise-grade 24/7 support | https://github.com/enterprise/premium-support |
| Documentation | https://docs.github.com/en |
| Resource center | https://github.com/resources |
| Blog | https://github.blog/ |
| Events & webinars | https://github.com/resources/events |
| Community Forum | https://github.com/orgs/community/discussions |
| Customer Stories | https://github.com/customer-stories |
| Integrations | https://github.com/marketplace |
| Customer support | https://help.github.com/ |
| Training | https://learn.github.com/skills |
| GitHub Status | https://www.githubstatus.com/ |
| About | https://github.com/about |
| Partners | https://github.com/partners |
| Changelog | https://github.blog/changelog/ |
| GitHub UniverseThe event for developers, by developers — talks, workshops, and what’s next for GitHub. | https://githubuniverse.com/ |
| Pricing | https://github.com/pricing |
| Sign in | https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2Flynyam%2FProblem_Solving_DSA |
| Sign up | https://github.com/signup?ref_cta=Sign+up&ref_loc=header+logged+out&ref_page=%2F%3Cuser-name%3E%2F%3Crepo-name%3E&source=header-repo&source_repo=lynyam%2FProblem_Solving_DSA |
| Reload | https://github.com/lynyam/Problem_Solving_DSA |
| Reload | https://github.com/lynyam/Problem_Solving_DSA |
| Reload | https://github.com/lynyam/Problem_Solving_DSA |
| lynyam | https://github.com/lynyam |
| Problem_Solving_DSA | https://github.com/lynyam/Problem_Solving_DSA |
| Code | https://github.com/lynyam/Problem_Solving_DSA |
| Issues | https://github.com/lynyam/Problem_Solving_DSA/issues |
| Pull requests | https://github.com/lynyam/Problem_Solving_DSA/pulls |
| Actions | https://github.com/lynyam/Problem_Solving_DSA/actions |
| Projects | https://github.com/lynyam/Problem_Solving_DSA/projects |
| Security and quality | https://github.com/lynyam/Problem_Solving_DSA/security |
| Insights | https://github.com/lynyam/Problem_Solving_DSA/pulse |
| https://github.com/lynyam/Problem_Solving_DSA |
| Problem_Solving_DSA | https://github.com/lynyam/Problem_Solving_DSA |
| Notifications | https://github.com/login?return_to=%2Flynyam%2FProblem_Solving_DSA |
| Fork0 (0) | https://github.com/login?return_to=%2Flynyam%2FProblem_Solving_DSA |
| Star0 (0) | https://github.com/login?return_to=%2Flynyam%2FProblem_Solving_DSA |
| Readme | https://github.com/lynyam/Problem_Solving_DSA#readme-ov-file |
| Activity | https://github.com/lynyam/Problem_Solving_DSA/activity |
| 0 forks | https://github.com/lynyam/Problem_Solving_DSA/forks |
| Report repository | https://github.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2Flynyam%2FProblem_Solving_DSA&report=lynyam+%28user%29 |
| Branches | https://github.com/lynyam/Problem_Solving_DSA/branches |
| Tags | https://github.com/lynyam/Problem_Solving_DSA/tags |
| https://github.com/lynyam/Problem_Solving_DSA/branches |
| https://github.com/lynyam/Problem_Solving_DSA/tags |
| 1,558 Commits | https://github.com/lynyam/Problem_Solving_DSA/commits/main/ |
| https://github.com/lynyam/Problem_Solving_DSA/commits/main/ |
| 0001-two-sum | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0001-two-sum |
| 0001-two-sum | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0001-two-sum |
| 0002-add-two-numbers | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0002-add-two-numbers |
| 0002-add-two-numbers | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0002-add-two-numbers |
| 0003-longest-substring-without-repeating-characters | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0003-longest-substring-without-repeating-characters |
| 0003-longest-substring-without-repeating-characters | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0003-longest-substring-without-repeating-characters |
| 0004-median-of-two-sorted-arrays | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0004-median-of-two-sorted-arrays |
| 0004-median-of-two-sorted-arrays | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0004-median-of-two-sorted-arrays |
| 0005-longest-palindromic-substring | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0005-longest-palindromic-substring |
| 0005-longest-palindromic-substring | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0005-longest-palindromic-substring |
| 0006-zigzag-conversion | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0006-zigzag-conversion |
| 0006-zigzag-conversion | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0006-zigzag-conversion |
| 0014-longest-common-prefix | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0014-longest-common-prefix |
| 0014-longest-common-prefix | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0014-longest-common-prefix |
| 0017-letter-combinations-of-a-phone-number | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0017-letter-combinations-of-a-phone-number |
| 0017-letter-combinations-of-a-phone-number | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0017-letter-combinations-of-a-phone-number |
| 0019-remove-nth-node-from-end-of-list | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0019-remove-nth-node-from-end-of-list |
| 0019-remove-nth-node-from-end-of-list | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0019-remove-nth-node-from-end-of-list |
| 0020-valid-parentheses | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0020-valid-parentheses |
| 0020-valid-parentheses | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0020-valid-parentheses |
| 0022-generate-parentheses | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0022-generate-parentheses |
| 0022-generate-parentheses | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0022-generate-parentheses |
| 0024-swap-nodes-in-pairs | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0024-swap-nodes-in-pairs |
| 0024-swap-nodes-in-pairs | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0024-swap-nodes-in-pairs |
| 0035-search-insert-position | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0035-search-insert-position |
| 0035-search-insert-position | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0035-search-insert-position |
| 0039-combination-sum | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0039-combination-sum |
| 0039-combination-sum | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0039-combination-sum |
| 0044-wildcard-matching | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0044-wildcard-matching |
| 0044-wildcard-matching | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0044-wildcard-matching |
| 0045-jump-game-ii | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0045-jump-game-ii |
| 0045-jump-game-ii | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0045-jump-game-ii |
| 0046-permutations | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0046-permutations |
| 0046-permutations | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0046-permutations |
| 0047-permutations-ii | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0047-permutations-ii |
| 0047-permutations-ii | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0047-permutations-ii |
| 0049-group-anagrams | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0049-group-anagrams |
| 0049-group-anagrams | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0049-group-anagrams |
| 0052-n-queens-ii | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0052-n-queens-ii |
| 0052-n-queens-ii | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0052-n-queens-ii |
| 0056-merge-intervals | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0056-merge-intervals |
| 0056-merge-intervals | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0056-merge-intervals |
| 0057-insert-interval | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0057-insert-interval |
| 0057-insert-interval | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0057-insert-interval |
| 0062-unique-paths | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0062-unique-paths |
| 0062-unique-paths | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0062-unique-paths |
| 0063-unique-paths-ii | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0063-unique-paths-ii |
| 0063-unique-paths-ii | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0063-unique-paths-ii |
| 0064-minimum-path-sum | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0064-minimum-path-sum |
| 0064-minimum-path-sum | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0064-minimum-path-sum |
| 0065-valid-number | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0065-valid-number |
| 0065-valid-number | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0065-valid-number |
| 0068-text-justification | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0068-text-justification |
| 0068-text-justification | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0068-text-justification |
| 0070-climbing-stairs | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0070-climbing-stairs |
| 0070-climbing-stairs | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0070-climbing-stairs |
| 0071-simplify-path | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0071-simplify-path |
| 0071-simplify-path | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0071-simplify-path |
| 0072-edit-distance | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0072-edit-distance |
| 0072-edit-distance | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0072-edit-distance |
| 0074-search-a-2d-matrix | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0074-search-a-2d-matrix |
| 0074-search-a-2d-matrix | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0074-search-a-2d-matrix |
| 0077-combinations | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0077-combinations |
| 0077-combinations | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0077-combinations |
| 0078-subsets | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0078-subsets |
| 0078-subsets | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0078-subsets |
| 0079-word-search | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0079-word-search |
| 0079-word-search | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0079-word-search |
| 0083-remove-duplicates-from-sorted-list | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0083-remove-duplicates-from-sorted-list |
| 0083-remove-duplicates-from-sorted-list | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0083-remove-duplicates-from-sorted-list |
| 0091-decode-ways | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0091-decode-ways |
| 0091-decode-ways | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0091-decode-ways |
| 0092-reverse-linked-list-ii | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0092-reverse-linked-list-ii |
| 0092-reverse-linked-list-ii | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0092-reverse-linked-list-ii |
| 0094-binary-tree-inorder-traversal | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0094-binary-tree-inorder-traversal |
| 0094-binary-tree-inorder-traversal | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0094-binary-tree-inorder-traversal |
| 0098-validate-binary-search-tree | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0098-validate-binary-search-tree |
| 0098-validate-binary-search-tree | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0098-validate-binary-search-tree |
| 0100-same-tree | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0100-same-tree |
| 0100-same-tree | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0100-same-tree |
| 0101-symmetric-tree | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0101-symmetric-tree |
| 0101-symmetric-tree | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0101-symmetric-tree |
| 0102-binary-tree-level-order-traversal | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0102-binary-tree-level-order-traversal |
| 0102-binary-tree-level-order-traversal | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0102-binary-tree-level-order-traversal |
| 0103-binary-tree-zigzag-level-order-traversal | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0103-binary-tree-zigzag-level-order-traversal |
| 0103-binary-tree-zigzag-level-order-traversal | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0103-binary-tree-zigzag-level-order-traversal |
| 0104-maximum-depth-of-binary-tree | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0104-maximum-depth-of-binary-tree |
| 0104-maximum-depth-of-binary-tree | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0104-maximum-depth-of-binary-tree |
| 0105-construct-binary-tree-from-preorder-and-inorder-traversal | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0105-construct-binary-tree-from-preorder-and-inorder-traversal |
| 0105-construct-binary-tree-from-preorder-and-inorder-traversal | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0105-construct-binary-tree-from-preorder-and-inorder-traversal |
| 0106-construct-binary-tree-from-inorder-and-postorder-traversal | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0106-construct-binary-tree-from-inorder-and-postorder-traversal |
| 0106-construct-binary-tree-from-inorder-and-postorder-traversal | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0106-construct-binary-tree-from-inorder-and-postorder-traversal |
| 0107-binary-tree-level-order-traversal-ii | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0107-binary-tree-level-order-traversal-ii |
| 0107-binary-tree-level-order-traversal-ii | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0107-binary-tree-level-order-traversal-ii |
| 0108-convert-sorted-array-to-binary-search-tree | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0108-convert-sorted-array-to-binary-search-tree |
| 0108-convert-sorted-array-to-binary-search-tree | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0108-convert-sorted-array-to-binary-search-tree |
| 0109-convert-sorted-list-to-binary-search-tree | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0109-convert-sorted-list-to-binary-search-tree |
| 0109-convert-sorted-list-to-binary-search-tree | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0109-convert-sorted-list-to-binary-search-tree |
| 0110-balanced-binary-tree | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0110-balanced-binary-tree |
| 0110-balanced-binary-tree | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0110-balanced-binary-tree |
| 0111-minimum-depth-of-binary-tree | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0111-minimum-depth-of-binary-tree |
| 0111-minimum-depth-of-binary-tree | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0111-minimum-depth-of-binary-tree |
| 0112-path-sum | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0112-path-sum |
| 0112-path-sum | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0112-path-sum |
| 0114-flatten-binary-tree-to-linked-list | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0114-flatten-binary-tree-to-linked-list |
| 0114-flatten-binary-tree-to-linked-list | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0114-flatten-binary-tree-to-linked-list |
| 0116-populating-next-right-pointers-in-each-node | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0116-populating-next-right-pointers-in-each-node |
| 0116-populating-next-right-pointers-in-each-node | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0116-populating-next-right-pointers-in-each-node |
| 0117-populating-next-right-pointers-in-each-node-ii | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0117-populating-next-right-pointers-in-each-node-ii |
| 0117-populating-next-right-pointers-in-each-node-ii | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0117-populating-next-right-pointers-in-each-node-ii |
| 0124-binary-tree-maximum-path-sum | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0124-binary-tree-maximum-path-sum |
| 0124-binary-tree-maximum-path-sum | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0124-binary-tree-maximum-path-sum |
| 0125-valid-palindrome | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0125-valid-palindrome |
| 0125-valid-palindrome | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0125-valid-palindrome |
| 0127-word-ladder | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0127-word-ladder |
| 0127-word-ladder | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0127-word-ladder |
| 0129-sum-root-to-leaf-numbers | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0129-sum-root-to-leaf-numbers |
| 0129-sum-root-to-leaf-numbers | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0129-sum-root-to-leaf-numbers |
| 0136-single-number | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0136-single-number |
| 0136-single-number | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0136-single-number |
| 0137-single-number-ii | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0137-single-number-ii |
| 0137-single-number-ii | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0137-single-number-ii |
| 0139-word-break | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0139-word-break |
| 0139-word-break | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0139-word-break |
| 0141-linked-list-cycle | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0141-linked-list-cycle |
| 0141-linked-list-cycle | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0141-linked-list-cycle |
| 0144-binary-tree-preorder-traversal | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0144-binary-tree-preorder-traversal |
| 0144-binary-tree-preorder-traversal | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0144-binary-tree-preorder-traversal |
| 0145-binary-tree-postorder-traversal | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0145-binary-tree-postorder-traversal |
| 0145-binary-tree-postorder-traversal | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0145-binary-tree-postorder-traversal |
| 0146-lru-cache | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0146-lru-cache |
| 0146-lru-cache | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0146-lru-cache |
| 0152-maximum-product-subarray | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0152-maximum-product-subarray |
| 0152-maximum-product-subarray | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0152-maximum-product-subarray |
| 0159-longest-substring-with-at-most-two-distinct-characters | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0159-longest-substring-with-at-most-two-distinct-characters |
| 0159-longest-substring-with-at-most-two-distinct-characters | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0159-longest-substring-with-at-most-two-distinct-characters |
| 0164-maximum-gap | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0164-maximum-gap |
| 0164-maximum-gap | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0164-maximum-gap |
| 0167-two-sum-ii-input-array-is-sorted | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0167-two-sum-ii-input-array-is-sorted |
| 0167-two-sum-ii-input-array-is-sorted | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0167-two-sum-ii-input-array-is-sorted |
| 0173-binary-search-tree-iterator | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0173-binary-search-tree-iterator |
| 0173-binary-search-tree-iterator | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0173-binary-search-tree-iterator |
| 0188-best-time-to-buy-and-sell-stock-iv | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0188-best-time-to-buy-and-sell-stock-iv |
| 0188-best-time-to-buy-and-sell-stock-iv | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0188-best-time-to-buy-and-sell-stock-iv |
| 0189-rotate-array | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0189-rotate-array |
| 0189-rotate-array | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0189-rotate-array |
| 0198-house-robber | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0198-house-robber |
| 0198-house-robber | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0198-house-robber |
| 0199-binary-tree-right-side-view | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0199-binary-tree-right-side-view |
| 0199-binary-tree-right-side-view | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0199-binary-tree-right-side-view |
| 0200-number-of-islands | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0200-number-of-islands |
| 0200-number-of-islands | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0200-number-of-islands |
| 0205-isomorphic-strings | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0205-isomorphic-strings |
| 0205-isomorphic-strings | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0205-isomorphic-strings |
| 0206-reverse-linked-list | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0206-reverse-linked-list |
| 0206-reverse-linked-list | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0206-reverse-linked-list |
| 0208-implement-trie-prefix-tree | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0208-implement-trie-prefix-tree |
| 0208-implement-trie-prefix-tree | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0208-implement-trie-prefix-tree |
| 0209-minimum-size-subarray-sum | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0209-minimum-size-subarray-sum |
| 0209-minimum-size-subarray-sum | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0209-minimum-size-subarray-sum |
| 0213-house-robber-ii | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0213-house-robber-ii |
| 0213-house-robber-ii | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0213-house-robber-ii |
| 0215-kth-largest-element-in-an-array | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0215-kth-largest-element-in-an-array |
| 0215-kth-largest-element-in-an-array | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0215-kth-largest-element-in-an-array |
| 0216-combination-sum-iii | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0216-combination-sum-iii |
| 0216-combination-sum-iii | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0216-combination-sum-iii |
| 0222-count-complete-tree-nodes | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0222-count-complete-tree-nodes |
| 0222-count-complete-tree-nodes | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0222-count-complete-tree-nodes |
| 0226-invert-binary-tree | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0226-invert-binary-tree |
| 0226-invert-binary-tree | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0226-invert-binary-tree |
| 0230-kth-smallest-element-in-a-bst | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0230-kth-smallest-element-in-a-bst |
| 0230-kth-smallest-element-in-a-bst | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0230-kth-smallest-element-in-a-bst |
| 0235-lowest-common-ancestor-of-a-binary-search-tree | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0235-lowest-common-ancestor-of-a-binary-search-tree |
| 0235-lowest-common-ancestor-of-a-binary-search-tree | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0235-lowest-common-ancestor-of-a-binary-search-tree |
| 0236-lowest-common-ancestor-of-a-binary-tree | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0236-lowest-common-ancestor-of-a-binary-tree |
| 0236-lowest-common-ancestor-of-a-binary-tree | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0236-lowest-common-ancestor-of-a-binary-tree |
| 0239-sliding-window-maximum | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0239-sliding-window-maximum |
| 0239-sliding-window-maximum | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0239-sliding-window-maximum |
| 0242-valid-anagram | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0242-valid-anagram |
| 0242-valid-anagram | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0242-valid-anagram |
| 0250-count-univalue-subtrees | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0250-count-univalue-subtrees |
| 0250-count-univalue-subtrees | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0250-count-univalue-subtrees |
| 0252-meeting-rooms | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0252-meeting-rooms |
| 0252-meeting-rooms | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0252-meeting-rooms |
| 0253-meeting-rooms-ii | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0253-meeting-rooms-ii |
| 0253-meeting-rooms-ii | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0253-meeting-rooms-ii |
| 0257-binary-tree-paths | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0257-binary-tree-paths |
| 0257-binary-tree-paths | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0257-binary-tree-paths |
| 0268-missing-number | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0268-missing-number |
| 0268-missing-number | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0268-missing-number |
| 0270-closest-binary-search-tree-value | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0270-closest-binary-search-tree-value |
| 0270-closest-binary-search-tree-value | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0270-closest-binary-search-tree-value |
| 0283-move-zeroes | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0283-move-zeroes |
| 0283-move-zeroes | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0283-move-zeroes |
| 0285-inorder-successor-in-bst | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0285-inorder-successor-in-bst |
| 0285-inorder-successor-in-bst | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0285-inorder-successor-in-bst |
| 0289-game-of-life | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0289-game-of-life |
| 0289-game-of-life | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0289-game-of-life |
| 0290-word-pattern | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0290-word-pattern |
| 0290-word-pattern | https://github.com/lynyam/Problem_Solving_DSA/tree/main/0290-word-pattern |
| README | https://github.com/lynyam/Problem_Solving_DSA |
| https://github.com/lynyam/Problem_Solving_DSA#problem_solving_dsa |
| https://github.com/lynyam/Problem_Solving_DSA#leetcode-topics |
| https://github.com/lynyam/Problem_Solving_DSA#two-pointers |
| 0019-remove-nth-node-from-end-of-list | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0019-remove-nth-node-from-end-of-list/ |
| 0141-linked-list-cycle | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0141-linked-list-cycle/ |
| 0283-move-zeroes | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0283-move-zeroes/ |
| 0344-reverse-string | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0344-reverse-string/ |
| 0392-is-subsequence | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0392-is-subsequence/ |
| 0557-reverse-words-in-a-string-iii | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0557-reverse-words-in-a-string-iii/ |
| 0567-permutation-in-string | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0567-permutation-in-string/ |
| 0876-middle-of-the-linked-list | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0876-middle-of-the-linked-list/ |
| 0881-boats-to-save-people | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0881-boats-to-save-people/ |
| 0917-reverse-only-letters | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0917-reverse-only-letters/ |
| 0977-squares-of-a-sorted-array | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0977-squares-of-a-sorted-array/ |
| 1768-merge-strings-alternately | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1768-merge-strings-alternately/ |
| 2000-reverse-prefix-of-word | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/2000-reverse-prefix-of-word/ |
| 2095-delete-the-middle-node-of-a-linked-list | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/2095-delete-the-middle-node-of-a-linked-list/ |
| 2540-minimum-common-value | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/2540-minimum-common-value/ |
| https://github.com/lynyam/Problem_Solving_DSA#string |
| 0049-group-anagrams | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0049-group-anagrams/ |
| 0205-isomorphic-strings | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0205-isomorphic-strings/ |
| 0242-valid-anagram | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0242-valid-anagram/ |
| 0290-word-pattern | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0290-word-pattern/ |
| 0344-reverse-string | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0344-reverse-string/ |
| 0383-ransom-note | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0383-ransom-note/ |
| 0392-is-subsequence | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0392-is-subsequence/ |
| 0451-sort-characters-by-frequency | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0451-sort-characters-by-frequency/ |
| 0557-reverse-words-in-a-string-iii | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0557-reverse-words-in-a-string-iii/ |
| 0567-permutation-in-string | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0567-permutation-in-string/ |
| 0771-jewels-and-stones | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0771-jewels-and-stones/ |
| 0791-custom-sort-string | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0791-custom-sort-string/ |
| 0917-reverse-only-letters | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0917-reverse-only-letters/ |
| 1071-greatest-common-divisor-of-strings | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1071-greatest-common-divisor-of-strings/ |
| 1208-get-equal-substrings-within-budget | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1208-get-equal-substrings-within-budget/ |
| 1456-maximum-number-of-vowels-in-a-substring-of-given-length | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1456-maximum-number-of-vowels-in-a-substring-of-given-length/ |
| 1657-determine-if-two-strings-are-close | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1657-determine-if-two-strings-are-close/ |
| 1768-merge-strings-alternately | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1768-merge-strings-alternately/ |
| 1832-check-if-the-sentence-is-pangram | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1832-check-if-the-sentence-is-pangram/ |
| 1941-check-if-all-characters-have-equal-number-of-occurrences | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1941-check-if-all-characters-have-equal-number-of-occurrences/ |
| 2000-reverse-prefix-of-word | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/2000-reverse-prefix-of-word/ |
| 2351-first-letter-to-appear-twice | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/2351-first-letter-to-appear-twice/ |
| https://github.com/lynyam/Problem_Solving_DSA#array |
| 0001-two-sum | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0001-two-sum/ |
| 0049-group-anagrams | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0049-group-anagrams/ |
| 0209-minimum-size-subarray-sum | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0209-minimum-size-subarray-sum/ |
| 0268-missing-number | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0268-missing-number/ |
| 0283-move-zeroes | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0283-move-zeroes/ |
| 0303-range-sum-query-immutable | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0303-range-sum-query-immutable/ |
| 0560-subarray-sum-equals-k | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0560-subarray-sum-equals-k/ |
| 0643-maximum-average-subarray-i | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0643-maximum-average-subarray-i/ |
| 0713-subarray-product-less-than-k | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0713-subarray-product-less-than-k/ |
| 0724-find-pivot-index | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0724-find-pivot-index/ |
| 0881-boats-to-save-people | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0881-boats-to-save-people/ |
| 0930-binary-subarrays-with-sum | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0930-binary-subarrays-with-sum/ |
| 0977-squares-of-a-sorted-array | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0977-squares-of-a-sorted-array/ |
| 1004-max-consecutive-ones-iii | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1004-max-consecutive-ones-iii/ |
| 1207-unique-number-of-occurrences | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1207-unique-number-of-occurrences/ |
| 1394-find-lucky-integer-in-an-array | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1394-find-lucky-integer-in-an-array/ |
| 1413-minimum-value-to-get-positive-step-by-step-sum | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1413-minimum-value-to-get-positive-step-by-step-sum/ |
| 1426-counting-elements | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1426-counting-elements/ |
| 1480-running-sum-of-1d-array | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1480-running-sum-of-1d-array/ |
| 1512-number-of-good-pairs | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1512-number-of-good-pairs/ |
| 1695-maximum-erasure-value | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1695-maximum-erasure-value/ |
| 1732-find-the-highest-altitude | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1732-find-the-highest-altitude/ |
| 2090-k-radius-subarray-averages | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/2090-k-radius-subarray-averages/ |
| 2225-find-players-with-zero-or-one-losses | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/2225-find-players-with-zero-or-one-losses/ |
| 2248-intersection-of-multiple-arrays | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/2248-intersection-of-multiple-arrays/ |
| 2270-number-of-ways-to-split-array | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/2270-number-of-ways-to-split-array/ |
| 2540-minimum-common-value | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/2540-minimum-common-value/ |
| 2958-length-of-longest-subarray-with-at-most-k-frequency | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/2958-length-of-longest-subarray-with-at-most-k-frequency/ |
| 3005-count-elements-with-maximum-frequency | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/3005-count-elements-with-maximum-frequency/ |
| https://github.com/lynyam/Problem_Solving_DSA#hash-table |
| 0001-two-sum | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0001-two-sum/ |
| 0049-group-anagrams | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0049-group-anagrams/ |
| 0141-linked-list-cycle | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0141-linked-list-cycle/ |
| 0205-isomorphic-strings | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0205-isomorphic-strings/ |
| 0242-valid-anagram | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0242-valid-anagram/ |
| 0268-missing-number | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0268-missing-number/ |
| 0290-word-pattern | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0290-word-pattern/ |
| 0383-ransom-note | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0383-ransom-note/ |
| 0451-sort-characters-by-frequency | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0451-sort-characters-by-frequency/ |
| 0560-subarray-sum-equals-k | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0560-subarray-sum-equals-k/ |
| 0567-permutation-in-string | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0567-permutation-in-string/ |
| 0771-jewels-and-stones | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0771-jewels-and-stones/ |
| 0791-custom-sort-string | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0791-custom-sort-string/ |
| 0930-binary-subarrays-with-sum | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0930-binary-subarrays-with-sum/ |
| 1207-unique-number-of-occurrences | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1207-unique-number-of-occurrences/ |
| 1394-find-lucky-integer-in-an-array | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1394-find-lucky-integer-in-an-array/ |
| 1426-counting-elements | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1426-counting-elements/ |
| 1512-number-of-good-pairs | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1512-number-of-good-pairs/ |
| 1657-determine-if-two-strings-are-close | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1657-determine-if-two-strings-are-close/ |
| 1695-maximum-erasure-value | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1695-maximum-erasure-value/ |
| 1832-check-if-the-sentence-is-pangram | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1832-check-if-the-sentence-is-pangram/ |
| 1941-check-if-all-characters-have-equal-number-of-occurrences | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1941-check-if-all-characters-have-equal-number-of-occurrences/ |
| 2225-find-players-with-zero-or-one-losses | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/2225-find-players-with-zero-or-one-losses/ |
| 2248-intersection-of-multiple-arrays | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/2248-intersection-of-multiple-arrays/ |
| 2351-first-letter-to-appear-twice | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/2351-first-letter-to-appear-twice/ |
| 2540-minimum-common-value | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/2540-minimum-common-value/ |
| 2958-length-of-longest-subarray-with-at-most-k-frequency | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/2958-length-of-longest-subarray-with-at-most-k-frequency/ |
| 3005-count-elements-with-maximum-frequency | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/3005-count-elements-with-maximum-frequency/ |
| https://github.com/lynyam/Problem_Solving_DSA#binary-search |
| 0209-minimum-size-subarray-sum | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0209-minimum-size-subarray-sum/ |
| 0268-missing-number | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0268-missing-number/ |
| 0713-subarray-product-less-than-k | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0713-subarray-product-less-than-k/ |
| 1004-max-consecutive-ones-iii | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1004-max-consecutive-ones-iii/ |
| 1208-get-equal-substrings-within-budget | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1208-get-equal-substrings-within-budget/ |
| 2540-minimum-common-value | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/2540-minimum-common-value/ |
| https://github.com/lynyam/Problem_Solving_DSA#stack |
| 2000-reverse-prefix-of-word | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/2000-reverse-prefix-of-word/ |
| https://github.com/lynyam/Problem_Solving_DSA#greedy |
| 0881-boats-to-save-people | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0881-boats-to-save-people/ |
| https://github.com/lynyam/Problem_Solving_DSA#sorting |
| 0049-group-anagrams | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0049-group-anagrams/ |
| 0242-valid-anagram | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0242-valid-anagram/ |
| 0268-missing-number | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0268-missing-number/ |
| 0451-sort-characters-by-frequency | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0451-sort-characters-by-frequency/ |
| 0791-custom-sort-string | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0791-custom-sort-string/ |
| 0881-boats-to-save-people | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0881-boats-to-save-people/ |
| 0977-squares-of-a-sorted-array | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0977-squares-of-a-sorted-array/ |
| 1657-determine-if-two-strings-are-close | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1657-determine-if-two-strings-are-close/ |
| 2225-find-players-with-zero-or-one-losses | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/2225-find-players-with-zero-or-one-losses/ |
| 2248-intersection-of-multiple-arrays | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/2248-intersection-of-multiple-arrays/ |
| https://github.com/lynyam/Problem_Solving_DSA#math |
| 0268-missing-number | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0268-missing-number/ |
| 1071-greatest-common-divisor-of-strings | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1071-greatest-common-divisor-of-strings/ |
| 1512-number-of-good-pairs | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1512-number-of-good-pairs/ |
| https://github.com/lynyam/Problem_Solving_DSA#euclidean-algorithm |
| 1071-greatest-common-divisor-of-strings | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1071-greatest-common-divisor-of-strings/ |
| https://github.com/lynyam/Problem_Solving_DSA#greatest-common-divisor |
| 1071-greatest-common-divisor-of-strings | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1071-greatest-common-divisor-of-strings/ |
| https://github.com/lynyam/Problem_Solving_DSA#dynamic-programming |
| 0392-is-subsequence | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0392-is-subsequence/ |
| https://github.com/lynyam/Problem_Solving_DSA#sliding-window |
| 0209-minimum-size-subarray-sum | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0209-minimum-size-subarray-sum/ |
| 0567-permutation-in-string | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0567-permutation-in-string/ |
| 0643-maximum-average-subarray-i | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0643-maximum-average-subarray-i/ |
| 0713-subarray-product-less-than-k | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0713-subarray-product-less-than-k/ |
| 0930-binary-subarrays-with-sum | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0930-binary-subarrays-with-sum/ |
| 1004-max-consecutive-ones-iii | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1004-max-consecutive-ones-iii/ |
| 1208-get-equal-substrings-within-budget | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1208-get-equal-substrings-within-budget/ |
| 1456-maximum-number-of-vowels-in-a-substring-of-given-length | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1456-maximum-number-of-vowels-in-a-substring-of-given-length/ |
| 1695-maximum-erasure-value | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1695-maximum-erasure-value/ |
| 2090-k-radius-subarray-averages | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/2090-k-radius-subarray-averages/ |
| 2958-length-of-longest-subarray-with-at-most-k-frequency | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/2958-length-of-longest-subarray-with-at-most-k-frequency/ |
| https://github.com/lynyam/Problem_Solving_DSA#prefix-sum |
| 0209-minimum-size-subarray-sum | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0209-minimum-size-subarray-sum/ |
| 0303-range-sum-query-immutable | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0303-range-sum-query-immutable/ |
| 0560-subarray-sum-equals-k | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0560-subarray-sum-equals-k/ |
| 0713-subarray-product-less-than-k | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0713-subarray-product-less-than-k/ |
| 0724-find-pivot-index | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0724-find-pivot-index/ |
| 0930-binary-subarrays-with-sum | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0930-binary-subarrays-with-sum/ |
| 1004-max-consecutive-ones-iii | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1004-max-consecutive-ones-iii/ |
| 1208-get-equal-substrings-within-budget | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1208-get-equal-substrings-within-budget/ |
| 1413-minimum-value-to-get-positive-step-by-step-sum | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1413-minimum-value-to-get-positive-step-by-step-sum/ |
| 1480-running-sum-of-1d-array | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1480-running-sum-of-1d-array/ |
| 1732-find-the-highest-altitude | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1732-find-the-highest-altitude/ |
| 2270-number-of-ways-to-split-array | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/2270-number-of-ways-to-split-array/ |
| https://github.com/lynyam/Problem_Solving_DSA#design |
| 0303-range-sum-query-immutable | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0303-range-sum-query-immutable/ |
| https://github.com/lynyam/Problem_Solving_DSA#bit-manipulation |
| 0268-missing-number | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0268-missing-number/ |
| 2351-first-letter-to-appear-twice | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/2351-first-letter-to-appear-twice/ |
| https://github.com/lynyam/Problem_Solving_DSA#counting |
| 0383-ransom-note | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0383-ransom-note/ |
| 0451-sort-characters-by-frequency | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0451-sort-characters-by-frequency/ |
| 1394-find-lucky-integer-in-an-array | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1394-find-lucky-integer-in-an-array/ |
| 1512-number-of-good-pairs | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1512-number-of-good-pairs/ |
| 1657-determine-if-two-strings-are-close | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1657-determine-if-two-strings-are-close/ |
| 1941-check-if-all-characters-have-equal-number-of-occurrences | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/1941-check-if-all-characters-have-equal-number-of-occurrences/ |
| 2225-find-players-with-zero-or-one-losses | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/2225-find-players-with-zero-or-one-losses/ |
| 2248-intersection-of-multiple-arrays | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/2248-intersection-of-multiple-arrays/ |
| 2351-first-letter-to-appear-twice | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/2351-first-letter-to-appear-twice/ |
| 3005-count-elements-with-maximum-frequency | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/3005-count-elements-with-maximum-frequency/ |
| https://github.com/lynyam/Problem_Solving_DSA#heap-priority-queue |
| 0451-sort-characters-by-frequency | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0451-sort-characters-by-frequency/ |
| https://github.com/lynyam/Problem_Solving_DSA#bucket-sort |
| 0451-sort-characters-by-frequency | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0451-sort-characters-by-frequency/ |
| https://github.com/lynyam/Problem_Solving_DSA#linked-list |
| 0019-remove-nth-node-from-end-of-list | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0019-remove-nth-node-from-end-of-list/ |
| 0024-swap-nodes-in-pairs | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0024-swap-nodes-in-pairs/ |
| 0083-remove-duplicates-from-sorted-list | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0083-remove-duplicates-from-sorted-list/ |
| 0092-reverse-linked-list-ii | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0092-reverse-linked-list-ii/ |
| 0141-linked-list-cycle | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0141-linked-list-cycle/ |
| 0876-middle-of-the-linked-list | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0876-middle-of-the-linked-list/ |
| 2095-delete-the-middle-node-of-a-linked-list | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/2095-delete-the-middle-node-of-a-linked-list/ |
| https://github.com/lynyam/Problem_Solving_DSA#floyds-cycle-finding-algorithm |
| 0141-linked-list-cycle | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0141-linked-list-cycle/ |
| https://github.com/lynyam/Problem_Solving_DSA#recursion |
| 0024-swap-nodes-in-pairs | https://github.com/lyn200M/Problem_Solving_DSA/tree/main/0024-swap-nodes-in-pairs/ |
| Readme | https://github.com/lynyam/Problem_Solving_DSA#readme-ov-file |
| Activity | https://github.com/lynyam/Problem_Solving_DSA/activity |
| 0 forks | https://github.com/lynyam/Problem_Solving_DSA/forks |
| Report repository | https://github.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2Flynyam%2FProblem_Solving_DSA&report=lynyam+%28user%29 |
|
| https://github.com |
| Terms | https://docs.github.com/site-policy/github-terms/github-terms-of-service |
| Privacy | https://docs.github.com/site-policy/privacy-policies/github-privacy-statement |
| Security | https://github.com/security |
| Status | https://www.githubstatus.com/ |
| Community | https://github.community/ |
| Docs | https://docs.github.com/ |
| Contact | https://support.github.com?tags=dotcom-footer |