RenΓ©'s URL Explorer Experiment


Title: GitHub - FakeStandard/LeetCode-CSharp: :battery: LeetCode Practice Β· GitHub

Open Graph Title: GitHub - FakeStandard/LeetCode-CSharp: :battery: LeetCode Practice

X Title: GitHub - FakeStandard/LeetCode-CSharp: :battery: LeetCode Practice

Description: :battery: LeetCode Practice. Contribute to FakeStandard/LeetCode-CSharp development by creating an account on GitHub.

Open Graph Description: :battery: LeetCode Practice. Contribute to FakeStandard/LeetCode-CSharp development by creating an account on GitHub.

X Description: :battery: LeetCode Practice. Contribute to FakeStandard/LeetCode-CSharp development by creating an account on GitHub.

Opengraph URL: https://github.com/FakeStandard/LeetCode-CSharp

X: @github

direct link

Domain: github.com

route-pattern/:user_id/:repository
route-controllerfiles
route-actiondisambiguate
fetch-noncev2:0c7447e6-e1e2-3539-785f-86a39e07bcc0
current-catalog-service-hashf3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb
request-idA250:2D2253:1D5B257:2A3F790:6A4CE846
html-safe-nonce27cf6fa29ba1a2c3e4003647bfbe2e484ba9193ef8f3bde2e903bcaf739ed9fa
visitor-payloadeyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJBMjUwOjJEMjI1MzoxRDVCMjU3OjJBM0Y3OTA6NkE0Q0U4NDYiLCJ2aXNpdG9yX2lkIjoiNDU2NTU3MDk0MzQ2ODc1OTExMCIsInJlZ2lvbl9lZGdlIjoiaWFkIiwicmVnaW9uX3JlbmRlciI6ImlhZCJ9
visitor-hmac61646deb90f0fd44e93e2e62311b44f8448392558407d217146bd510923edd62
hovercard-subject-tagrepository:370229593
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/FakeStandard/LeetCode-CSharp
twitter:imagehttps://opengraph.githubassets.com/2aa388b88851222bf2bb159dd4dd52df93e9d9213253083ea41a3e718e6d0ae9/FakeStandard/LeetCode-CSharp
twitter:cardsummary_large_image
og:imagehttps://opengraph.githubassets.com/2aa388b88851222bf2bb159dd4dd52df93e9d9213253083ea41a3e718e6d0ae9/FakeStandard/LeetCode-CSharp
og:image:alt:battery: LeetCode Practice. Contribute to FakeStandard/LeetCode-CSharp development by creating an account on GitHub.
og:image:width1200
og:image:height600
og:site_nameGitHub
og:typeobject
hostnamegithub.com
expected-hostnamegithub.com
None299b43bca6e02ad35197ffeba30d2466846d5fb02ab96fbced5b5e6cec589fb8
turbo-cache-controlno-cache
go-importgithub.com/FakeStandard/LeetCode-CSharp git https://github.com/FakeStandard/LeetCode-CSharp.git
octolytics-dimension-user_id75247434
octolytics-dimension-user_loginFakeStandard
octolytics-dimension-repository_id370229593
octolytics-dimension-repository_nwoFakeStandard/LeetCode-CSharp
octolytics-dimension-repository_publictrue
octolytics-dimension-repository_is_forkfalse
octolytics-dimension-repository_network_root_id370229593
octolytics-dimension-repository_network_root_nwoFakeStandard/LeetCode-CSharp
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
releasec5a57f04eeb310f57c73fd6d751d957e2ca27ed2
ui-targetfull
theme-color#1e2327
color-schemelight dark

Links:

