René's URL Explorer Experiment


Title: GitHub - lynyam/Problem_Solving_DSA: This repo is store all problem i solve on DSA for ITW prepartion · GitHub

Open Graph Title: GitHub - lynyam/Problem_Solving_DSA: This repo is store all problem i solve on DSA for ITW prepartion

X Title: GitHub - lynyam/Problem_Solving_DSA: This repo is store all problem i solve on DSA for ITW prepartion

Description: This repo is store all problem i solve on DSA for ITW prepartion - lynyam/Problem_Solving_DSA

Open Graph Description: This repo is store all problem i solve on DSA for ITW prepartion - lynyam/Problem_Solving_DSA

X Description: This repo is store all problem i solve on DSA for ITW prepartion - lynyam/Problem_Solving_DSA

Opengraph URL: https://github.com/lynyam/Problem_Solving_DSA

X: @github

direct link

Domain: github.com

react-profiling0
react-import-mapreact,react-dom,react-dom/client,react-dom/profiling,react-is,react/compiler-runtime,react/jsx-dev-runtime,react/jsx-runtime,scheduler@b8488ee2c322
route-pattern/:user_id/:repository
route-controllerfiles
route-actiondisambiguate
fetch-noncev2:db130c31-e162-2018-0aab-eff4b8778104
current-catalog-service-hashf3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb
request-id9E84:16AB79:6127D3A:7B01932:6B02D2E6
html-safe-noncee3f847b87d5fbe0414ec7677cc21f740a6c4c0f61cb827f20e85cf08d7a5b9eb
visitor-payloadeyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiI5RTg0OjE2QUI3OTo2MTI3RDNBOjdCMDE5MzI6NkIwMkQyRTYiLCJ2aXNpdG9yX2lkIjoiMjk5ODk3Njk2MjIyNTE2NTAzMCIsInJlZ2lvbl9lZGdlIjoiaWFkIiwicmVnaW9uX3JlbmRlciI6ImlhZCJ9
visitor-hmacd08bd0b5edddff817d2b187377039e1d64e2ee2f11540d7305542eb57c53e269
hovercard-subject-tagrepository:827801620
github-keyboard-shortcutsrepository,copilot
google-site-verificationApib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I
octolytics-urlhttps://collector.github.com/github/collect
analytics-location//
fb:app_id1401488693436528
apple-itunes-appapp-id=1477376905, app-argument=https://github.com/lynyam/Problem_Solving_DSA
twitter:imagehttps://opengraph.githubassets.com/0417666ae9f4602e2621ad44866d8702dc738615dc83a8dd68e50035c680c30b/lynyam/Problem_Solving_DSA
twitter:cardsummary_large_image
og:imagehttps://opengraph.githubassets.com/0417666ae9f4602e2621ad44866d8702dc738615dc83a8dd68e50035c680c30b/lynyam/Problem_Solving_DSA
og:image:altThis repo is store all problem i solve on DSA for ITW prepartion - lynyam/Problem_Solving_DSA
og:image:width1200
og:image:height600
og:site_nameGitHub
og:typeobject
hostnamegithub.com
expected-hostnamegithub.com
None87e774ee7c6b3bee0490394e4d3e57ec9dbc956f74b87ea685dc8996c1676456
turbo-cache-controlno-cache
go-importgithub.com/lynyam/Problem_Solving_DSA git https://github.com/lynyam/Problem_Solving_DSA.git
octolytics-dimension-user_id46067184
octolytics-dimension-user_loginlynyam
octolytics-dimension-repository_id827801620
octolytics-dimension-repository_nwolynyam/Problem_Solving_DSA
octolytics-dimension-repository_publictrue
octolytics-dimension-repository_is_forkfalse
octolytics-dimension-repository_network_root_id827801620
octolytics-dimension-repository_network_root_nwolynyam/Problem_Solving_DSA
turbo-body-classeslogged-out env-production page-responsive
disable-turbofalse
browser-stats-urlhttps://api.github.com/_private/browser/stats
browser-errors-urlhttps://api.github.com/_private/browser/errors
release423dbb54c5e7bfecc838eb387c1435eb3d0e760d
ui-targetfull
theme-color#1e2327
color-schemelight dark

Links:

Skip to contenthttps://github.com/lynyam/Problem_Solving_DSA#start-of-content
https://github.com/
Sign inhttps://github.com/login?return_to=https%3A%2F%2Fgithub.com%2Flynyam%2FProblem_Solving_DSA
GitHubRepository hosting, code review, and collaborationhttps://github.com/platform
CopilotAI coding agent for tasks, projects, and automated workhttps://github.com/features/copilot
ActionsCI/CD and automationhttps://github.com/features/actions
Code QualityQuality analysis, fixes, and enforcementhttps://github.com/features/code-quality
CodespacesCloud development environmentshttps://github.com/features/codespaces
Code SecurityVulnerability detection and remediationhttps://github.com/security/advanced-security/code-security
Secret ProtectionSecret scanning and leak preventionhttps://github.com/security/advanced-security/secret-protection
All Featureshttps://github.com/features
Documentationhttps://docs.github.com/en
Traininghttps://learn.github.com/skills
Certificationshttps://learn.github.com/credentials
Build with Copilothttps://github.com/features/ai
Customize Copilothttps://docs.github.com/en/copilot/how-tos/copilot-on-github/customize-copilot/customize-copilot-overview
Integrationshttps://github.com/marketplace
Trending reposhttps://github.com/trending
GitHub Sponsorshttps://github.com/open-source/sponsors
Developer articleshttps://github.com/resources/articles
ChangelogYour source for the latest features, improvements, and fixes across GitHub products, all in one place.https://github.blog/changelog/
Enterpriseshttps://github.com/enterprise
Teamhttps://github.com/team
Startupshttps://github.com/enterprise/startups
Nonprofitshttps://github.com/solutions/industry/nonprofits
Healthcarehttps://github.com/solutions/industry/healthcare
Financial serviceshttps://github.com/solutions/industry/financial-services
Manufacturinghttps://github.com/solutions/industry/manufacturing
Governmenthttps://github.com/solutions/industry/government
See all industrieshttps://github.com/solutions/industry
Why GitHubhttps://github.com/why-github
Customer Storieshttps://github.com/customer-stories
Business insightshttps://github.com/solutions/executive-insights
Trust Centerhttps://github.com/trust-center
GitHub Advanced SecurityEnterprise-grade code securityhttps://github.com/security/advanced-security
Copilot for businessEnterprise-grade AI featureshttps://github.com/features/copilot/copilot-business
Premium SupportEnterprise-grade 24/7 supporthttps://github.com/enterprise/premium-support
Documentationhttps://docs.github.com/en
Resource centerhttps://github.com/resources
Bloghttps://github.blog/
Events & webinarshttps://github.com/resources/events
Community Forumhttps://github.com/orgs/community/discussions
Customer Storieshttps://github.com/customer-stories
Integrationshttps://github.com/marketplace
Customer supporthttps://help.github.com/
Traininghttps://learn.github.com/skills
GitHub Statushttps://www.githubstatus.com/
Abouthttps://github.com/about
Partnershttps://github.com/partners
Changeloghttps://github.blog/changelog/
GitHub UniverseThe event for developers, by developers — talks, workshops, and what’s next for GitHub.https://githubuniverse.com/
Pricinghttps://github.com/pricing
Sign inhttps://github.com/login?return_to=https%3A%2F%2Fgithub.com%2Flynyam%2FProblem_Solving_DSA
Sign uphttps://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
Reloadhttps://github.com/lynyam/Problem_Solving_DSA
Reloadhttps://github.com/lynyam/Problem_Solving_DSA
Reloadhttps://github.com/lynyam/Problem_Solving_DSA
lynyamhttps://github.com/lynyam
Problem_Solving_DSAhttps://github.com/lynyam/Problem_Solving_DSA
Codehttps://github.com/lynyam/Problem_Solving_DSA
Issueshttps://github.com/lynyam/Problem_Solving_DSA/issues
Pull requestshttps://github.com/lynyam/Problem_Solving_DSA/pulls
Actionshttps://github.com/lynyam/Problem_Solving_DSA/actions
Projectshttps://github.com/lynyam/Problem_Solving_DSA/projects
Security and qualityhttps://github.com/lynyam/Problem_Solving_DSA/security
Insightshttps://github.com/lynyam/Problem_Solving_DSA/pulse
https://github.com/lynyam/Problem_Solving_DSA
Problem_Solving_DSAhttps://github.com/lynyam/Problem_Solving_DSA
Notificationshttps://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
Readmehttps://github.com/lynyam/Problem_Solving_DSA#readme-ov-file
Activityhttps://github.com/lynyam/Problem_Solving_DSA/activity
0 forkshttps://github.com/lynyam/Problem_Solving_DSA/forks
Report repositoryhttps://github.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2Flynyam%2FProblem_Solving_DSA&report=lynyam+%28user%29
Brancheshttps://github.com/lynyam/Problem_Solving_DSA/branches
Tagshttps://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 Commitshttps://github.com/lynyam/Problem_Solving_DSA/commits/main/
https://github.com/lynyam/Problem_Solving_DSA/commits/main/
0001-two-sumhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0001-two-sum
0001-two-sumhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0001-two-sum
0002-add-two-numbershttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0002-add-two-numbers
0002-add-two-numbershttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0002-add-two-numbers
0003-longest-substring-without-repeating-charactershttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0003-longest-substring-without-repeating-characters
0003-longest-substring-without-repeating-charactershttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0003-longest-substring-without-repeating-characters
0004-median-of-two-sorted-arrayshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0004-median-of-two-sorted-arrays
0004-median-of-two-sorted-arrayshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0004-median-of-two-sorted-arrays
0005-longest-palindromic-substringhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0005-longest-palindromic-substring
0005-longest-palindromic-substringhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0005-longest-palindromic-substring
0006-zigzag-conversionhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0006-zigzag-conversion
0006-zigzag-conversionhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0006-zigzag-conversion
0014-longest-common-prefixhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0014-longest-common-prefix
0014-longest-common-prefixhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0014-longest-common-prefix
0017-letter-combinations-of-a-phone-numberhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0017-letter-combinations-of-a-phone-number
0017-letter-combinations-of-a-phone-numberhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0017-letter-combinations-of-a-phone-number
0019-remove-nth-node-from-end-of-listhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0019-remove-nth-node-from-end-of-list
0019-remove-nth-node-from-end-of-listhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0019-remove-nth-node-from-end-of-list
0020-valid-parentheseshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0020-valid-parentheses
0020-valid-parentheseshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0020-valid-parentheses
0022-generate-parentheseshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0022-generate-parentheses
0022-generate-parentheseshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0022-generate-parentheses
0024-swap-nodes-in-pairshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0024-swap-nodes-in-pairs
0024-swap-nodes-in-pairshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0024-swap-nodes-in-pairs
0035-search-insert-positionhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0035-search-insert-position
0035-search-insert-positionhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0035-search-insert-position
0039-combination-sumhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0039-combination-sum
0039-combination-sumhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0039-combination-sum
0044-wildcard-matchinghttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0044-wildcard-matching
0044-wildcard-matchinghttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0044-wildcard-matching
0045-jump-game-iihttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0045-jump-game-ii
0045-jump-game-iihttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0045-jump-game-ii
0046-permutationshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0046-permutations
0046-permutationshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0046-permutations
0047-permutations-iihttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0047-permutations-ii
0047-permutations-iihttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0047-permutations-ii
0049-group-anagramshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0049-group-anagrams
0049-group-anagramshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0049-group-anagrams
0052-n-queens-iihttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0052-n-queens-ii
0052-n-queens-iihttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0052-n-queens-ii
0056-merge-intervalshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0056-merge-intervals
0056-merge-intervalshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0056-merge-intervals
0057-insert-intervalhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0057-insert-interval
0057-insert-intervalhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0057-insert-interval
0062-unique-pathshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0062-unique-paths
0062-unique-pathshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0062-unique-paths
0063-unique-paths-iihttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0063-unique-paths-ii
0063-unique-paths-iihttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0063-unique-paths-ii
0064-minimum-path-sumhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0064-minimum-path-sum
0064-minimum-path-sumhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0064-minimum-path-sum
0065-valid-numberhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0065-valid-number
0065-valid-numberhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0065-valid-number
0068-text-justificationhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0068-text-justification
0068-text-justificationhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0068-text-justification
0070-climbing-stairshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0070-climbing-stairs
0070-climbing-stairshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0070-climbing-stairs
0071-simplify-pathhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0071-simplify-path
0071-simplify-pathhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0071-simplify-path
0072-edit-distancehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0072-edit-distance
0072-edit-distancehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0072-edit-distance
0074-search-a-2d-matrixhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0074-search-a-2d-matrix
0074-search-a-2d-matrixhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0074-search-a-2d-matrix
0077-combinationshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0077-combinations
0077-combinationshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0077-combinations
0078-subsetshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0078-subsets
0078-subsetshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0078-subsets
0079-word-searchhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0079-word-search
0079-word-searchhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0079-word-search
0083-remove-duplicates-from-sorted-listhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0083-remove-duplicates-from-sorted-list
0083-remove-duplicates-from-sorted-listhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0083-remove-duplicates-from-sorted-list
0091-decode-wayshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0091-decode-ways
0091-decode-wayshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0091-decode-ways
0092-reverse-linked-list-iihttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0092-reverse-linked-list-ii
0092-reverse-linked-list-iihttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0092-reverse-linked-list-ii
0094-binary-tree-inorder-traversalhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0094-binary-tree-inorder-traversal
0094-binary-tree-inorder-traversalhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0094-binary-tree-inorder-traversal
0098-validate-binary-search-treehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0098-validate-binary-search-tree
0098-validate-binary-search-treehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0098-validate-binary-search-tree
0100-same-treehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0100-same-tree
0100-same-treehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0100-same-tree
0101-symmetric-treehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0101-symmetric-tree
0101-symmetric-treehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0101-symmetric-tree
0102-binary-tree-level-order-traversalhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0102-binary-tree-level-order-traversal
0102-binary-tree-level-order-traversalhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversalhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0103-binary-tree-zigzag-level-order-traversal
0103-binary-tree-zigzag-level-order-traversalhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-treehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0104-maximum-depth-of-binary-tree
0104-maximum-depth-of-binary-treehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0104-maximum-depth-of-binary-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversalhttps://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-traversalhttps://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-traversalhttps://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-traversalhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0106-construct-binary-tree-from-inorder-and-postorder-traversal
0107-binary-tree-level-order-traversal-iihttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0107-binary-tree-level-order-traversal-ii
0107-binary-tree-level-order-traversal-iihttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0107-binary-tree-level-order-traversal-ii
0108-convert-sorted-array-to-binary-search-treehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0108-convert-sorted-array-to-binary-search-tree
0108-convert-sorted-array-to-binary-search-treehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0108-convert-sorted-array-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-treehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0109-convert-sorted-list-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-treehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0109-convert-sorted-list-to-binary-search-tree
0110-balanced-binary-treehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0110-balanced-binary-tree
0110-balanced-binary-treehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0110-balanced-binary-tree
0111-minimum-depth-of-binary-treehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0111-minimum-depth-of-binary-tree
0111-minimum-depth-of-binary-treehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0111-minimum-depth-of-binary-tree
0112-path-sumhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0112-path-sum
0112-path-sumhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0112-path-sum
0114-flatten-binary-tree-to-linked-listhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0114-flatten-binary-tree-to-linked-list
0114-flatten-binary-tree-to-linked-listhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-nodehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0116-populating-next-right-pointers-in-each-node
0116-populating-next-right-pointers-in-each-nodehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-iihttps://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-iihttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0117-populating-next-right-pointers-in-each-node-ii
0124-binary-tree-maximum-path-sumhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0124-binary-tree-maximum-path-sum
0124-binary-tree-maximum-path-sumhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0124-binary-tree-maximum-path-sum
0125-valid-palindromehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0125-valid-palindrome
0125-valid-palindromehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0125-valid-palindrome
0127-word-ladderhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0127-word-ladder
0127-word-ladderhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0127-word-ladder
0129-sum-root-to-leaf-numbershttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0129-sum-root-to-leaf-numbers
0129-sum-root-to-leaf-numbershttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0129-sum-root-to-leaf-numbers
0136-single-numberhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0136-single-number
0136-single-numberhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0136-single-number
0137-single-number-iihttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0137-single-number-ii
0137-single-number-iihttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0137-single-number-ii
0139-word-breakhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0139-word-break
0139-word-breakhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0139-word-break
0141-linked-list-cyclehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0141-linked-list-cycle
0141-linked-list-cyclehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0141-linked-list-cycle
0144-binary-tree-preorder-traversalhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0144-binary-tree-preorder-traversal
0144-binary-tree-preorder-traversalhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversalhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0145-binary-tree-postorder-traversal
0145-binary-tree-postorder-traversalhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0145-binary-tree-postorder-traversal
0146-lru-cachehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0146-lru-cache
0146-lru-cachehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0146-lru-cache
0152-maximum-product-subarrayhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0152-maximum-product-subarray
0152-maximum-product-subarrayhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0152-maximum-product-subarray
0159-longest-substring-with-at-most-two-distinct-charactershttps://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-charactershttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0159-longest-substring-with-at-most-two-distinct-characters
0164-maximum-gaphttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0164-maximum-gap
0164-maximum-gaphttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0164-maximum-gap
0167-two-sum-ii-input-array-is-sortedhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0167-two-sum-ii-input-array-is-sorted
0167-two-sum-ii-input-array-is-sortedhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0167-two-sum-ii-input-array-is-sorted
0173-binary-search-tree-iteratorhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0173-binary-search-tree-iterator
0173-binary-search-tree-iteratorhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0173-binary-search-tree-iterator
0188-best-time-to-buy-and-sell-stock-ivhttps://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-ivhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0188-best-time-to-buy-and-sell-stock-iv
0189-rotate-arrayhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0189-rotate-array
0189-rotate-arrayhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0189-rotate-array
0198-house-robberhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0198-house-robber
0198-house-robberhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0198-house-robber
0199-binary-tree-right-side-viewhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0199-binary-tree-right-side-view
0199-binary-tree-right-side-viewhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0199-binary-tree-right-side-view
0200-number-of-islandshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0200-number-of-islands
0200-number-of-islandshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0200-number-of-islands
0205-isomorphic-stringshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0205-isomorphic-strings
0205-isomorphic-stringshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0205-isomorphic-strings
0206-reverse-linked-listhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0206-reverse-linked-list
0206-reverse-linked-listhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0206-reverse-linked-list
0208-implement-trie-prefix-treehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0208-implement-trie-prefix-tree
0208-implement-trie-prefix-treehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0208-implement-trie-prefix-tree
0209-minimum-size-subarray-sumhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0209-minimum-size-subarray-sum
0209-minimum-size-subarray-sumhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0209-minimum-size-subarray-sum
0213-house-robber-iihttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0213-house-robber-ii
0213-house-robber-iihttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0213-house-robber-ii
0215-kth-largest-element-in-an-arrayhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0215-kth-largest-element-in-an-array
0215-kth-largest-element-in-an-arrayhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0215-kth-largest-element-in-an-array
0216-combination-sum-iiihttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0216-combination-sum-iii
0216-combination-sum-iiihttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0216-combination-sum-iii
0222-count-complete-tree-nodeshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0222-count-complete-tree-nodes
0222-count-complete-tree-nodeshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0222-count-complete-tree-nodes
0226-invert-binary-treehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0226-invert-binary-tree
0226-invert-binary-treehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0226-invert-binary-tree
0230-kth-smallest-element-in-a-bsthttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0230-kth-smallest-element-in-a-bst
0230-kth-smallest-element-in-a-bsthttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-treehttps://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-treehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-treehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0236-lowest-common-ancestor-of-a-binary-tree
0236-lowest-common-ancestor-of-a-binary-treehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0236-lowest-common-ancestor-of-a-binary-tree
0239-sliding-window-maximumhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0239-sliding-window-maximum
0239-sliding-window-maximumhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0239-sliding-window-maximum
0242-valid-anagramhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0242-valid-anagram
0242-valid-anagramhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0242-valid-anagram
0250-count-univalue-subtreeshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0250-count-univalue-subtrees
0250-count-univalue-subtreeshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0250-count-univalue-subtrees
0252-meeting-roomshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0252-meeting-rooms
0252-meeting-roomshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0252-meeting-rooms
0253-meeting-rooms-iihttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0253-meeting-rooms-ii
0253-meeting-rooms-iihttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0253-meeting-rooms-ii
0257-binary-tree-pathshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0257-binary-tree-paths
0257-binary-tree-pathshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0257-binary-tree-paths
0268-missing-numberhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0268-missing-number
0268-missing-numberhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0268-missing-number
0270-closest-binary-search-tree-valuehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0270-closest-binary-search-tree-value
0270-closest-binary-search-tree-valuehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0270-closest-binary-search-tree-value
0283-move-zeroeshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0283-move-zeroes
0283-move-zeroeshttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0283-move-zeroes
0285-inorder-successor-in-bsthttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0285-inorder-successor-in-bst
0285-inorder-successor-in-bsthttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0285-inorder-successor-in-bst
0289-game-of-lifehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0289-game-of-life
0289-game-of-lifehttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0289-game-of-life
0290-word-patternhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0290-word-pattern
0290-word-patternhttps://github.com/lynyam/Problem_Solving_DSA/tree/main/0290-word-pattern
READMEhttps://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-listhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0019-remove-nth-node-from-end-of-list/
0141-linked-list-cyclehttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0141-linked-list-cycle/
0283-move-zeroeshttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0283-move-zeroes/
0344-reverse-stringhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0344-reverse-string/
0392-is-subsequencehttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0392-is-subsequence/
0557-reverse-words-in-a-string-iiihttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0557-reverse-words-in-a-string-iii/
0567-permutation-in-stringhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0567-permutation-in-string/
0876-middle-of-the-linked-listhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0876-middle-of-the-linked-list/
0881-boats-to-save-peoplehttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0881-boats-to-save-people/
0917-reverse-only-lettershttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0917-reverse-only-letters/
0977-squares-of-a-sorted-arrayhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0977-squares-of-a-sorted-array/
1768-merge-strings-alternatelyhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1768-merge-strings-alternately/
2000-reverse-prefix-of-wordhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/2000-reverse-prefix-of-word/
2095-delete-the-middle-node-of-a-linked-listhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/2095-delete-the-middle-node-of-a-linked-list/
2540-minimum-common-valuehttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/2540-minimum-common-value/
https://github.com/lynyam/Problem_Solving_DSA#string
0049-group-anagramshttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0049-group-anagrams/
0205-isomorphic-stringshttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0205-isomorphic-strings/
0242-valid-anagramhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0242-valid-anagram/
0290-word-patternhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0290-word-pattern/
0344-reverse-stringhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0344-reverse-string/
0383-ransom-notehttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0383-ransom-note/
0392-is-subsequencehttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0392-is-subsequence/
0451-sort-characters-by-frequencyhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0451-sort-characters-by-frequency/
0557-reverse-words-in-a-string-iiihttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0557-reverse-words-in-a-string-iii/
0567-permutation-in-stringhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0567-permutation-in-string/
0771-jewels-and-stoneshttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0771-jewels-and-stones/
0791-custom-sort-stringhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0791-custom-sort-string/
0917-reverse-only-lettershttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0917-reverse-only-letters/
1071-greatest-common-divisor-of-stringshttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1071-greatest-common-divisor-of-strings/
1208-get-equal-substrings-within-budgethttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1208-get-equal-substrings-within-budget/
1456-maximum-number-of-vowels-in-a-substring-of-given-lengthhttps://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-closehttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1657-determine-if-two-strings-are-close/
1768-merge-strings-alternatelyhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1768-merge-strings-alternately/
1832-check-if-the-sentence-is-pangramhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1832-check-if-the-sentence-is-pangram/
1941-check-if-all-characters-have-equal-number-of-occurrenceshttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1941-check-if-all-characters-have-equal-number-of-occurrences/
2000-reverse-prefix-of-wordhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/2000-reverse-prefix-of-word/
2351-first-letter-to-appear-twicehttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/2351-first-letter-to-appear-twice/
https://github.com/lynyam/Problem_Solving_DSA#array
0001-two-sumhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0001-two-sum/
0049-group-anagramshttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0049-group-anagrams/
0209-minimum-size-subarray-sumhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0209-minimum-size-subarray-sum/
0268-missing-numberhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0268-missing-number/
0283-move-zeroeshttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0283-move-zeroes/
0303-range-sum-query-immutablehttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0303-range-sum-query-immutable/
0560-subarray-sum-equals-khttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0560-subarray-sum-equals-k/
0643-maximum-average-subarray-ihttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0643-maximum-average-subarray-i/
0713-subarray-product-less-than-khttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0713-subarray-product-less-than-k/
0724-find-pivot-indexhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0724-find-pivot-index/
0881-boats-to-save-peoplehttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0881-boats-to-save-people/
0930-binary-subarrays-with-sumhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0930-binary-subarrays-with-sum/
0977-squares-of-a-sorted-arrayhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0977-squares-of-a-sorted-array/
1004-max-consecutive-ones-iiihttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1004-max-consecutive-ones-iii/
1207-unique-number-of-occurrenceshttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1207-unique-number-of-occurrences/
1394-find-lucky-integer-in-an-arrayhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1394-find-lucky-integer-in-an-array/
1413-minimum-value-to-get-positive-step-by-step-sumhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1413-minimum-value-to-get-positive-step-by-step-sum/
1426-counting-elementshttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1426-counting-elements/
1480-running-sum-of-1d-arrayhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1480-running-sum-of-1d-array/
1512-number-of-good-pairshttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1512-number-of-good-pairs/
1695-maximum-erasure-valuehttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1695-maximum-erasure-value/
1732-find-the-highest-altitudehttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1732-find-the-highest-altitude/
2090-k-radius-subarray-averageshttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/2090-k-radius-subarray-averages/
2225-find-players-with-zero-or-one-losseshttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/2225-find-players-with-zero-or-one-losses/
2248-intersection-of-multiple-arrayshttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/2248-intersection-of-multiple-arrays/
2270-number-of-ways-to-split-arrayhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/2270-number-of-ways-to-split-array/
2540-minimum-common-valuehttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/2540-minimum-common-value/
2958-length-of-longest-subarray-with-at-most-k-frequencyhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/2958-length-of-longest-subarray-with-at-most-k-frequency/
3005-count-elements-with-maximum-frequencyhttps://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-sumhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0001-two-sum/
0049-group-anagramshttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0049-group-anagrams/
0141-linked-list-cyclehttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0141-linked-list-cycle/
0205-isomorphic-stringshttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0205-isomorphic-strings/
0242-valid-anagramhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0242-valid-anagram/
0268-missing-numberhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0268-missing-number/
0290-word-patternhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0290-word-pattern/
0383-ransom-notehttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0383-ransom-note/
0451-sort-characters-by-frequencyhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0451-sort-characters-by-frequency/
0560-subarray-sum-equals-khttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0560-subarray-sum-equals-k/
0567-permutation-in-stringhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0567-permutation-in-string/
0771-jewels-and-stoneshttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0771-jewels-and-stones/
0791-custom-sort-stringhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0791-custom-sort-string/
0930-binary-subarrays-with-sumhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0930-binary-subarrays-with-sum/
1207-unique-number-of-occurrenceshttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1207-unique-number-of-occurrences/
1394-find-lucky-integer-in-an-arrayhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1394-find-lucky-integer-in-an-array/
1426-counting-elementshttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1426-counting-elements/
1512-number-of-good-pairshttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1512-number-of-good-pairs/
1657-determine-if-two-strings-are-closehttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1657-determine-if-two-strings-are-close/
1695-maximum-erasure-valuehttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1695-maximum-erasure-value/
1832-check-if-the-sentence-is-pangramhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1832-check-if-the-sentence-is-pangram/
1941-check-if-all-characters-have-equal-number-of-occurrenceshttps://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-losseshttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/2225-find-players-with-zero-or-one-losses/
2248-intersection-of-multiple-arrayshttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/2248-intersection-of-multiple-arrays/
2351-first-letter-to-appear-twicehttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/2351-first-letter-to-appear-twice/
2540-minimum-common-valuehttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/2540-minimum-common-value/
2958-length-of-longest-subarray-with-at-most-k-frequencyhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/2958-length-of-longest-subarray-with-at-most-k-frequency/
3005-count-elements-with-maximum-frequencyhttps://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-sumhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0209-minimum-size-subarray-sum/
0268-missing-numberhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0268-missing-number/
0713-subarray-product-less-than-khttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0713-subarray-product-less-than-k/
1004-max-consecutive-ones-iiihttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1004-max-consecutive-ones-iii/
1208-get-equal-substrings-within-budgethttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1208-get-equal-substrings-within-budget/
2540-minimum-common-valuehttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/2540-minimum-common-value/
https://github.com/lynyam/Problem_Solving_DSA#stack
2000-reverse-prefix-of-wordhttps://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-peoplehttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0881-boats-to-save-people/
https://github.com/lynyam/Problem_Solving_DSA#sorting
0049-group-anagramshttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0049-group-anagrams/
0242-valid-anagramhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0242-valid-anagram/
0268-missing-numberhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0268-missing-number/
0451-sort-characters-by-frequencyhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0451-sort-characters-by-frequency/
0791-custom-sort-stringhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0791-custom-sort-string/
0881-boats-to-save-peoplehttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0881-boats-to-save-people/
0977-squares-of-a-sorted-arrayhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0977-squares-of-a-sorted-array/
1657-determine-if-two-strings-are-closehttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1657-determine-if-two-strings-are-close/
2225-find-players-with-zero-or-one-losseshttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/2225-find-players-with-zero-or-one-losses/
2248-intersection-of-multiple-arrayshttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/2248-intersection-of-multiple-arrays/
https://github.com/lynyam/Problem_Solving_DSA#math
0268-missing-numberhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0268-missing-number/
1071-greatest-common-divisor-of-stringshttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1071-greatest-common-divisor-of-strings/
1512-number-of-good-pairshttps://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-stringshttps://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-stringshttps://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-subsequencehttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0392-is-subsequence/
https://github.com/lynyam/Problem_Solving_DSA#sliding-window
0209-minimum-size-subarray-sumhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0209-minimum-size-subarray-sum/
0567-permutation-in-stringhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0567-permutation-in-string/
0643-maximum-average-subarray-ihttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0643-maximum-average-subarray-i/
0713-subarray-product-less-than-khttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0713-subarray-product-less-than-k/
0930-binary-subarrays-with-sumhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0930-binary-subarrays-with-sum/
1004-max-consecutive-ones-iiihttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1004-max-consecutive-ones-iii/
1208-get-equal-substrings-within-budgethttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1208-get-equal-substrings-within-budget/
1456-maximum-number-of-vowels-in-a-substring-of-given-lengthhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1456-maximum-number-of-vowels-in-a-substring-of-given-length/
1695-maximum-erasure-valuehttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1695-maximum-erasure-value/
2090-k-radius-subarray-averageshttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/2090-k-radius-subarray-averages/
2958-length-of-longest-subarray-with-at-most-k-frequencyhttps://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-sumhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0209-minimum-size-subarray-sum/
0303-range-sum-query-immutablehttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0303-range-sum-query-immutable/
0560-subarray-sum-equals-khttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0560-subarray-sum-equals-k/
0713-subarray-product-less-than-khttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0713-subarray-product-less-than-k/
0724-find-pivot-indexhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0724-find-pivot-index/
0930-binary-subarrays-with-sumhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0930-binary-subarrays-with-sum/
1004-max-consecutive-ones-iiihttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1004-max-consecutive-ones-iii/
1208-get-equal-substrings-within-budgethttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1208-get-equal-substrings-within-budget/
1413-minimum-value-to-get-positive-step-by-step-sumhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1413-minimum-value-to-get-positive-step-by-step-sum/
1480-running-sum-of-1d-arrayhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1480-running-sum-of-1d-array/
1732-find-the-highest-altitudehttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1732-find-the-highest-altitude/
2270-number-of-ways-to-split-arrayhttps://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-immutablehttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0303-range-sum-query-immutable/
https://github.com/lynyam/Problem_Solving_DSA#bit-manipulation
0268-missing-numberhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0268-missing-number/
2351-first-letter-to-appear-twicehttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/2351-first-letter-to-appear-twice/
https://github.com/lynyam/Problem_Solving_DSA#counting
0383-ransom-notehttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0383-ransom-note/
0451-sort-characters-by-frequencyhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0451-sort-characters-by-frequency/
1394-find-lucky-integer-in-an-arrayhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1394-find-lucky-integer-in-an-array/
1512-number-of-good-pairshttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1512-number-of-good-pairs/
1657-determine-if-two-strings-are-closehttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/1657-determine-if-two-strings-are-close/
1941-check-if-all-characters-have-equal-number-of-occurrenceshttps://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-losseshttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/2225-find-players-with-zero-or-one-losses/
2248-intersection-of-multiple-arrayshttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/2248-intersection-of-multiple-arrays/
2351-first-letter-to-appear-twicehttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/2351-first-letter-to-appear-twice/
3005-count-elements-with-maximum-frequencyhttps://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-frequencyhttps://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-frequencyhttps://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-listhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0019-remove-nth-node-from-end-of-list/
0024-swap-nodes-in-pairshttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0024-swap-nodes-in-pairs/
0083-remove-duplicates-from-sorted-listhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0083-remove-duplicates-from-sorted-list/
0092-reverse-linked-list-iihttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0092-reverse-linked-list-ii/
0141-linked-list-cyclehttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0141-linked-list-cycle/
0876-middle-of-the-linked-listhttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0876-middle-of-the-linked-list/
2095-delete-the-middle-node-of-a-linked-listhttps://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-cyclehttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0141-linked-list-cycle/
https://github.com/lynyam/Problem_Solving_DSA#recursion
0024-swap-nodes-in-pairshttps://github.com/lyn200M/Problem_Solving_DSA/tree/main/0024-swap-nodes-in-pairs/
Readmehttps://github.com/lynyam/Problem_Solving_DSA#readme-ov-file
Activityhttps://github.com/lynyam/Problem_Solving_DSA/activity
0 forkshttps://github.com/lynyam/Problem_Solving_DSA/forks
Report repositoryhttps://github.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2Flynyam%2FProblem_Solving_DSA&report=lynyam+%28user%29
https://github.com
Termshttps://docs.github.com/site-policy/github-terms/github-terms-of-service
Privacyhttps://docs.github.com/site-policy/privacy-policies/github-privacy-statement
Securityhttps://github.com/security
Statushttps://www.githubstatus.com/
Communityhttps://github.community/
Docshttps://docs.github.com/
Contacthttps://support.github.com?tags=dotcom-footer

Response headers:
Servergithub.com
Content-Typetext/html; charset=utf-8
Cache-Controlmax-age=0, private, must-revalidate

Viewport: width=device-width


URLs of crawlers that visited me.