Skip to contenthttps://github.com/FakeStandard/LeetCode-CSharp#start-of-content
https://github.com/
Sign in https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2FFakeStandard%2FLeetCode-CSharp
GitHub CopilotWrite better code with AIhttps://github.com/features/copilot
GitHub Copilot appDirect agents from issue to mergehttps://github.com/features/ai/github-app
MCP RegistryNewIntegrate external toolshttps://github.com/mcp
ActionsAutomate any workflowhttps://github.com/features/actions
CodespacesInstant dev environmentshttps://github.com/features/codespaces
IssuesPlan and track workhttps://github.com/features/issues
Code ReviewManage code changeshttps://github.com/features/code-review
GitHub Advanced SecurityFind and fix vulnerabilitieshttps://github.com/security/advanced-security
Code securitySecure your code as you buildhttps://github.com/security/advanced-security/code-security
Secret protectionStop leaks before they starthttps://github.com/security/advanced-security/secret-protection
Why GitHubhttps://github.com/why-github
Documentationhttps://docs.github.com
Bloghttps://github.blog
Changeloghttps://github.blog/changelog
Marketplacehttps://github.com/marketplace
View all featureshttps://github.com/features
Enterpriseshttps://github.com/enterprise
Small and medium teamshttps://github.com/team
Startupshttps://github.com/enterprise/startups
Nonprofitshttps://github.com/solutions/industry/nonprofits
App Modernizationhttps://github.com/solutions/use-case/app-modernization
DevSecOpshttps://github.com/solutions/use-case/devsecops
DevOpshttps://github.com/solutions/use-case/devops
CI/CDhttps://github.com/solutions/use-case/ci-cd
View all use caseshttps://github.com/solutions/use-case
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
View all industrieshttps://github.com/solutions/industry
View all solutionshttps://github.com/solutions
AIhttps://github.com/resources/articles?topic=ai
Software Developmenthttps://github.com/resources/articles?topic=software-development
DevOpshttps://github.com/resources/articles?topic=devops
Securityhttps://github.com/resources/articles?topic=security
View all topicshttps://github.com/resources/articles
Customer storieshttps://github.com/customer-stories
Events & webinarshttps://github.com/resources/events
Ebooks & reportshttps://github.com/resources/whitepapers
Business insightshttps://github.com/solutions/executive-insights
GitHub Skillshttps://skills.github.com
Documentationhttps://docs.github.com
Customer supporthttps://support.github.com
Community forumhttps://github.com/orgs/community/discussions
Trust centerhttps://github.com/trust-center
Partnershttps://github.com/partners
View all resourceshttps://github.com/resources
GitHub SponsorsFund open source developershttps://github.com/sponsors
Security Labhttps://securitylab.github.com
Maintainer Communityhttps://maintainers.github.com
Acceleratorhttps://github.com/accelerator
GitHub Starshttps://stars.github.com
Archive Programhttps://archiveprogram.github.com
Topicshttps://github.com/topics
Trendinghttps://github.com/trending
Collectionshttps://github.com/collections
Enterprise platformAI-powered developer platformhttps://github.com/enterprise
GitHub Advanced SecurityEnterprise-grade security featureshttps://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/premium-support
Pricinghttps://github.com/pricing
Search syntax tipshttps://docs.github.com/search-github/github-code-search/understanding-github-code-search-syntax
documentationhttps://docs.github.com/search-github/github-code-search/understanding-github-code-search-syntax
Sign in https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2FFakeStandard%2FLeetCode-CSharp
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=FakeStandard%2FLeetCode-CSharp
Reloadhttps://github.com/FakeStandard/LeetCode-CSharp
Reloadhttps://github.com/FakeStandard/LeetCode-CSharp
Reloadhttps://github.com/FakeStandard/LeetCode-CSharp
FakeStandard https://github.com/FakeStandard
LeetCode-CSharphttps://github.com/FakeStandard/LeetCode-CSharp
Notifications https://github.com/login?return_to=%2FFakeStandard%2FLeetCode-CSharp
Fork 0 https://github.com/login?return_to=%2FFakeStandard%2FLeetCode-CSharp
Star 2 https://github.com/login?return_to=%2FFakeStandard%2FLeetCode-CSharp
Code https://github.com/FakeStandard/LeetCode-CSharp
Issues 0 https://github.com/FakeStandard/LeetCode-CSharp/issues
Pull requests 0 https://github.com/FakeStandard/LeetCode-CSharp/pulls
Actions https://github.com/FakeStandard/LeetCode-CSharp/actions
Projects https://github.com/FakeStandard/LeetCode-CSharp/projects
Security and quality 0 https://github.com/FakeStandard/LeetCode-CSharp/security
Insights https://github.com/FakeStandard/LeetCode-CSharp/pulse
Code https://github.com/FakeStandard/LeetCode-CSharp
Issues https://github.com/FakeStandard/LeetCode-CSharp/issues
Pull requests https://github.com/FakeStandard/LeetCode-CSharp/pulls
Actions https://github.com/FakeStandard/LeetCode-CSharp/actions
Projects https://github.com/FakeStandard/LeetCode-CSharp/projects
Security and quality https://github.com/FakeStandard/LeetCode-CSharp/security
Insights https://github.com/FakeStandard/LeetCode-CSharp/pulse
https://github.com/FakeStandard/LeetCode-CSharp
Brancheshttps://github.com/FakeStandard/LeetCode-CSharp/branches
Tagshttps://github.com/FakeStandard/LeetCode-CSharp/tags
https://github.com/FakeStandard/LeetCode-CSharp/branches
https://github.com/FakeStandard/LeetCode-CSharp/tags
665 Commitshttps://github.com/FakeStandard/LeetCode-CSharp/commits/main/
https://github.com/FakeStandard/LeetCode-CSharp/commits/main/
Commonhttps://github.com/FakeStandard/LeetCode-CSharp/tree/main/Common
Commonhttps://github.com/FakeStandard/LeetCode-CSharp/tree/main/Common
Solutionhttps://github.com/FakeStandard/LeetCode-CSharp/tree/main/Solution
Solutionhttps://github.com/FakeStandard/LeetCode-CSharp/tree/main/Solution
UnitTesthttps://github.com/FakeStandard/LeetCode-CSharp/tree/main/UnitTest
UnitTesthttps://github.com/FakeStandard/LeetCode-CSharp/tree/main/UnitTest
.gitattributeshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/.gitattributes
.gitattributeshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/.gitattributes
.gitignorehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/.gitignore
.gitignorehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/.gitignore
README.mdhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/README.md
README.mdhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/README.md
READMEhttps://github.com/FakeStandard/LeetCode-CSharp
https://github.com/FakeStandard/LeetCode-CSharp#leetcode
https://github.com/FakeStandard/LeetCode-CSharp#1-100
Two Sumhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0001.Two-sum
TwoSumhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0001.Two-sum/0001-Two-sum.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0001_Two_sum_Test.cs
πŸ“„https://dev.to/fakestandard/1two-sum-25l
Add Two Numbershttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0002.Add-two-numbers
AddTwoNumbershttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0002.Add-two-numbers/0002-Add-two-numbers.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0002_Add_two_numbers_Test.cs
Longest Substring Without Repeating Charactershttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0003.Longest-substring-without-repeating-characters
LengthOfLongestSubstringhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0003.Longest-substring-without-repeating-characters/0003-Longest-substring-without-repeating-characters.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0003_Longest_substring_without_repeating_characters_Test.cs
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
Longest Palindromic Substringhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0005.Longest-palindromic-substring
LongestPalindromehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0005.Longest-palindromic-substring/0005-Longest-palindromic-substring.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0005_Longest_palindromic_substring_Test.cs
Reverse Integerhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0007.Reverse-integer
Reversehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0007.Reverse-integer/0007-Reverse-integer.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0007_Reverse_integer_Test.cs
Palindrome Numberhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0009.Palindrome-number
IsPalindromehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0009.Palindrome-number/0009-Palindrome-number.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0009_Palindrome_number_Test.cs
πŸ“„https://dev.to/fakestandard/palindrome-number-4l15
Container With Most Waterhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0011.Container-with-most-water
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0011_Container_with_most_water_Test.cs
Roman to Integerhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0013.Roman-to-integer
RomanToInthttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0013.Roman-to-integer/0013-Roman-to-integer.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0013_Roman_to_integer_Test.cs
πŸ“„https://dev.to/fakestandard/roman-to-integer-ikj
Longest Common Prefixhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0014.Longest-common-prefix
LongestCommonPrefixhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0014.Longest-common-prefix/0014-Longest-common-prefix.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0014_Longest_common_prefix_Test.cs
πŸ“„https://dev.to/fakestandard/longest-common-prefix-fnj
3Sumhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0015.3Sum
ThreeSumhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0015.3Sum/0015-3Sum.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0015_3Sum_Test.cs
3Sum Closesthttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0016.3Sum-closest
ThreeSumClosesthttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0016.3Sum-closest/0016-3Sum-closest.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0016_3Sum_Closest_Test.cs
4Sumhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0018.4Sum
FourSumhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0018.4Sum/0018-4Sum.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0018_4Sum_Test.cs
Remove Nth Node From End of Listhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0019.Remove-nth-node-from-end-of-list
RemoveNthFromEndhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0019.Remove-nth-node-from-end-of-list/0019-Remove-nth-node-from-end-of-list.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0019_Remove_nth_node_from_end_of_list_Test.cs
Valid Parentheseshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0020.Valid-parentheses
IsValidhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0020.Valid-parentheses/0020-Valid-parentheses.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0020_Valid_parentheses_Test.cs
πŸ“„https://dev.to/fakestandard/valid-parentheses-2p3i
Merge Two Sorted Listshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0021.Merge-two-sorted-lists
MergeTwoListshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0021.Merge-two-sorted-lists/0021-Merge-two-sorted-lists.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0021_Merge_two_sorted_lists_Test.cs
πŸ“„https://dev.to/fakestandard/merge-two-sorted-lists-2n6o
Swap Nodes in Pairshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0024.Swap-nodes-in-pairs
SwapPairshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0024.Swap-nodes-in-pairs/0024-Swap-nodes-in-pairs.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0024_Swap_nodes_in_pairs_Test.cs
Reverse Nodes in k-Grouphttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0025.Reverse-nodes-in-k-group
ReverseKGrouphttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0025.Reverse-nodes-in-k-group/0025-Reverse-nodes-in-k-group.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0025_Reverse_nodes_in_k_group_Test.cs
Remove Duplicates from Sorted Arrayhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0026.Remove-duplicates-from-sorted-array
RemoveDuplicateshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0026.Remove-duplicates-from-sorted-array/0026-Remove-duplicates-from-sorted-array.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0026_Remove_duplicates_from_sorted_array_Test.cs
πŸ“„https://dev.to/fakestandard/remove-duplicates-from-sorted-array-85n
Remove Elementhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0027.Remove-element
RemoveElementhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0027.Remove-element/0027-Remove-element.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0027_Remove_element_Test.cs
πŸ“„https://dev.to/fakestandard/remove-element-1c8n
Implement strStr()https://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0028.Implement-strStr
StrStrhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0028.Implement-strStr/0028-Implement-strStr.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0028_Implement_strStr_Test.cs
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
Longest Valid Parentheseshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0032.Longest-valid-parentheses
LongestValidParentheseshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0032.Longest-valid-parentheses/0032-Longest-valid-parentheses.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0032_Longest_valid_parentheses_Test.cs
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
Search Insert Positionhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0035.Search-insert-position
SearchInserthttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0035.Search-insert-position/0035-Search-insert-position.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0035_Search_insert_position_Test.cs
πŸ“„https://dev.to/fakestandard/search-insert-position-5f
Valid Sudokuhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0036.Valid-sudoku
ValidSudokuhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0036.Valid-sudoku/0036-Valid-sudoku.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0036_Valid_sudoku_Test.cs
Sudoku Solverhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0037.Sudoku-solver
SolveSudukuhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0037.Sudoku-solver/0037-Sudoku-solver.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0037_Sudoku_solver_Tests.cs
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
Multiply Stringshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0043.Multiply-strings
Multiplyhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0043.Multiply-strings/0043-Multiply-strings.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0043_Multiply_strings_Test.cs
Jump Game IIhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0045.Jump-game-II
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0045_Jump_game_II_Tests.cs
Permutationshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0046.Permutations
Permutehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0046.Permutations/0046-Permutations.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0046_Permutations_Test.cs
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
Rotate Imagehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0048.Rotate-image
Rotatehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0048.Rotate-image/0048-Rotate-image.cs
Group Anagramshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0049.Group-anagrams
GroupAnagramshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0049.Group-anagrams/0049-Group-anagrams.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0049_Group_anagrams_Test.cs
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
Maximum Subarrayhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0053.Maximum-subarray
MaxSubArrayhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0053.Maximum-subarray/0053-Maximum-subarray.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0053_Maximum_subarray_Test.cs
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
Merge Intervalshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0056.Merge-intervals
Mergehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0056.Merge-intervals/0056-Merge-intervals.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0056_Merge_intervals_Test.cs
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
Length of Last Wordhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0058.Length-of-last-word
LengthOfLastWordhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0058.Length-of-last-word/0058-Length-of-last-word.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0058_Length_of_last_word_Test.cs
πŸ“„https://dev.to/fakestandard/length-of-last-word-22dk
Spiral Matrix IIhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0059.Spiral-matrix-II
GenerateMatrixhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0059.Spiral-matrix-II/0059-Spiral-matrix-II.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0059_Spiral_matrix_II_Test.cs
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
Plus Onehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0066.Plus-one
PlusOnehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0066.Plus-one/0066-Plus-one.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0066_Plus_one_Test.cs
πŸ“„https://dev.to/fakestandard/plus-one-25fm
Add Binaryhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0067.Add-binary
AddBinaryhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0067.Add-binary/0067-Add-binary.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0067_Add_binary_Test.cs
πŸ“„https://dev.to/fakestandard/add-binary-3kpk
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
Sqrt(x)https://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0069.Sqrt-x
MySqrthttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0069.Sqrt-x/0069-Sqrt-x.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0069_Sqrt_x_Test.cs
Climbing Stairshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0070.Climbing-stairs
ClimbStairshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0070.Climbing-stairs/0070-Climbing-stairs.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0070_Climbing_stairs_Test.cs
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
Search a 2D Matrixhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0074.Search-a-2D-Matrix
SearchMatrixhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0074.Search-a-2D-Matrix/0074-Search-a-2D-Matrix.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0074_Search_a_2D_Matrix_Test.cs
Sort Colorshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0075.Sort-colors
SortColorshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0075.Sort-colors/0075-Sort-colors.cs
Combinationshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0077.Combinations
Combinehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0077.Combinations/0077-Combinations.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0077_Combinations_Test.cs
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
Remove Duplicates from Sorted List IIhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0082.Remove-duplicates-from-sorted-list-II
DeleteDuplicateshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0082.Remove-duplicates-from-sorted-list-II/0082-Remove-duplicates-from-sorted-list-II.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0082_Remove_duplicates_from_sorted_list_II_Test.cs
Remove Duplicates from Sorted Listhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0083.Remove-duplicates-from-sorted-list
DeleteDuplicateshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0083.Remove-duplicates-from-sorted-list/0083-Remove-duplicates-from-sorted-list.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0083_Remove_duplicates_from_sorted_list_Test.cs
πŸ“„https://dev.to/fakestandard/remove-duplicates-from-sorted-list-2c4c
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
Merge Sorted Arrayhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0088.Merge-sorted-array
Mergehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0088.Merge-sorted-array/0088-Merge-sorted-array.cs
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
Binary Tree Inorder Traversalhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0094.Binary-tree-inorder-traversal
InorderTraversalhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0094.Binary-tree-inorder-traversal/0094-Binary-tree-inorder-traversal.cs
πŸ“„https://dev.to/fakestandard/binary-tree-inorder-traversal-37aa
Same Treehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0100.Same-tree
IsSameTreehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0100.Same-tree/0100-Same-tree.cs
πŸ“„https://dev.to/fakestandard/same-tree-49fo
https://github.com/FakeStandard/LeetCode-CSharp#101-200
Symmetric Treehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0101.Symmetric-tree
IsSymmetrichttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0101.Symmetric-tree/0101-Symmetric-tree.cs
Binary Tree Level Order Traversalhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0102.Binary-tree-level-order-traversal
LevelOrderhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0102.Binary-tree-level-order-traversal/0102-Binary-tree-level-order-traversal.cs
Maximum Depth of Binary Treehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0104.Maxium-depth-of-binary-tree
MaxDepthhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0104.Maxium-depth-of-binary-tree/0104-Maxium-depth-of-binary-tree.cs
Construct Binary Tree from Preorder and Inorder Traversalhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0105.Construct-binary-tree-from-preorder-and-inorder-traversal
BuildTreehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0105.Construct-binary-tree-from-preorder-and-inorder-traversal/0105-Construct-binary-tree-from-preorder-and-inorder-traversal.cs
Convert Sorted Array to Binary Search Treehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0108.Convert-sorted-array-to-binary-search-tree
SortedArrayToBSThttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0108.Convert-sorted-array-to-binary-search-tree/0108-Convert-sorted-array-to-binary-search-tree.cs
Minimum Depth of Binary Treehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0111.Minimum-depth-of-binary-tree
MinDepthhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0111.Minimum-depth-of-binary-tree/0111-Minimum-depth-of-binary-tree.cs
Path Sum IIhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0113.Path-sum-II
PathSumhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0113.Path-sum-II/0113-Path-sum-II.cs
Flatten Binary Tree to Linked Listhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0114.Flatten-binary-tree-to-linked-list
Flattenhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0114.Flatten-binary-tree-to-linked-list/0114-Flatten-binary-tree-to-linked-list.cs
Populating Next Right Pointers in Each Nodehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0116.Populating-next-right-pointers-in-each-node
Connecthttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0116.Populating-next-right-pointers-in-each-node/0116-Populating-next-right-pointers-in-each-node.cs
Pascal's Trianglehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0118.Pascals-triangle
Generatehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0118.Pascals-triangle/0118-Pascals-triangle.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0118_Pascals_triangle_Test.cs
Pascal's Triangle IIhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0119.Pascals-triangle-II
GetRowhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0119.Pascals-triangle-II/0119-Pascals-triangle-II.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0119_Pascals_triangle_II_Test.cs
Trianglehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0120.Triangle
MinimumTotalhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0120.Triangle/0120-Triangle.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0120_Triangle_Test.cs
Best Time to Buy and Sell Stockhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0121.Best-time-to-buy-and-shell-stock
MaxProfithttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0121.Best-time-to-buy-and-shell-stock/0121-Best-time-to-buy-and-shell-stock.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0121_Bset_time_to_buy_and_shell_stock_Test.cs
Valid Palindromehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0125.Valid-palindrome
IsPalindromehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0125.Valid-palindrome/0125-Valid-palindrome.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0125_Valid_palindrome_Test.cs
Single Numberhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0136.Single-number
SingleNumberhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0136.Single-number/0136-Single-number.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0136_Single_number_Test.cs
Linked List Cyclehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0141.Linked-list-cycle
HasCyclehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0141.Linked-list-cycle/0141-Linked-list-cycle.cs
Linked List Cycle IIhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0142.Linked-list-cycle-II
DetectCyclehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0142.Linked-list-cycle-II/0142-Linked-list-cycle-II.cs
Reorder Listhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0143.Reorder-list
ReorderListhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0143.Reorder-list/0143-Reorder-list.cs
Binary Tree Preorder Traversalhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0144.Binary-tree-preorder-traversal
PreorderTraversalhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0144.Binary-tree-preorder-traversal/0144-Binary-tree-preorder-traversal.cs
Binary Tree Postorder Traversalhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0145.Binary-tree-postorder-traversal
PostorderTraversalhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0145.Binary-tree-postorder-traversal/0145-Binary-tree-postorder-traversal.cs
Min Stackhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0155.Min-stack
MinStackhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0155.Min-stack/0155-Min-stack.cs
Intersection of Two Linked Listshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0160.Intersection-of-two-linked-lists
GetIntersectionNodehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0160.Intersection-of-two-linked-lists/0160-Intersection-of-two-linked-lists.cs
Find Peak Elementhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0162.Find-peak-element
FindPeakElementhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0162.Find-peak-element/0162-Find-peak-element.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0162_Find_peak_element_Test.cs
Two Sum II - Input array is sortedhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0167.Two-sum-II-input-array-is-sorted
TwoSumhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0167.Two-sum-II-input-array-is-sorted/0167-Two-sum-II-input-array-is-sorted.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0167_Two_sum_II_input_array_is_sorted_Test.cs
Excel Sheet Column Titlehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0168.Excel-sheet-column-title
ConvertToTitlehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0168.Excel-sheet-column-title/0168-Excel-sheet-column-title.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0168_Excel_sheet_column_title_Test.cs
Majority Elementhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0169.Majority-element
MajorityElementhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0169.Majority-element/0169-Majority-element.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0169_Majority_element_Test.cs
Factorial Trailing Zeroeshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0172.Factorial-trailing-zeroes
TrailingZeroeshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0172.Factorial-trailing-zeroes/0172-Factorial-trailing-zeroes.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0172_Factorial_trailing_zeroes_Test.cs
Binary Search Tree Iteratorhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0173.Binary-search-tree-iterator
BSTIteratorhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0173.Binary-search-tree-iterator/0173-Binary-search-tree-iterator.cs
Repeated DNA Sequenceshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0187.Repeated-dna-sequences
FindRepeatedDnaSequenceshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0187.Repeated-dna-sequences/0187-Repeated-dna-sequences.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0187_Repeated_dna_sequences_Test.cs
Rotate Arrayhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0189.Rotate-array
Rotatehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0189.Rotate-array/0189-Rotate-array.cs
Reverse Bitshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0190.Reverse-bits
reverseBitshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0190.Reverse-bits/0190-Reverse-bits.cs
Number of 1 Bitshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0191.Number-of-1-bits
HammingWeighthttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0191.Number-of-1-bits/0191-Number-of-1-bits.cs
House Robberhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0198.House-robber
Robhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0198.House-robber/0198-House-robbercs.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0198_House_robbercs_Test.cs
Binary Tree Right Side Viewhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0199.Binary-tree-right-side-view
RightSideViewhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0199.Binary-tree-right-side-view/0199-Binary-tree-right-side-view.cs
https://github.com/FakeStandard/LeetCode-CSharp#201-300
Happy Numberhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0202.Happy-number
IsHappyhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0202.Happy-number/0202-Happy-numbercs.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0202_Happy_numbercs_Test.cs
Remove Linked List Elementshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0203.Remove-linked-list-elements
RemoveElementshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0203.Remove-linked-list-elements/0203-Remove-linked-list-elements.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0203_Remove_Linked_List_Elements_Test.cs
Count Primeshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0204.Count-primes
CountPrimeshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0204.Count-primes/0204-Count-primes.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0204_Count_primes_Test.cs
Isomorphic Stringshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0205.Isomorphic-strings
IsIsomorphichttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0205.Isomorphic-strings/0205-Isomorphic-strings.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0205_Isomorphic_strings_Test.cs
Reverse Linked Listhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0206.Reverse-linked-list
ReverseListhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0206.Reverse-linked-list/0206-Reverse-linked-list.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0206_Reverse_linked_list_Test.cs
Kth Largest Element in an Arrayhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0215.Kth-largest-element-in-an-array
FindKthLargesthttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0215.Kth-largest-element-in-an-array/0215-Kth-largest-element-in-an-array.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0215_Kth_largest_element_in_an_array_Test.cs
Contains Duplicatehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0217.Contains-Duplicate
ContainsDuplicatehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0217.Contains-Duplicate/0217-Contains-Duplicate.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0217_Contains_duplicate_Test.cs
Contains Duplicate IIhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0219.Contains-duplicate-II
ContainsNearbyDuplicatehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0219.Contains-duplicate-II/0219-Contains-duplicate-II.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0219_Contains_duplicate_II_Test.cs
Implement Stack using Queueshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0225.Implement-stack-using-queues
MyStackhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0225.Implement-stack-using-queues/0225-Implement-stack-using-queues.cs
Contains Duplicate IIhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0226.Invert-binary-tree
InvertTreehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0226.Invert-binary-tree/0226-Invert-binary-tree.cs
Kth Largest Element in an Arrayhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0215.Kth-largest-element-in-an-array
FindKthLargesthttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0215.Kth-largest-element-in-an-array/0215-Kth-largest-element-in-an-array.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0215_Kth_largest_element_in_an_array_Test.cs
Kth Smallest Element in a BSThttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0230.Kth-smallest-element-in-a-BST
KthSmallesthttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0230.Kth-smallest-element-in-a-BST/0230-Kth-smallest-element-in-a-BST.cs
Power of Twohttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0231.Power-of-two
IsPowerOfTwohttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0231.Power-of-two/0231-Power-of-two.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0231_Power_of_two_Test.cs
Contains Duplicate IIhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0232.Implement-queue-using-stacks
MyQueuehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0232.Implement-queue-using-stacks/0232-Implement-queue-using-stacks.cs
Palindrome Linked Listhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0234.Palindrome-linked-list
IsPalindromehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0234.Palindrome-linked-list/0234-Palindrome-linked-list.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0234_Palindrome_linked_list_Test.cs
Lowest Common Ancestor of a Binary Treehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0236.Lowest-common-ancestor-of-a-binary-tree
LowestCommonAncestorhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0236.Lowest-common-ancestor-of-a-binary-tree/0236-Lowest-common-ancestor-of-a-binary-tree.cs
Lowest Common Ancestor of a Binary Search Treehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0235.Lowest-common-ancestor-of-a-binary-search-tree
LowestCommonAncestorhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0235.Lowest-common-ancestor-of-a-binary-search-tree/0235-Lowest-common-ancestor-of-a-binary-search-tree.cs
Delete Node in a Linked Listhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0237.Delete-node-in-a-linked-list
DeleteNodehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0237.Delete-node-in-a-linked-list/0237-Delete-node-in-a-linked-list.cs
Product of Array Except Selfhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0238.Product-of-array-except-self
ProductExceptSelfhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0238.Product-of-array-except-self/0238-Product-of-array-except-self.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0238_Product_of_array_except_self_Test.cs
Search a 2D Matrix IIhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0240.Search-a-2D-matrix-II
SearchMatrixhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0240.Search-a-2D-matrix-II/0240-Search-a-2D-matrix-II.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0240_Search_a_2D_matrix_II_Test.cs
Valid Anagramhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0242.Valid-anagram
IsAnagramhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0242.Valid-anagram/0242-Valid-anagram.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0242_Valid_anagram_Test.cs
Binary Tree Pathshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0257.Binary-tree-paths
BinaryTreePathshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0257.Binary-tree-paths/0257-Binary-tree-paths.cs
Add Digitshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0258.Add-digits
AddDigitshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0258.Add-digits/0258-Add-digits.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0258_Add_digits_Test.cs
Missing Numberhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0268.Missing-number
MissingNumberhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0268.Missing-number/0268-Missing-number.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0268_Missing_number_Test.cs
First Bad Versionhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0278.First-bad-version
FirstBadVersionhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0278.First-bad-version/0278-First-bad-version.cs
Move Zeroeshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0283.Move-zeroes
MoveZeroeshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0283.Move-zeroes/0283-Move-zeroes.cs
Word Patternhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0290.Word-pattern
WordPatternhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0290.Word-pattern/0290-Word-pattern.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0290_Word_pattern_Test.cs
Serialize and Deserialize Binary Treehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0297.Serialize-and-deserialize-binary-tree
Codechttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0297.Serialize-and-deserialize-binary-tree/0297-Serialize-and-deserialize-binary-tree.cs
https://github.com/FakeStandard/LeetCode-CSharp#301-400
Power of Threehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0326.Power-of-three
IsPowerOfThreehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0326.Power-of-three/0326-Power-of-three.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0326_Power_of_three_Test.cs
Increasing Triplet Subsequencehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0334.Increasing-triplet-subsequence
IncreasingTriplethttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0334.Increasing-triplet-subsequence/0334-Increasing-triplet-subsequence.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0334_Increasing_triplet_subsequence_Test.cs
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
Reverse Stringhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0344.Reverse-string
ReverseStringhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0344.Reverse-string/0344-Reverse-string.cs
Top K Frequent Elementshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0347.Top-k-frequent-elements
TopKFrequenthttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0347.Top-k-frequent-elements/0347-Top-k-frequent-elements.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0347_Top_k_frequent_elements_Test.cs
Kth Smallest Element in a Sorted Matrixhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0378.Kth-smallest-element-in-a-sorted-matrix
KthSmallesthttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0378.Kth-smallest-element-in-a-sorted-matrix/0378-Kth-smallest-element-in-a-sorted-matrix.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0378_Kth_smallest_element_in_a_sorted_matrix_Test.cs
First Unique Character in a Stringhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0387.First-unique-character-in-a-string
FirstUniqCharhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0387.First-unique-character-in-a-string/0387-First-unique-character-in-a-string.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0387_First_unique_character_in_a_string_Test.cs
Find the Differencehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0389.Find-the-difference
FindTheDifferencehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0389.Find-the-difference/0389-Find-the-difference.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0389_Find_the_difference_Test.cs
Is Subsequencehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0392.Is-subsequence
IsSubsequencehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0392.Is-subsequence/0392-Is-subsequence.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0392_Is_subsequence_Test.cs
https://github.com/FakeStandard/LeetCode-CSharp#401-500
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
Sum of Left Leaveshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0404.Sum-of-left-leaves
SumOfLeftLeaveshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0404.Sum-of-left-leaves/0404-Sum-of-left-leaves.cs
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
Longest Palindromehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0409.Longest-palindrome
LongestPalindromehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0409.Longest-palindrome/0409-Longest-palindrome.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0409_Longest_palindrome_Test.cs
Add Stringshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0415.Add-strings
AddStringshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0415.Add-strings/0415-Add-strings.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0415_Add_strings_Test.cs
Delete Node in a BSThttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0450.Delete-node-in-a-BST
DeleteNodehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0450.Delete-node-in-a-BST/0450-Delete-node-in-a-BST.cs
Sort Characters By Frequencyhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0451.Sort-characters-by-frequency
FrequencySorthttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0451.Sort-characters-by-frequency/0451-Sort-characters-by-frequency.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0451_Sort_characters_by_frequency_Test.cs
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
Number Complementhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0476.Number-complement
FindComplementhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0476.Number-complement/0476-Number-complement.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0476_Number_complement_Test.cs
Max Consecutive Oneshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0485.Max-consecutive-ones
FindMaxConsecutiveOneshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0485.Max-consecutive-ones/0485-Max-consecutive-ones.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0485_Max_consecutive_ones_Test.cs
https://github.com/FakeStandard/LeetCode-CSharp#501-600
Fibonacci Numberhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0509.Fibonacci-number
Fibhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0509.Fibonacci-number/0509-Fibonacci-number.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0509_Fibonacci_number_Test.cs
01 Matrixhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0542.01-Matrix
UpdateMatrixhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0542.01-Matrix/0542-01-Matrix.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0542_01_Matrix_Test.cs
Reverse Words in a String IIIhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0557.Reverse-words-in-a-string-III
ReverseWordshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0557.Reverse-words-in-a-string-III/0557-Reverse-words-in-a-string-III.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0557_Reverse_words_in_a_string_III_Test.cs
Subarray Sum Equals Khttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0560.Subarray-sum-equals-k
SubarraySumhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0560.Subarray-sum-equals-k/0560-Subarray-sum-equals-k.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0560_Subarray_sum_equals_k_Test.cs
Reshape the Matrixhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0566.Reshape-the-matrix
MatrixReshapehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0566.Reshape-the-matrix/0566-Reshape-the-matrix.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0566_Reshape_the_matrix_Test.cs
Permutation in Stringhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0567.Permutation-in-string
CheckInclusionhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0567.Permutation-in-string/0567-Permutation-in-string.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0567_Permutation_in_string_Test.cs
N-ary Tree Preorder Traversalhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0589.N-ary-tree-preorder-traversal
Preorderhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0589.N-ary-tree-preorder-traversal/0589-N-ary-tree-preorder-traversal.cs
https://github.com/FakeStandard/LeetCode-CSharp#601-700
Valid Triangle Numberhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0611.Valid-triangel-number
TriangleNumberhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0611.Valid-triangel-number/0611-Valid-triangle-number.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0611_Valid_triangle_number_Test.cs
Merge Two Binary Treeshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0617.Merge-two-binary-trees
MergeTreeshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0617.Merge-two-binary-trees/0617-Merge-two-binary-trees.cs
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
Two Sum IV - Input is a BSThttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0653.Two-sum-IV-input-is-a-BST
FindTargethttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0653.Two-sum-IV-input-is-a-BST/0653-Two-sum-IV-input-is-a-BST.cs
Baseball Gamehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0682.Baseball-game
CalPointshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0682.Baseball-game/0682-Baseball-game.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0682_Baseball_game_Test.cs
Max Area of Islandhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0695.Max-area-of-island
MaxAreaOfIslandhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0695.Max-area-of-island/0695-Max-area-of-island.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0695_Max_area_of_island_Test.cs
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
Search in a Binary Search Treehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0700.Search-in-a-inary-search-tree
SearchBSThttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0700.Search-in-a-inary-search-tree/0700-Search-in-a-inary-search-tree.cs
https://github.com/FakeStandard/LeetCode-CSharp#701-800
Insert into a Binary Search Treehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0701.Insert-into-a-binary-search-tree
InsertIntoBSThttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0701.Insert-into-a-binary-search-tree/0701-Insert-into-a-binary-search-tree.cs
Binary Searchhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0704.Binary-search
Searchhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0704.Binary-search/0704-Binary-search.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0704_Binary_search_Test.cs
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
Design HashMaphttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0706.Design-hashmap
MyHashMaphttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0706.Design-hashmap/0706-Design-hashmap.cs
Design Linked Listhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0707.Design-linked-list
MyLinkedListhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0707.Design-linked-list/0707-Design-linked-list.cs
To Lower Casehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0709.To-lower-case
ToLowerCasehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0709.To-lower-case/0709-To-lower-case.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0709_To_lower_case_Test.cs
1-bit and 2-bit Charactershttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0717.1-bit-and-2-bit-characters
IsOneBitCharacterhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0717.1-bit-and-2-bit-characters/0717-1-bit-and-2-bit-characters.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0717_1_bit_and_2_bit_characters_Test.cs
Maximum Length of Repeated Subarrayhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0718.Maximum-length-of-repeated-subarray
FindLengthhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0718.Maximum-length-of-repeated-subarray/0718-Maximum-length-of-repeated-subarray.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0718_Maximum_length_of_repeated_subarray_Test.cs
Self Dividing Numbershttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0728.Self-dividing-numbers
SelfDividingNumbershttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0728.Self-dividing-numbers/0728-Self-dividing-numbers.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0728_Self_dividing_numbers_Test.cs
Flood Fillhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0733.Flood-fill
FloodFillhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0733.Flood-fill/0733-Flood-fill.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0733_Flood_fill_Test.cs
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
Jewels and Stoneshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0771.Jewels-and-stones
NumJewelsInStoneshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0771.Jewels-and-stones/0771-Jewels-and-stones.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0771_Jewels_and_stones_Test.cs
Letter Case Permutationhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0784.Letter-case-permutation
LetterCasePermutationhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0784.Letter-case-permutation/0784-Letter-case-permutation.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0784_Letter_case_permutation_Test.cs
Custom Sort Stringhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0791.Custom-sort-string
❓ CustomSortStringhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0791.Custom-sort-string/0791-Custom-sort-string.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0791_Custom_sort_string_Test.cs
https://github.com/FakeStandard/LeetCode-CSharp#801-900
Goat Latinhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0824.Goat-latin
ToGoatLatinhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0824.Goat-latin/0824-Goat-latin.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0824_goat_latin_Test.cs
Keys and Roomshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0841.Keys-and-rooms
CanVisitAllRoomshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0841.Keys-and-rooms/0841-Keys-and-rooms.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0841_Keys_and_rooms_Test.cs
Peak Index in a Mountain Arrayhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0852.Peak-index-in-a-mountain-array
PeakIndexInMountainArrayhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0852.Peak-index-in-a-mountain-array/0852-Peak-index-in-a-mountain-array.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0852_Peak_index_in_a_mountain_array_Test.cs
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
Middle of the Linked Listhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0876.Middle-of-the-linked-list
MiddleNodehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0876.Middle-of-the-linked-list/0876-Middle-of-the-linked-list.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0876_Middle_of_the_linked_list_Test.cs
Increasing Order Search Treehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0897.Increasing-order-search-tree
IncreasingBSThttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0897.Increasing-order-search-tree/0897-Increasing-order-search-tree.cs
https://github.com/FakeStandard/LeetCode-CSharp#901-1000
Sort Array By Parityhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0905.Sort-array-by-parity
SortArrayByParityhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0905.Sort-array-by-parity/0905-Sort-array-by-parity.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0905_Sort_array_by_parity_Test.cs
Sort an Arrayhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0912.Sort-an-array
SortArrayhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0912.Sort-an-array/0912-Sort-an-array.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0912_Sort_an_array_Test.cs
Reverse Only Lettershttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0917.Reverse-only-letters
ReverseOnlyLettershttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0917.Reverse-only-letters/0917-Reverse-only-letters.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0917_Reverse_only_letters_Test.cs
Range Sum of BSThttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0938.Range-sum-of-BST
RangeSumBSThttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0938.Range-sum-of-BST/0938-Range-sum-of-BST.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0938_Range_sum_of_BST_Test.cs
N-Repeated Element in Size 2N Arrayhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0961.N-repeated-element-in-size-2n-array
RepeatedNTimeshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0961.N-repeated-element-in-size-2n-array/0961-N-repeated-element-in-size-2n-array.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0961_N_repeated_element_in_size_2n_array_Test.cs
Squares of a Sorted Arrayhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0977.Squares-of-a-sort-array
SortedSquareshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0977.Squares-of-a-sort-array/0977-Squares-of-a-sort-array.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0977_Squares_of_a_sort_array_Test.cs
Rotting Orangeshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0994.Rotting-oranges
OrangesRottinghttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0994.Rotting-oranges/0994-Rotting-oranges.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0994_Rotting_oranges_Test.cs
Find the Town Judgehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0997.Find-the-town-judge
FindJudgehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/0997.Find-the-town-judge/0997-Find-the-town-judge.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_0997_Find_the_town_judge_Test.cs
https://github.com/FakeStandard/LeetCode-CSharp#1001-1100
Sum of Root To Leaf Binary Numbershttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1022.Sum-of-root-to-leaf-binary-numbers
SumRootToLeafhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1022.Sum-of-root-to-leaf-binary-numbers/1022-Sum-of-root-to-leaf-binary-numbers.cs
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
Remove All Adjacent Duplicates In Stringhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1047.Remove-all-adjacent-duplicates-in-string
RemoveDuplicateshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1047.Remove-all-adjacent-duplicates-in-string/1047-Remove-all-adjacent-duplicates-in-string.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1047_Remove_all_adjacent_duplicates_in_string_Test.cs
https://github.com/FakeStandard/LeetCode-CSharp#1101-1200
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
Defanging an IP Addresshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1108.Defanging-an-IP-address
DefangIPaddrhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1108.Defanging-an-IP-address/1108-Defanging-an-IP-address.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1108_Defanging_an_IP_address_Test.cs
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp#1201-1300
Unique Number of Occurrenceshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1207.Unique-number-of-occurrences
UniqueOccurrenceshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1207.Unique-number-of-occurrences/1207-Unique-number-of-occurrences.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1207_Unique_number_of_occurrences_Test.cs
Count Vowels Permutationhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1220.Count-vowels-permutation
CountVowelPermutationhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1220.Count-vowels-permutation/1220-Count-vowels-permutation.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1220_Count_vowels_permutation_Test.cs
Split a String in Balanced Stringshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1221.Split-a-string-in-balanced-strings
BalancedStringSplithttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1221.Split-a-string-in-balanced-strings/1221-Split-a-string-in-balanced-strings.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1221_Split_a_string_in_balanced_strings_Test.cs
Minimum Remove to Make Valid Parentheseshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1249.Minimum-remove-to-make-valid-parentheses
MinRemoveToMakeValidhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1249.Minimum-remove-to-make-valid-parentheses/1249-Minimum-remove-to-make-valid-parentheses.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1249_Minimum_remove_to_make_valid_parentheses_Test.cs
Subtract the Product and Sum of Digits of an Integerhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1281.Subtract-the-product-and-sum-of-digits-of-an-integer
SubtractProductAndSumhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1281.Subtract-the-product-and-sum-of-digits-of-an-integer/1281-Subtract-the-product-and-sum-of-digits-of-an-integer.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1281_Subtract_the_product_and_sum_of_digits_of_an_integer_Test.cs
Convert Binary Number in a Linked List to Integerhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1290.Convert-binary-number-in-a-linked-list-to-integer
GetDecimalValuehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1290.Convert-binary-number-in-a-linked-list-to-integer/1290-Convert-binary-number-in-a-linked-list-to-integer.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1290_Convert_binary_number_in_a_linked_list_to_integer_Test.cs
Find Numbers with Even Number of Digitshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1295.Find-numbers-with-even-number-of-digits
FindNumbershttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1295.Find-numbers-with-even-number-of-digits/1295-Find-numbers-with-even-number-of-digits.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1295_Find_numbers_with_even_number_of_digits_Test.cs
Replace Elements with Greatest Element on Right Sidehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1299.Replace-elements-with-greatest-element-on-right-side
ReplaceElementshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1299.Replace-elements-with-greatest-element-on-right-side/1299-Replace-elements-with-greatest-element-on-right-side.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1299_Replace_elements_with_greatest_element_on_right_side_Test.cs
https://github.com/FakeStandard/LeetCode-CSharp#1301-
Decompress Run-Length Encoded Listhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1313.Decompress-run-length-encoded-list
DecompressRLElisthttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1313.Decompress-run-length-encoded-list/1313-Decompress-run-length-encoded-list.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1313_Decompress_run_length_encoded_list_Test.cs
Nnumber of Steps to Reduce a Number to Zerohttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1342.Number-of-steps-to-reduce-a-number-to-zero
NumberOfStepshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1342.Number-of-steps-to-reduce-a-number-to-zero/1342-Number-of-steps-to-reduce-a-number-to-zero.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1342_Number_of_steps_to_reduce_a_number_to_zero_Test.cs
Count Negative Numbers in a Sorted Matrixhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1351.Count-negative-numbers-in-a-sorted-matrix
CountNegativeshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1351.Count-negative-numbers-in-a-sorted-matrix/1351-Count-negative-numbers-in-a-sorted-matrix.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1351_Count_negative_numbers_in_a_sorted_matrix_Test.cs
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
How Many Numbers Are Smaller Than the Current Numberhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1365.How-many-numbers-are-smaller-than-current-number
SmallerNumbersThanCurrenthttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1365.How-many-numbers-are-smaller-than-current-number/1365-How-many-numbers-are-smaller-than-current-number.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1365_How_many_numbers_are_smaller_than_current_number_Test.cs
Increasing Decreasing Stringhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1370.Increasing-decreasin-string
SortStringhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1370.Increasing-decreasin-string/1370-Increasing-decreasin-string.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1370_Increasing_decreasin_string_Test.cs
Lucky Numbers in a Matrixhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1380.Lucky-numbers-in-a-matrix
LuckyNumbershttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1380.Lucky-numbers-in-a-matrix/1380-Lucky-numbers-in-a-matrix.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1380_Lucky_numbers_in_a_matrix_Test.cs
Create Target Array in the Given Orderhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1389.Create-target-array-in-the-given-order
CreateTargetArrayhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1389.Create-target-array-in-the-given-order/1389-Create-target-array-in-the-given-order.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1389_Create_target_array_in_the_given_order_Test.cs
Kids With the Greatest Number of Candieshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1431.Kids-with-the-greatest-number-of-candies
KidsWithCandieshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1431.Kids-with-the-greatest-number-of-candies/1431-Kids-with-the-greatest-number-of-candies.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1431_Kids_with_the_greatest_number_of_candies_Test.cs
Destination Cityhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1436.Destination-city
DestCityhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1436.Destination-city/1436-Destination-city.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1436_Destination_city_Test.cs
Make Two Arrays Equal by Reversing Sub-arrayshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1460.Make-two-arrays-equal-by-reversing-sub-arrays
CanBeEqualhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1460.Make-two-arrays-equal-by-reversing-sub-arrays/1460-Make-two-arrays-equal-by-reversing-sub-arrays.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1460_Make_two_arrays_equal_by_reversing_sub_arrays_Test.cs
Shuffle the Arrayhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1470.Shuffle-the-array
Shufflehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1470.Shuffle-the-array/1470-Shuffle-the-array.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1470_Shuffle_the_array_Test.cs
Running Sum of 1d Arrayhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1480.Running-sum-of-1d-array
RunningSumhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1480.Running-sum-of-1d-array/1480-Running-sum-of-1d-array.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1480_Running_sum_of_1d_array_Test.cs
XOR Operation in an Arrayhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1486.XOR-Operation-in-an-array
XorOperationhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1486.XOR-Operation-in-an-array/1486-XOR-Operation-in-an-array.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1486_XOR_Operation_in_an_array_Test.cs
Number of Good Pairshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1491.Average-salary-excluding-the-minimum-and-maximum-salary
Averagehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1491.Average-salary-excluding-the-minimum-and-maximum-salary/1491-Average-salary-excluding-the-minimum-and-maximum-salary.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1491_Average_salary_excluding_the_minimum_and_maximum_salary_Test.cs
Number of Good Pairshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1512.Number-of-good-pairs
NumIdenticalPairshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1512.Number-of-good-pairs/1512-Number-of-good-pairs.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1512_Number_of_good_pairs_Test.cs
Count Odd Numbers in an Interval Rangehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1523.Count-odd-numbers-in-an-interval-range
CountOddshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1523.Count-odd-numbers-in-an-interval-range/1523-Count-odd-numbers-in-an-interval-range.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1523_Count_odd_numbers_in_an_interval_range_Test.cs
Shuffle Stringhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1528.Shuffle-string
RestoreStringhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1528.Shuffle-string/1528-Shuffle-string.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1528_Shuffle_string_Test.cs
Count Good Tripletshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1534.Count-good-triplets
CountGoodTripletshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1534.Count-good-triplets/1534-Count-good-triplets.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1534_Count_good_triplets_Test.cs
Minimum Number of Vertices to Reach All Nodeshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1557.Minimum-number-of-vertices-to-reach-all-nodes
FindSmallestSetOfVerticeshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1557.Minimum-number-of-vertices-to-reach-all-nodes/1557-Minimum-number-of-vertices-to-reach-all-nodes.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1557_Minimum_number_of_vertices_to_reach_all_nodes_Test.cs
Sum of All Odd Length Subarrayshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1588.Sum-of-all-odd-length-subarrays
SumOddLengthSubarrayshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1588.Sum-of-all-odd-length-subarrays/1588-Sum-of-all-odd-length-subarrays.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1588_Sum_of_all_add_length_subarrays_Test.cs
Design Parking Systemhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1603.Design-parking-system
ParkingSystemhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1603.Design-parking-system/1603-Design-parking-system.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1603_Design_parking_system_Test.cs
Maximum Nesting Depth of the Parentheseshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1614.Maximum-nesting-depth-of-the-parentheses
MaxDepthhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1614.Maximum-nesting-depth-of-the-parentheses/1614-Maximum-nesting-depth-of-the-parentheses.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1614_Maximum_nesting_depth_of_the_parentheses_Test.cs
Sort Array by Increasing Frequencyhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1636.Sort-array-by-increasing-frequency
FrequencySorthttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1636.Sort-array-by-increasing-frequency/1636-Sort-array-by-increasing-frequency.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1636_Sort_array_by_increasing_frequency_Test.cs
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
Check If Two String Arrays are Equivalenthttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1662.Check-if-two-string-arrays-are-equivalent
ArrayStringsAreEqualhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1662.Check-if-two-string-arrays-are-equivalent/1662-Check-if-two-string-arrays-are-equivalent.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1662_Check_if_two_string_arrays_are_equivalent_Test.cs
Richest Customer Wealthhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1672.Richest-customer-wealth
MaximumWealthhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1672.Richest-customer-wealth/1672-Richest-customer-wealth.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1672_Richest_customer_wealth_Test.cs
Goal Parser Interpretationhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1678.Goal-parser-interpretation
Interprethttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1678.Goal-parser-interpretation/1678-Goal-parser-interpretation.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1678_Goal_parser_interpretation_Test.cs
Count the Number of Consistent Stringshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1684.Count-the-number-of-consistent-strings
CountConsistentStringshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1684.Count-the-number-of-consistent-strings/1684-Count-the-number-of-consistent-strings.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1684_Count_the_number_of_consistent_strings_Test.cs
Count of Matches in Tournamenthttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1688.Count-of-matches-in-tournament
NumberOfMatcheshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1688.Count-of-matches-in-tournament/1688-Count-of-matches-in-tournament.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1688_Count_of_matches_in_tournament_Test.cs
Number of Students Unable to Eat Lunchhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1700.Number-of-students-unabled-to-eat-lunch
CountStudentshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1700.Number-of-students-unabled-to-eat-lunch/1700-Number-of-students-unabled-to-eat-lunch.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1700_Number_of_students_unable_to_eat_lunch_Test.cs
Calculate Money in Leetcode Bankhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1716.Calculate-money-in-leetcode-bank
TotalMoneyhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1716.Calculate-money-in-leetcode-bank/1716-Calculate-money-in-leetcode-bank.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1716_Calculate_money_in_leetcode_bank_Test.cs
Decode XORed Arrayhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1720.Decode-XORed-array
Decodehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1720.Decode-XORed-array/1720-Decode-XORed-array.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1720_Decode_XORed_array_Test.cs
Sum of Unique Elementshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1748.Sum-of-unique-elements
SumOfUniquehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1748.Sum-of-unique-elements/1748-Sum-of-unique-elements.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1748_Sum_of_unique_element_Test.cs
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
Merge Strings Alternatelyhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1768.Merge-strings-alternately
MergeAlternatelyhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1768.Merge-strings-alternately/1768-Merge-strings-alternately.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1768_Merge_strings_alternately_Test.cs
Count Items Matching a Rulehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1773.Count-items-matching-a-rule
CountMatcheshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1773.Count-items-matching-a-rule/1773-Count-items-matching-a-rule.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1773_Count_items_matching_a_rule_Test.cs
Check if Binary String Has at Most One Segment of Oneshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1784.Check-if-binary-string-has-at-most-one-segment-of-ones
CheckOnesSegmenthttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1784.Check-if-binary-string-has-at-most-one-segment-of-ones/1784-Check-if-binary-string-has-at-most-one-segment-of-ones.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1784_Check_if_binary_string_has_at_most_one_segment_of_ones_Test.cs
Check if One String Swap Can Make Strings Equalhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1790.Check-if-one-string-swap-can-make-strings-equal
AreAlmostEqualhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1790.Check-if-one-string-swap-can-make-strings-equal/1790-Check-if-one-string-swap-can-make-strings-equal.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1790_Check_if_one_string_swap_can_make_strings_equal_Test.cs
Second Largest Digit in a Stringhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1796.Second-largest-digit-in-a-string
SecondHighesthttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1796.Second-largest-digit-in-a-string/1796-Second-largest-digit-in-a-string.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1796_Second_largest_digit_in_a_string_Test.cs
Maximum Ascending Subarray Sumhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1800.Maximum-ascending-subarray-sum
MaxAscendingSumhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1800.Maximum-ascending-subarray-sum/1800-Maximum-ascending-subarray-sum.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1800_Maximum_ascending_subarray_sum_Test.cs
Number of Different Integers in a Stringhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1805.Number-of-different-integers-in-a-string
NumDifferentIntegershttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1805.Number-of-different-integers-in-a-string/1805-Number-of-different-integers-in-a-string.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1805_Number_of_different_integers_in_a_string_Test.cs
Truncate Sentencehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1816.Truncate-sentence
TruncateSentencehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1816.Truncate-sentence/1816-Truncate-sentence.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1816_Truncate_sentence_Test.cs
Sign of the Product of an Arrayhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1822.Sign-of-the-product-of-an-array
ArraySignhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1822.Sign-of-the-product-of-an-array/1822-Sign-of-the-product-of-an-array.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1822_Sign_of_the_product_of_an_array_Test.cs
Find the Winner of the Circular Gamehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1823.Find-the-winner-of-the-circular-game
FindTheWinnerhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1823.Find-the-winner-of-the-circular-game/1823-Find-the-winner-of-the-circular-game.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1823_Find_the_winner_of_the_circular_game_Test.cs
Minimum Operations to Make the Array Increasinghttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1827.Minimum-operations-to-make-the-array-increasing
MinOperationshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1827.Minimum-operations-to-make-the-array-increasing/1827-Minimum-operations-to-make-the-array-increasing.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1827_Minimum_operations_to_make_the_array_increasing_Test.cs
Check if the Sentence Is Pangramhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1832.Check-if-the-sentence-is-pangram
CheckIfPangramhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1832.Check-if-the-sentence-is-pangram/1832-Check-if-the-sentence-is-pangram.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1832_Check_if_the_sentence_is_pangram_Test.cs
Sum of Digits in Base Khttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1837.Sum-of-digits-in-base-K
SumBasehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1837.Sum-of-digits-in-base-K/1837-Sum-of-digits-in-base-K.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1837_Sum_of_digits_in_base_K_Test.cs
Longest Substring Of All Vowels in Orderhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1839.Longest-substring-of-all-vowels-in-order
LongestBeautifulSubstringhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1839.Longest-substring-of-all-vowels-in-order/1839-Longest-substring-of-all-vowels-in-order.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1839_Longest_substring_of_all_vowels_in_order_Test.cs
Replace All Digits with Charactershttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1844.Replace-all-digits-with-characters
ReplaceDigitshttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1844.Replace-all-digits-with-characters/1844-Replace-all-digits-with-characters.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1844_Replace_all_digits_with_characters_Test.cs
Minimum Distance to the Target Elementhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1848.Minimum-distance-to-the-target-element
GetMinDistancehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/1848.Minimum-distance-to-the-target-element/1848-Minimum-distance-to-the-target-element.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_1848_Minimum_distance_to_the_target_element_Test.cs
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp#2001-
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
Count Number of Pairs With Absolute Difference Khttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/2006.Count-number-of-pairs-with-absolute-difference-k
CountKDifferencehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/2006.Count-number-of-pairs-with-absolute-difference-k/2006-Count-number-of-pairs-with-absolute-difference-k.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_2006_Count_number_of_pairs_with_absolute_difference_k_Test.cs
Delete the Middle Node of a Linked Listhttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/2095.Delete-the-middle-node-of-a-linked-list
DeleteMiddlehttps://github.com/FakeStandard/LeetCode-CSharp/blob/main/Solution/2095.Delete-the-middle-node-of-a-linked-list/2095-Delete-the-middle-node-of-a-linked-list.cs
πŸ’‘https://github.com/FakeStandard/LeetCode-CSharp/blob/main/UnitTest/_2095_Delete_the_middle_node_of_a_linked_list_Test.cs
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
https://github.com/FakeStandard/LeetCode-CSharp/blob/main
csharp https://github.com/topics/csharp
leetcode https://github.com/topics/leetcode
Readme https://github.com/FakeStandard/LeetCode-CSharp#readme-ov-file
Please reload this pagehttps://github.com/FakeStandard/LeetCode-CSharp
Activityhttps://github.com/FakeStandard/LeetCode-CSharp/activity
0 forkshttps://github.com/FakeStandard/LeetCode-CSharp/forks
Report repository https://github.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2FFakeStandard%2FLeetCode-CSharp&report=FakeStandard+%28user%29
Releaseshttps://github.com/FakeStandard/LeetCode-CSharp/releases
Packages 0https://github.com/users/FakeStandard/packages?repo_name=LeetCode-CSharp
Please reload this pagehttps://github.com/FakeStandard/LeetCode-CSharp
Contributorshttps://github.com/FakeStandard/LeetCode-CSharp/graphs/contributors
Please reload this pagehttps://github.com/FakeStandard/LeetCode-CSharp
C# 100.0% https://github.com/FakeStandard/LeetCode-CSharp/search?l=c%23
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

Viewport: width=device-width


URLs of crawlers that visited me.