René's URL Explorer Experiment


Title: GitHub - pytdev/LeetCode-in-Net: C#-based LeetCode algorithm problem solutions, regularly updated. · GitHub

Open Graph Title: GitHub - pytdev/LeetCode-in-Net: C#-based LeetCode algorithm problem solutions, regularly updated.

X Title: GitHub - pytdev/LeetCode-in-Net: C#-based LeetCode algorithm problem solutions, regularly updated.

Description: C#-based LeetCode algorithm problem solutions, regularly updated. - pytdev/LeetCode-in-Net

Open Graph Description: C#-based LeetCode algorithm problem solutions, regularly updated. - pytdev/LeetCode-in-Net

X Description: C#-based LeetCode algorithm problem solutions, regularly updated. - pytdev/LeetCode-in-Net

Opengraph URL: https://github.com/pytdev/LeetCode-in-Net

X: @github

direct link

Domain: github.com

route-pattern/:user_id/:repository
route-controllerfiles
route-actiondisambiguate
fetch-noncev2:cbad79a9-81ea-2285-d9e5-4625e8759b48
current-catalog-service-hashf3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb
request-idAA9C:24568D:CBF378:1144E61:6A4C56ED
html-safe-nonce701f2f6cb2c6d4f3210e433fe605bac28762f91de9abc396b749b88605380c62
visitor-payloadeyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJBQTlDOjI0NTY4RDpDQkYzNzg6MTE0NEU2MTo2QTRDNTZFRCIsInZpc2l0b3JfaWQiOiI2MzY0NzgxMTQzNzQ5NTgwNTI1IiwicmVnaW9uX2VkZ2UiOiJpYWQiLCJyZWdpb25fcmVuZGVyIjoiaWFkIn0=
visitor-hmacc87f00f448205a028c9f25e1eab3bf87add9e5b32c80170a1c85ed9f99b51274
hovercard-subject-tagrepository:737733484
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/pytdev/LeetCode-in-Net
twitter:imagehttps://opengraph.githubassets.com/ac0a4104ddcc087effefae51c53ead36972a07028d155b4311e341cfbd807787/pytdev/LeetCode-in-Net
twitter:cardsummary_large_image
og:imagehttps://opengraph.githubassets.com/ac0a4104ddcc087effefae51c53ead36972a07028d155b4311e341cfbd807787/pytdev/LeetCode-in-Net
og:image:altC#-based LeetCode algorithm problem solutions, regularly updated. - pytdev/LeetCode-in-Net
og:image:width1200
og:image:height600
og:site_nameGitHub
og:typeobject
hostnamegithub.com
expected-hostnamegithub.com
None3d11bb817438277de2a940854450e83a7d32b6aeb5014e9e6b00a6423900251c
turbo-cache-controlno-cache
go-importgithub.com/pytdev/LeetCode-in-Net git https://github.com/pytdev/LeetCode-in-Net.git
octolytics-dimension-user_id28451488
octolytics-dimension-user_loginpytdev
octolytics-dimension-repository_id737733484
octolytics-dimension-repository_nwopytdev/LeetCode-in-Net
octolytics-dimension-repository_publictrue
octolytics-dimension-repository_is_forktrue
octolytics-dimension-repository_parent_id728976372
octolytics-dimension-repository_parent_nwoLeetCode-in-Net/LeetCode-in-Net
octolytics-dimension-repository_network_root_id728976372
octolytics-dimension-repository_network_root_nwoLeetCode-in-Net/LeetCode-in-Net
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
release14099438da5379150f15a2892474c7c7e6c0e55e
ui-targetfull
theme-color#1e2327
color-schemelight dark

Links:

Skip to contenthttps://github.com/pytdev/LeetCode-in-Net#start-of-content
https://github.com/
Sign in https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2Fpytdev%2FLeetCode-in-Net
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%2Fpytdev%2FLeetCode-in-Net
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=pytdev%2FLeetCode-in-Net
Reloadhttps://github.com/pytdev/LeetCode-in-Net
Reloadhttps://github.com/pytdev/LeetCode-in-Net
Reloadhttps://github.com/pytdev/LeetCode-in-Net
Please reload this pagehttps://github.com/pytdev/LeetCode-in-Net
pytdev https://github.com/pytdev
LeetCode-in-Nethttps://github.com/pytdev/LeetCode-in-Net
LeetCode-in-Net/LeetCode-in-Nethttps://github.com/LeetCode-in-Net/LeetCode-in-Net
Notifications https://github.com/login?return_to=%2Fpytdev%2FLeetCode-in-Net
Fork 0 https://github.com/login?return_to=%2Fpytdev%2FLeetCode-in-Net
Star 0 https://github.com/login?return_to=%2Fpytdev%2FLeetCode-in-Net
Code https://github.com/pytdev/LeetCode-in-Net
Pull requests 0 https://github.com/pytdev/LeetCode-in-Net/pulls
Actions https://github.com/pytdev/LeetCode-in-Net/actions
Projects https://github.com/pytdev/LeetCode-in-Net/projects
Security and quality 0 https://github.com/pytdev/LeetCode-in-Net/security
Insights https://github.com/pytdev/LeetCode-in-Net/pulse
Code https://github.com/pytdev/LeetCode-in-Net
Pull requests https://github.com/pytdev/LeetCode-in-Net/pulls
Actions https://github.com/pytdev/LeetCode-in-Net/actions
Projects https://github.com/pytdev/LeetCode-in-Net/projects
Security and quality https://github.com/pytdev/LeetCode-in-Net/security
Insights https://github.com/pytdev/LeetCode-in-Net/pulse
https://github.com/pytdev/LeetCode-in-Net
Brancheshttps://github.com/pytdev/LeetCode-in-Net/branches
Tagshttps://github.com/pytdev/LeetCode-in-Net/tags
https://github.com/pytdev/LeetCode-in-Net/branches
https://github.com/pytdev/LeetCode-in-Net/tags
103 Commitshttps://github.com/pytdev/LeetCode-in-Net/commits/main/
https://github.com/pytdev/LeetCode-in-Net/commits/main/
.github/workflowshttps://github.com/pytdev/LeetCode-in-Net/tree/main/.github/workflows
.github/workflowshttps://github.com/pytdev/LeetCode-in-Net/tree/main/.github/workflows
LeetCodeNet.Testshttps://github.com/pytdev/LeetCode-in-Net/tree/main/LeetCodeNet.Tests
LeetCodeNet.Testshttps://github.com/pytdev/LeetCode-in-Net/tree/main/LeetCodeNet.Tests
LeetCodeNethttps://github.com/pytdev/LeetCode-in-Net/tree/main/LeetCodeNet
LeetCodeNethttps://github.com/pytdev/LeetCode-in-Net/tree/main/LeetCodeNet
.editorconfighttps://github.com/pytdev/LeetCode-in-Net/blob/main/.editorconfig
.editorconfighttps://github.com/pytdev/LeetCode-in-Net/blob/main/.editorconfig
.gitignorehttps://github.com/pytdev/LeetCode-in-Net/blob/main/.gitignore
.gitignorehttps://github.com/pytdev/LeetCode-in-Net/blob/main/.gitignore
LICENSEhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LICENSE
LICENSEhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LICENSE
LeetCodeNet.slnhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet.sln
LeetCodeNet.slnhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet.sln
README.mdhttps://github.com/pytdev/LeetCode-in-Net/blob/main/README.md
README.mdhttps://github.com/pytdev/LeetCode-in-Net/blob/main/README.md
READMEhttps://github.com/pytdev/LeetCode-in-Net
MIT licensehttps://github.com/pytdev/LeetCode-in-Net
https://github.com/pytdev/LeetCode-in-Net#leetcode-in-net
https://github.com/LeetCode-in-Net/LeetCode-in-Net/blob/main/LICENSE
https://github.com/LeetCode-in-Net/LeetCode-in-Net/actions/workflows/dotnet-desktop.yml
https://sonarcloud.io/summary/new_code?id=LeetCode-in-Net_LeetCode-in-Net
https://github.com/LeetCode-in-Net/LeetCode-in-Net
https://github.com/LeetCode-in-Net/LeetCode-in-Net/fork
"For coding interview preparation, LeetCode is one of the best online resource providing a rich library of more than 300 real coding interview questions for you to practice from using one of the 7 supported languages - C, C++, Java, Python, C#, JavaScript, Ruby."https://www.quora.com/How-effective-is-Leetcode-for-preparing-for-technical-interviews
Level 1https://github.com/pytdev/LeetCode-in-Net#level-1
Level 2https://github.com/pytdev/LeetCode-in-Net#level-2
Udemyhttps://github.com/pytdev/LeetCode-in-Net#udemy
Top Interview 150https://github.com/pytdev/LeetCode-in-Net#top-interview-150
Data Structure Ihttps://github.com/pytdev/LeetCode-in-Net#data-structure-i
Data Structure IIhttps://github.com/pytdev/LeetCode-in-Net#data-structure-ii
Algorithm Ihttps://github.com/pytdev/LeetCode-in-Net#algorithm-i
Algorithm IIhttps://github.com/pytdev/LeetCode-in-Net#algorithm-ii
Binary Search Ihttps://github.com/pytdev/LeetCode-in-Net#binary-search-i
Binary Search IIhttps://github.com/pytdev/LeetCode-in-Net#binary-search-ii
Dynamic Programming Ihttps://github.com/pytdev/LeetCode-in-Net#dynamic-programming-i
Programming Skills Ihttps://github.com/pytdev/LeetCode-in-Net#programming-skills-i
Programming Skills IIhttps://github.com/pytdev/LeetCode-in-Net#programming-skills-ii
Graph Theory Ihttps://github.com/pytdev/LeetCode-in-Net#graph-theory-i
SQL Ihttps://github.com/pytdev/LeetCode-in-Net#sql-i
https://github.com/pytdev/LeetCode-in-Net#level-1
https://github.com/pytdev/LeetCode-in-Net#day-1-prefix-sum
https://github.com/pytdev/LeetCode-in-Net#day-2-string
Isomorphic Stringshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0205_isomorphic_strings/Solution.cs
Is Subsequencehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0301_0400/S0392_is_subsequence/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-3-linked-list
Merge Two Sorted Listshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0021_merge_two_sorted_lists/Solution.cs
Reverse Linked Listhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0206_reverse_linked_list/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-4-linked-list
Linked List Cycle IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0142_linked_list_cycle_ii/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-5-greedy
Best Time to Buy and Sell Stockhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0121_best_time_to_buy_and_sell_stock/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-6-tree
Binary Tree Level Order Traversalhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0102_binary_tree_level_order_traversal/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-7-binary-search
https://github.com/pytdev/LeetCode-in-Net#day-8-binary-search-tree
Validate Binary Search Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0098_validate_binary_search_tree/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-9-graphbfsdfs
Number of Islandshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0200_number_of_islands/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-10-dynamic-programming
Climbing Stairshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0070_climbing_stairs/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-11-dynamic-programming
Unique Pathshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0062_unique_paths/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-12-sliding-windowtwo-pointer
Find All Anagrams in a Stringhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0401_0500/S0438_find_all_anagrams_in_a_string/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-13-hashmap
Two Sumhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0001_two_sum/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-14-stack
Decode Stringhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0301_0400/S0394_decode_string/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-15-heap
https://github.com/pytdev/LeetCode-in-Net#level-2
https://github.com/pytdev/LeetCode-in-Net#day-1-implementationsimulation
Happy Numberhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0202_happy_number/Solution.cs
Spiral Matrixhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0054_spiral_matrix/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-2-string-1
Longest Common Prefixhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0014_longest_common_prefix/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-3-linked-list-1
Remove Nth Node From End of Listhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0019_remove_nth_node_from_end_of_list/Solution.cs
Palindrome Linked Listhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0234_palindrome_linked_list/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-4-linked-list-1
Sort Listhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0148_sort_list/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-5-greedy-1
https://github.com/pytdev/LeetCode-in-Net#day-6-tree-1
Invert Binary Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0226_invert_binary_tree/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-7-tree
Diameter of Binary Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0501_0600/S0543_diameter_of_binary_tree/Solution.cs
Path Sum IIIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0401_0500/S0437_path_sum_iii/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-8-binary-search
Search a 2D Matrixhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0074_search_a_2d_matrix/Solution.cs
Search in Rotated Sorted Arrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0033_search_in_rotated_sorted_array/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-9-binary-search-tree
Convert Sorted Array to Binary Search Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0108_convert_sorted_array_to_binary_search_tree/Solution.cs
Kth Smallest Element in a BSThttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0230_kth_smallest_element_in_a_bst/Solution.cs
Binary Search Tree Iteratorhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0173_binary_search_tree_iterator/BSTIterator.cs
https://github.com/pytdev/LeetCode-in-Net#day-10-graphbfsdfs
https://github.com/pytdev/LeetCode-in-Net#day-11-graphbfsdfs
Course Schedule IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0210_course_schedule_ii/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-12-dynamic-programming
House Robberhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0198_house_robber/Solution.cs
Coin Changehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0301_0400/S0322_coin_change/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-13-dynamic-programming
Partition Equal Subset Sumhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0401_0500/S0416_partition_equal_subset_sum/Solution.cs
Maximum Product Subarrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0152_maximum_product_subarray/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-14-sliding-windowtwo-pointer
Longest Substring Without Repeating Charactershttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0003_longest_substring_without_repeating_characters/Solution.cs
Minimum Window Substringhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0076_minimum_window_substring/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-15-tree
Same Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0100_same_tree/Solution.cs
Symmetric Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0101_symmetric_tree/Solution.cs
Binary Tree Right Side Viewhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0199_binary_tree_right_side_view/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-16-design
Min Stackhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0155_min_stack/MinStack.cs
Implement Trie (Prefix Tree)https://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0208_implement_trie_prefix_tree/Trie.cs
https://github.com/pytdev/LeetCode-in-Net#day-17-interval
Insert Intervalhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0057_insert_interval/Solution.cs
Merge Intervalshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0056_merge_intervals/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-18-stack
https://github.com/pytdev/LeetCode-in-Net#day-19-union-find
https://github.com/pytdev/LeetCode-in-Net#day-20-brute-forcebacktracking
Combination Sumhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0039_combination_sum/Solution.cs
Permutationshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0046_permutations/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#udemy
https://github.com/pytdev/LeetCode-in-Net#udemy-integers
Single Numberhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0136_single_number/Solution.cs
Reverse Integerhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0007_reverse_integer/Solution.cs
Palindrome Numberhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0009_palindrome_number/Solution.cs
Factorial Trailing Zeroeshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0172_factorial_trailing_zeroes/Solution.cs
Pow(x, n)https://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0050_powx_n/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#udemy-strings
Longest Common Prefixhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0014_longest_common_prefix/Solution.cs
Longest Substring Without Repeating Charactershttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0003_longest_substring_without_repeating_characters/Solution.cs
Valid Parentheseshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0020_valid_parentheses/Solution.cs
Longest Palindromic Substringhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0005_longest_palindromic_substring/Solution.cs
Decode Stringhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0301_0400/S0394_decode_string/Solution.cs
Valid Anagramhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0242_valid_anagram/Solution.cs
Group Anagramshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0049_group_anagrams/Solution.cs
Reverse Words in a Stringhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0151_reverse_words_in_a_string/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#udemy-binary-search
Search in Rotated Sorted Arrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0033_search_in_rotated_sorted_array/Solution.cs
Find Minimum in Rotated Sorted Arrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0153_find_minimum_in_rotated_sorted_array/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#udemy-arrays
Best Time to Buy and Sell Stockhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0121_best_time_to_buy_and_sell_stock/Solution.cs
Move Zeroeshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0283_move_zeroes/Solution.cs
Two Sumhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0001_two_sum/Solution.cs
Length of Last Wordhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0058_length_of_last_word/Solution.cs
Best Time to Buy and Sell Stock IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0122_best_time_to_buy_and_sell_stock_ii/Solution.cs
Remove Duplicates from Sorted Array IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0080_remove_duplicates_from_sorted_array_ii/Solution.cs
Rotate Arrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0189_rotate_array/Solution.cs
Jump Gamehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0055_jump_game/Solution.cs
Sort Colorshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0075_sort_colors/Solution.cs
Plus Onehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0066_plus_one/Solution.cs
Product of Array Except Selfhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0238_product_of_array_except_self/Solution.cs
First Missing Positivehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0041_first_missing_positive/Solution.cs
Sliding Window Maximumhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0239_sliding_window_maximum/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#udemy-two-pointers
Is Subsequencehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0301_0400/S0392_is_subsequence/Solution.cs
Valid Palindromehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0125_valid_palindrome/Solution.cs
Remove Duplicates from Sorted Arrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0026_remove_duplicates_from_sorted_array/Solution.cs
Trapping Rain Waterhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0042_trapping_rain_water/Solution.cs
3Sumhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0015_3sum/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#udemy-famous-algorithm
Maximum Subarrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0053_maximum_subarray/Solution.cs
Majority Elementhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0169_majority_element/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#udemy-sorting-algorithms
https://github.com/pytdev/LeetCode-in-Net#udemy-2d-arraysmatrix
Search a 2D Matrixhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0074_search_a_2d_matrix/Solution.cs
Spiral Matrixhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0054_spiral_matrix/Solution.cs
Rotate Imagehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0048_rotate_image/Solution.cs
Set Matrix Zeroeshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0073_set_matrix_zeroes/Solution.cs
Merge Intervalshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0056_merge_intervals/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#udemy-linked-list
Flatten Binary Tree to Linked Listhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0114_flatten_binary_tree_to_linked_list/Solution.cs
Rotate Listhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0061_rotate_list/Solution.cs
Swap Nodes in Pairshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0024_swap_nodes_in_pairs/Solution.cs
Linked List Cycle IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0142_linked_list_cycle_ii/Solution.cs
Linked List Cyclehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0141_linked_list_cycle/Solution.cs
Reverse Linked Listhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0206_reverse_linked_list/Solution.cs
Merge Two Sorted Listshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0021_merge_two_sorted_lists/Solution.cs
Intersection of Two Linked Listshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0160_intersection_of_two_linked_lists/Solution.cs
Palindrome Linked Listhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0234_palindrome_linked_list/Solution.cs
Copy List with Random Pointerhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0138_copy_list_with_random_pointer/Solution.cs
Reverse Nodes in k-Grouphttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0025_reverse_nodes_in_k_group/Solution.cs
LRU Cachehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0146_lru_cache/LRUCache.cs
https://github.com/pytdev/LeetCode-in-Net#udemy-tree-stack-queue
Binary Tree Inorder Traversalhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0094_binary_tree_inorder_traversal/Solution.cs
Binary Tree Level Order Traversalhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0102_binary_tree_level_order_traversal/Solution.cs
Binary Tree Zigzag Level Order Traversalhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0103_binary_tree_zigzag_level_order_traversal/Solution.cs
Convert Sorted Array to Binary Search Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0108_convert_sorted_array_to_binary_search_tree/Solution.cs
Diameter of Binary Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0501_0600/S0543_diameter_of_binary_tree/Solution.cs
Same Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0100_same_tree/Solution.cs
Invert Binary Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0226_invert_binary_tree/Solution.cs
Maximum Depth of Binary Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0104_maximum_depth_of_binary_tree/Solution.cs
Binary Tree Maximum Path Sumhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0124_binary_tree_maximum_path_sum/Solution.cs
Validate Binary Search Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0098_validate_binary_search_tree/Solution.cs
Lowest Common Ancestor of a Binary Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0236_lowest_common_ancestor_of_a_binary_tree/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#udemy-trie-and-heap
Implement Trie (Prefix Tree)https://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0208_implement_trie_prefix_tree/Trie.cs
https://github.com/pytdev/LeetCode-in-Net#udemy-graph
Number of Islandshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0200_number_of_islands/Solution.cs
Clone Graphhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0133_clone_graph/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#udemy-dynamic-programming
Trianglehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0120_triangle/Solution.cs
Word Breakhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0139_word_break/Solution.cs
Maximum Product Subarrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0152_maximum_product_subarray/Solution.cs
House Robberhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0198_house_robber/Solution.cs
Climbing Stairshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0070_climbing_stairs/Solution.cs
Minimum Path Sumhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0064_minimum_path_sum/Solution.cs
Longest Increasing Subsequencehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0300_longest_increasing_subsequence/Solution.cs
Longest Common Subsequencehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G1101_1200/S1143_longest_common_subsequence/Solution.cs
Edit Distancehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0072_edit_distance/Solution.cs
Regular Expression Matchinghttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0010_regular_expression_matching/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#udemy-backtrackingrecursion
Generate Parentheseshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0022_generate_parentheses/Solution.cs
Combination Sumhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0039_combination_sum/Solution.cs
Subsetshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0078_subsets/Solution.cs
Letter Combinations of a Phone Numberhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0017_letter_combinations_of_a_phone_number/Solution.cs
Permutationshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0046_permutations/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#udemy-bit-manipulation
Number of 1 Bitshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0191_number_of_1_bits/Solution.cs
Reverse Bitshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0190_reverse_bits/Solution.cs
Counting Bitshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0301_0400/S0338_counting_bits/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#udemy-design
Min Stackhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0155_min_stack/MinStack.cs
https://github.com/pytdev/LeetCode-in-Net#top-interview-150
https://github.com/pytdev/LeetCode-in-Net#top-interview-150-arraystring
Merge Sorted Arrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0088_merge_sorted_array/Solution.cs
Remove Elementhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0027_remove_element/Solution.cs
Remove Duplicates from Sorted Arrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0026_remove_duplicates_from_sorted_array/Solution.cs
Remove Duplicates from Sorted Array IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0080_remove_duplicates_from_sorted_array_ii/Solution.cs
Majority Elementhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0169_majority_element/Solution.cs
Rotate Arrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0189_rotate_array/Solution.cs
Best Time to Buy and Sell Stockhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0121_best_time_to_buy_and_sell_stock/Solution.cs
Best Time to Buy and Sell Stock IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0122_best_time_to_buy_and_sell_stock_ii/Solution.cs
Jump Gamehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0055_jump_game/Solution.cs
Jump Game IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0045_jump_game_ii/Solution.cs
H-Indexhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0274_h_index/Solution.cs
Insert Delete GetRandom O(1)https://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0301_0400/S0380_insert_delete_getrandom_o1/RandomizedSet.cs
Product of Array Except Selfhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0238_product_of_array_except_self/Solution.cs
Gas Stationhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0134_gas_station/Solution.cs
Candyhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0135_candy/Solution.cs
Trapping Rain Waterhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0042_trapping_rain_water/Solution.cs
Roman to Integerhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0013_roman_to_integer/Solution.cs
Integer to Romanhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0012_integer_to_roman/Solution.cs
Length of Last Wordhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0058_length_of_last_word/Solution.cs
Longest Common Prefixhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0014_longest_common_prefix/Solution.cs
Reverse Words in a Stringhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0151_reverse_words_in_a_string/Solution.cs
Zigzag Conversionhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0006_zigzag_conversion/Solution.cs
Find the Index of the First Occurrence in a Stringhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0028_find_the_index_of_the_first_occurrence_in_a_string/Solution.cs
Text Justificationhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0068_text_justification/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#top-interview-150-two-pointers
Valid Palindromehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0125_valid_palindrome/Solution.cs
Is Subsequencehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0301_0400/S0392_is_subsequence/Solution.cs
Two Sum II - Input Array Is Sortedhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0167_two_sum_ii_input_array_is_sorted/Solution.cs
Container With Most Waterhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0011_container_with_most_water/Solution.cs
3Sumhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0015_3sum/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#top-interview-150-sliding-window
Minimum Size Subarray Sumhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0209_minimum_size_subarray_sum/Solution.cs
Longest Substring Without Repeating Charactershttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0003_longest_substring_without_repeating_characters/Solution.cs
Substring with Concatenation of All Wordshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0030_substring_with_concatenation_of_all_words/Solution.cs
Minimum Window Substringhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0076_minimum_window_substring/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#top-interview-150-matrix
Valid Sudokuhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0036_valid_sudoku/Solution.cs
Spiral Matrixhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0054_spiral_matrix/Solution.cs
Rotate Imagehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0048_rotate_image/Solution.cs
Set Matrix Zeroeshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0073_set_matrix_zeroes/Solution.cs
Game of Lifehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0289_game_of_life/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#top-interview-150-hashmap
Ransom Notehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0301_0400/S0383_ransom_note/Solution.cs
Isomorphic Stringshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0205_isomorphic_strings/Solution.cs
Word Patternhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0290_word_pattern/Solution.cs
Valid Anagramhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0242_valid_anagram/Solution.cs
Group Anagramshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0049_group_anagrams/Solution.cs
Two Sumhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0001_two_sum/Solution.cs
Happy Numberhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0202_happy_number/Solution.cs
Contains Duplicate IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0219_contains_duplicate_ii/Solution.cs
Longest Consecutive Sequencehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0128_longest_consecutive_sequence/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#top-interview-150-intervals
Summary Rangeshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0228_summary_ranges/Solution.cs
Merge Intervalshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0056_merge_intervals/Solution.cs
Insert Intervalhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0057_insert_interval/Solution.cs
Minimum Number of Arrows to Burst Balloonshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0401_0500/S0452_minimum_number_of_arrows_to_burst_balloons/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#top-interview-150-stack
Valid Parentheseshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0020_valid_parentheses/Solution.cs
Simplify Pathhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0071_simplify_path/Solution.cs
Min Stackhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0155_min_stack/MinStack.cs
Evaluate Reverse Polish Notationhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0150_evaluate_reverse_polish_notation/Solution.cs
Basic Calculatorhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0224_basic_calculator/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#top-interview-150-linked-list
Linked List Cyclehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0141_linked_list_cycle/Solution.cs
Add Two Numbershttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0002_add_two_numbers/Solution.cs
Merge Two Sorted Listshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0021_merge_two_sorted_lists/Solution.cs
Copy List with Random Pointerhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0138_copy_list_with_random_pointer/Solution.cs
Reverse Linked List IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0092_reverse_linked_list_ii/Solution.cs
Reverse Nodes in k-Grouphttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0025_reverse_nodes_in_k_group/Solution.cs
Remove Nth Node From End of Listhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0019_remove_nth_node_from_end_of_list/Solution.cs
Remove Duplicates from Sorted List IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0082_remove_duplicates_from_sorted_list_ii/Solution.cs
Rotate Listhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0061_rotate_list/Solution.cs
Partition Listhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0086_partition_list/Solution.cs
LRU Cachehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0146_lru_cache/LRUCache.cs
https://github.com/pytdev/LeetCode-in-Net#top-interview-150-binary-tree-general
Maximum Depth of Binary Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0104_maximum_depth_of_binary_tree/Solution.cs
Same Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0100_same_tree/Solution.cs
Invert Binary Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0226_invert_binary_tree/Solution.cs
Symmetric Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0101_symmetric_tree/Solution.cs
Construct Binary Tree from Preorder and Inorder Traversalhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.cs
Construct Binary Tree from Inorder and Postorder Traversalhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0106_construct_binary_tree_from_inorder_and_postorder_traversal/Solution.cs
Populating Next Right Pointers in Each Node IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0117_populating_next_right_pointers_in_each_node_ii/Solution.cs
Flatten Binary Tree to Linked Listhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0114_flatten_binary_tree_to_linked_list/Solution.cs
Path Sumhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0112_path_sum/Solution.cs
Sum Root to Leaf Numbershttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0129_sum_root_to_leaf_numbers/Solution.cs
Binary Tree Maximum Path Sumhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0124_binary_tree_maximum_path_sum/Solution.cs
Binary Search Tree Iteratorhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0173_binary_search_tree_iterator/BSTIterator.cs
Count Complete Tree Nodeshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0222_count_complete_tree_nodes/Solution.cs
Lowest Common Ancestor of a Binary Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0236_lowest_common_ancestor_of_a_binary_tree/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#top-interview-150-binary-tree-bfs
Binary Tree Right Side Viewhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0199_binary_tree_right_side_view/Solution.cs
Average of Levels in Binary Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0601_0700/S0637_average_of_levels_in_binary_tree/Solution.cs
Binary Tree Level Order Traversalhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0102_binary_tree_level_order_traversal/Solution.cs
Binary Tree Zigzag Level Order Traversalhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0103_binary_tree_zigzag_level_order_traversal/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#top-interview-150-binary-search-tree
Minimum Absolute Difference in BSThttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0501_0600/S0530_minimum_absolute_difference_in_bst/Solution.cs
Kth Smallest Element in a BSThttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0230_kth_smallest_element_in_a_bst/Solution.cs
Validate Binary Search Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0098_validate_binary_search_tree/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#top-interview-150-graph-general
Number of Islandshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0200_number_of_islands/Solution.cs
Surrounded Regionshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0130_surrounded_regions/Solution.cs
Clone Graphhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0133_clone_graph/Solution.cs
Evaluate Divisionhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0301_0400/S0399_evaluate_division/Solution.cs
Course Schedulehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0207_course_schedule/Solution.cs
Course Schedule IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0210_course_schedule_ii/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#top-interview-150-graph-bfs
Snakes and Laddershttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0901_1000/S0909_snakes_and_ladders/Solution.cs
Minimum Genetic Mutationhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0401_0500/S0433_minimum_genetic_mutation/Solution.cs
Word Ladderhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0127_word_ladder/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#top-interview-150-trie
Implement Trie (Prefix Tree)https://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0208_implement_trie_prefix_tree/Trie.cs
Design Add and Search Words Data Structurehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0211_design_add_and_search_words_data_structure/WordDictionary.cs
Word Search IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0212_word_search_ii/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#top-interview-150-backtracking
Letter Combinations of a Phone Numberhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0017_letter_combinations_of_a_phone_number/Solution.cs
Combinationshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0077_combinations/Solution.cs
Permutationshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0046_permutations/Solution.cs
Combination Sumhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0039_combination_sum/Solution.cs
N-Queens IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0052_n_queens_ii/Solution.cs
Generate Parentheseshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0022_generate_parentheses/Solution.cs
Word Searchhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0079_word_search/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#top-interview-150-divide-and-conquer
Convert Sorted Array to Binary Search Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0108_convert_sorted_array_to_binary_search_tree/Solution.cs
Sort Listhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0148_sort_list/Solution.cs
Construct Quad Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0401_0500/S0427_construct_quad_tree/Solution.cs
Merge k Sorted Listshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0023_merge_k_sorted_lists/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#top-interview-150-kadanes-algorithm
Maximum Subarrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0053_maximum_subarray/Solution.cs
Maximum Sum Circular Subarrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0901_1000/S0918_maximum_sum_circular_subarray/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#top-interview-150-binary-search
Search Insert Positionhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0035_search_insert_position/Solution.cs
Search a 2D Matrixhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0074_search_a_2d_matrix/Solution.cs
Find Peak Elementhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0162_find_peak_element/Solution.cs
Search in Rotated Sorted Arrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0033_search_in_rotated_sorted_array/Solution.cs
Find First and Last Position of Element in Sorted Arrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0034_find_first_and_last_position_of_element_in_sorted_array/Solution.cs
Find Minimum in Rotated Sorted Arrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0153_find_minimum_in_rotated_sorted_array/Solution.cs
Median of Two Sorted Arrayshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0004_median_of_two_sorted_arrays/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#top-interview-150-heap
Kth Largest Element in an Arrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0215_kth_largest_element_in_an_array/Solution.cs
IPOhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0501_0600/S0502_ipo/Solution.cs
Find K Pairs with Smallest Sumshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0301_0400/S0373_find_k_pairs_with_smallest_sums/Solution.cs
Find Median from Data Streamhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0295_find_median_from_data_stream/MedianFinder.cs
https://github.com/pytdev/LeetCode-in-Net#top-interview-150-bit-manipulation
Add Binaryhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0067_add_binary/Solution.cs
Reverse Bitshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0190_reverse_bits/Solution.cs
Number of 1 Bitshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0191_number_of_1_bits/Solution.cs
Single Numberhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0136_single_number/Solution.cs
Single Number IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0137_single_number_ii/Solution.cs
Bitwise AND of Numbers Rangehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0201_bitwise_and_of_numbers_range/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#top-interview-150-math
Palindrome Numberhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0009_palindrome_number/Solution.cs
Plus Onehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0066_plus_one/Solution.cs
Factorial Trailing Zeroeshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0172_factorial_trailing_zeroes/Solution.cs
Sqrt(x)https://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0069_sqrtx/Solution.cs
Pow(x, n)https://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0050_powx_n/Solution.cs
Max Points on a Linehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0149_max_points_on_a_line/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#top-interview-150-1d-dp
Climbing Stairshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0070_climbing_stairs/Solution.cs
House Robberhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0198_house_robber/Solution.cs
Word Breakhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0139_word_break/Solution.cs
Coin Changehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0301_0400/S0322_coin_change/Solution.cs
Longest Increasing Subsequencehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0300_longest_increasing_subsequence/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#top-interview-150-multidimensional-dp
Trianglehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0120_triangle/Solution.cs
Minimum Path Sumhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0064_minimum_path_sum/Solution.cs
Unique Paths IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0063_unique_paths_ii/Solution.cs
Longest Palindromic Substringhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0005_longest_palindromic_substring/Solution.cs
Interleaving Stringhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0097_interleaving_string/Solution.cs
Edit Distancehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0072_edit_distance/Solution.cs
Best Time to Buy and Sell Stock IIIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0123_best_time_to_buy_and_sell_stock_iii/Solution.cs
Best Time to Buy and Sell Stock IVhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0188_best_time_to_buy_and_sell_stock_iv/Solution.cs
Maximal Squarehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0221_maximal_square/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#data-structure-i
https://github.com/pytdev/LeetCode-in-Net#day-1-array
Maximum Subarrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0053_maximum_subarray/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-2-array
Two Sumhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0001_two_sum/Solution.cs
Merge Sorted Arrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0088_merge_sorted_array/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-3-array
Best Time to Buy and Sell Stockhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0121_best_time_to_buy_and_sell_stock/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-4-array
https://github.com/pytdev/LeetCode-in-Net#day-5-array
Valid Sudokuhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0036_valid_sudoku/Solution.cs
Search a 2D Matrixhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0074_search_a_2d_matrix/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-6-string
Ransom Notehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0301_0400/S0383_ransom_note/Solution.cs
Valid Anagramhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0242_valid_anagram/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-7-linked-list
Linked List Cyclehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0141_linked_list_cycle/Solution.cs
Merge Two Sorted Listshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0021_merge_two_sorted_lists/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-8-linked-list
Reverse Linked Listhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0206_reverse_linked_list/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-9-stack-queue
Valid Parentheseshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0020_valid_parentheses/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-10-tree
Binary Tree Inorder Traversalhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0094_binary_tree_inorder_traversal/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-11-tree
Binary Tree Level Order Traversalhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0102_binary_tree_level_order_traversal/Solution.cs
Maximum Depth of Binary Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0104_maximum_depth_of_binary_tree/Solution.cs
Symmetric Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0101_symmetric_tree/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-12-tree
Invert Binary Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0226_invert_binary_tree/Solution.cs
Path Sumhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0112_path_sum/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-13-tree
https://github.com/pytdev/LeetCode-in-Net#day-14-tree
Validate Binary Search Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0098_validate_binary_search_tree/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#data-structure-ii
https://github.com/pytdev/LeetCode-in-Net#day-1-array-1
Single Numberhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0136_single_number/Solution.cs
Majority Elementhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0169_majority_element/Solution.cs
3Sumhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0015_3sum/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-2-array-1
Sort Colorshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0075_sort_colors/Solution.cs
Merge Intervalshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0056_merge_intervals/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-3-array-1
Rotate Imagehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0048_rotate_image/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-4-array-1
Search a 2D Matrix IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0240_search_a_2d_matrix_ii/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-5-array-1
Product of Array Except Selfhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0238_product_of_array_except_self/Solution.cs
Subarray Sum Equals Khttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0501_0600/S0560_subarray_sum_equals_k/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-6-string-1
https://github.com/pytdev/LeetCode-in-Net#day-7-string
Word Patternhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0290_word_pattern/Solution.cs
Partition Labelshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0701_0800/S0763_partition_labels/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-8-string
Group Anagramshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0049_group_anagrams/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-9-string
Longest Palindromic Substringhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0005_longest_palindromic_substring/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-10-linked-list
Add Two Numbershttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0002_add_two_numbers/Solution.cs
Linked List Cycle IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0142_linked_list_cycle_ii/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-11-linked-list
Intersection of Two Linked Listshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0160_intersection_of_two_linked_lists/Solution.cs
Remove Duplicates from Sorted List IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0082_remove_duplicates_from_sorted_list_ii/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-12-linked-list
Swap Nodes in Pairshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0024_swap_nodes_in_pairs/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-13-linked-list
Reverse Nodes in k-Grouphttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0025_reverse_nodes_in_k_group/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-14-stack-queue
Min Stackhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0155_min_stack/MinStack.cs
https://github.com/pytdev/LeetCode-in-Net#day-15-tree-1
Convert Sorted Array to Binary Search Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0108_convert_sorted_array_to_binary_search_tree/Solution.cs
Construct Binary Tree from Preorder and Inorder Traversalhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.cs
Binary Tree Zigzag Level Order Traversalhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0103_binary_tree_zigzag_level_order_traversal/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-16-tree
Binary Tree Right Side Viewhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0199_binary_tree_right_side_view/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-17-tree
Kth Smallest Element in a BSThttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0230_kth_smallest_element_in_a_bst/Solution.cs
Binary Search Tree Iteratorhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0173_binary_search_tree_iterator/BSTIterator.cs
https://github.com/pytdev/LeetCode-in-Net#day-18-tree
Lowest Common Ancestor of a Binary Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0236_lowest_common_ancestor_of_a_binary_tree/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-19-graph
https://github.com/pytdev/LeetCode-in-Net#day-20-heap-priority-queue
Kth Largest Element in an Arrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0215_kth_largest_element_in_an_array/Solution.cs
Top K Frequent Elementshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0301_0400/S0347_top_k_frequent_elements/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-21-heap-priority-queue
https://github.com/pytdev/LeetCode-in-Net#algorithm-i
https://github.com/pytdev/LeetCode-in-Net#day-1-binary-search
Search Insert Positionhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0035_search_insert_position/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-2-two-pointers
Rotate Arrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0189_rotate_array/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-3-two-pointers
Move Zeroeshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0283_move_zeroes/Solution.cs
Two Sum II - Input Array Is Sortedhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0167_two_sum_ii_input_array_is_sorted/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-4-two-pointers
https://github.com/pytdev/LeetCode-in-Net#day-5-two-pointers
Remove Nth Node From End of Listhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0019_remove_nth_node_from_end_of_list/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-6-sliding-window
Longest Substring Without Repeating Charactershttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0003_longest_substring_without_repeating_characters/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-7-breadth-first-search-depth-first-search
https://github.com/pytdev/LeetCode-in-Net#day-8-breadth-first-search-depth-first-search
https://github.com/pytdev/LeetCode-in-Net#day-9-breadth-first-search-depth-first-search
https://github.com/pytdev/LeetCode-in-Net#day-10-recursion-backtracking
Merge Two Sorted Listshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0021_merge_two_sorted_lists/Solution.cs
Reverse Linked Listhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0206_reverse_linked_list/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-11-recursion-backtracking
Combinationshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0077_combinations/Solution.cs
Permutationshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0046_permutations/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-12-dynamic-programming-1
Climbing Stairshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0070_climbing_stairs/Solution.cs
House Robberhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0198_house_robber/Solution.cs
Trianglehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0120_triangle/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-13-bit-manipulation
Number of 1 Bitshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0191_number_of_1_bits/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-14-bit-manipulation
Reverse Bitshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0190_reverse_bits/Solution.cs
Single Numberhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0136_single_number/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#algorithm-ii
https://github.com/pytdev/LeetCode-in-Net#day-1-binary-search-1
Find First and Last Position of Element in Sorted Arrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0034_find_first_and_last_position_of_element_in_sorted_array/Solution.cs
Search in Rotated Sorted Arrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0033_search_in_rotated_sorted_array/Solution.cs
Search a 2D Matrixhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0074_search_a_2d_matrix/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-2-binary-search
Find Minimum in Rotated Sorted Arrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0153_find_minimum_in_rotated_sorted_array/Solution.cs
Find Peak Elementhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0162_find_peak_element/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-3-two-pointers-1
Remove Duplicates from Sorted List IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0082_remove_duplicates_from_sorted_list_ii/Solution.cs
3Sumhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0015_3sum/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-4-two-pointers-1
Container With Most Waterhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0011_container_with_most_water/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-5-sliding-window
Find All Anagrams in a Stringhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0401_0500/S0438_find_all_anagrams_in_a_string/Solution.cs
Minimum Size Subarray Sumhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0209_minimum_size_subarray_sum/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-6-breadth-first-search-depth-first-search
Number of Islandshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0200_number_of_islands/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-7-breadth-first-search-depth-first-search-1
Populating Next Right Pointers in Each Node IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0117_populating_next_right_pointers_in_each_node_ii/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-8-breadth-first-search-depth-first-search-1
Surrounded Regionshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0130_surrounded_regions/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-9-recursion-backtracking
Subsetshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0078_subsets/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-10-recursion-backtracking-1
Combination Sumhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0039_combination_sum/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-11-recursion-backtracking-1
Letter Combinations of a Phone Numberhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0017_letter_combinations_of_a_phone_number/Solution.cs
Generate Parentheseshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0022_generate_parentheses/Solution.cs
Word Searchhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0079_word_search/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-12-dynamic-programming-2
Jump Gamehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0055_jump_game/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-13-dynamic-programming-1
Jump Game IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0045_jump_game_ii/Solution.cs
Unique Pathshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0062_unique_paths/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-14-dynamic-programming
Longest Palindromic Substringhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0005_longest_palindromic_substring/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-15-dynamic-programming
Word Breakhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0139_word_break/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-16-dynamic-programming
Longest Increasing Subsequencehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0300_longest_increasing_subsequence/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-17-dynamic-programming
Longest Common Subsequencehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G1101_1200/S1143_longest_common_subsequence/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-18-dynamic-programming
Edit Distancehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0072_edit_distance/Solution.cs
Coin Changehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0301_0400/S0322_coin_change/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-19-bit-manipulation
Bitwise AND of Numbers Rangehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0201_bitwise_and_of_numbers_range/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-20-others
https://github.com/pytdev/LeetCode-in-Net#day-21-others
Happy Numberhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0202_happy_number/Solution.cs
Max Points on a Linehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0149_max_points_on_a_line/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#binary-search-i
https://github.com/pytdev/LeetCode-in-Net#day-1
https://github.com/pytdev/LeetCode-in-Net#day-2
Search Insert Positionhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0035_search_insert_position/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-3
https://github.com/pytdev/LeetCode-in-Net#day-4
Sqrt(x)https://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0069_sqrtx/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-5
Find First and Last Position of Element in Sorted Arrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0034_find_first_and_last_position_of_element_in_sorted_array/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-6
https://github.com/pytdev/LeetCode-in-Net#day-7
Two Sum II - Input Array Is Sortedhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0167_two_sum_ii_input_array_is_sorted/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-8
Search a 2D Matrixhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0074_search_a_2d_matrix/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-9
https://github.com/pytdev/LeetCode-in-Net#day-10
https://github.com/pytdev/LeetCode-in-Net#day-11
Search in Rotated Sorted Arrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0033_search_in_rotated_sorted_array/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-12
Find Minimum in Rotated Sorted Arrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0153_find_minimum_in_rotated_sorted_array/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#binary-search-ii
https://github.com/pytdev/LeetCode-in-Net#day-1-1
Minimum Size Subarray Sumhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0209_minimum_size_subarray_sum/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-2-1
https://github.com/pytdev/LeetCode-in-Net#day-3-1
Longest Increasing Subsequencehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0300_longest_increasing_subsequence/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-4-1
https://github.com/pytdev/LeetCode-in-Net#day-5-1
Find the Duplicate Numberhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0287_find_the_duplicate_number/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-6-1
https://github.com/pytdev/LeetCode-in-Net#day-7-1
https://github.com/pytdev/LeetCode-in-Net#day-8-1
Search a 2D Matrix IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0240_search_a_2d_matrix_ii/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-9-1
https://github.com/pytdev/LeetCode-in-Net#day-10-1
Count Complete Tree Nodeshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0222_count_complete_tree_nodes/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-11-1
https://github.com/pytdev/LeetCode-in-Net#day-12-1
Find Peak Elementhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0162_find_peak_element/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-13
https://github.com/pytdev/LeetCode-in-Net#day-14
https://github.com/pytdev/LeetCode-in-Net#day-15
https://github.com/pytdev/LeetCode-in-Net#day-16
https://github.com/pytdev/LeetCode-in-Net#day-17
https://github.com/pytdev/LeetCode-in-Net#day-18
https://github.com/pytdev/LeetCode-in-Net#day-19
https://github.com/pytdev/LeetCode-in-Net#day-20
https://github.com/pytdev/LeetCode-in-Net#dynamic-programming-i
https://github.com/pytdev/LeetCode-in-Net#day-1-2
https://github.com/pytdev/LeetCode-in-Net#day-2-2
Climbing Stairshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0070_climbing_stairs/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-3-2
House Robberhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0198_house_robber/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-4-2
Jump Gamehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0055_jump_game/Solution.cs
Jump Game IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0045_jump_game_ii/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-5-2
Maximum Subarrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0053_maximum_subarray/Solution.cs
Maximum Sum Circular Subarrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0901_1000/S0918_maximum_sum_circular_subarray/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-6-2
Maximum Product Subarrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0152_maximum_product_subarray/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-7-2
Best Time to Buy and Sell Stockhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0121_best_time_to_buy_and_sell_stock/Solution.cs
Best Time to Buy and Sell Stock IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0122_best_time_to_buy_and_sell_stock_ii/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-8-2
https://github.com/pytdev/LeetCode-in-Net#day-9-2
Word Breakhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0139_word_break/Solution.cs
Trapping Rain Waterhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0042_trapping_rain_water/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-10-2
https://github.com/pytdev/LeetCode-in-Net#day-11-2
Unique Binary Search Treeshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0096_unique_binary_search_trees/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-12-2
https://github.com/pytdev/LeetCode-in-Net#day-13-1
Trianglehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0120_triangle/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-14-1
https://github.com/pytdev/LeetCode-in-Net#day-15-1
Unique Pathshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0062_unique_paths/Solution.cs
Unique Paths IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0063_unique_paths_ii/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-16-1
Minimum Path Sumhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0064_minimum_path_sum/Solution.cs
Maximal Squarehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0221_maximal_square/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-17-1
Longest Palindromic Substringhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0005_longest_palindromic_substring/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-18-1
Longest Increasing Subsequencehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0300_longest_increasing_subsequence/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-19-1
Is Subsequencehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0301_0400/S0392_is_subsequence/Solution.cs
Longest Common Subsequencehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G1101_1200/S1143_longest_common_subsequence/Solution.cs
Edit Distancehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0072_edit_distance/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-20-1
Coin Changehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0301_0400/S0322_coin_change/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-21
https://github.com/pytdev/LeetCode-in-Net#programming-skills-i
https://github.com/pytdev/LeetCode-in-Net#day-1-basic-data-type
https://github.com/pytdev/LeetCode-in-Net#day-2-operator
Number of 1 Bitshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0191_number_of_1_bits/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-3-conditional-statements
https://github.com/pytdev/LeetCode-in-Net#day-4-loop
Happy Numberhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0202_happy_number/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-5-function
https://github.com/pytdev/LeetCode-in-Net#day-6-array
Move Zeroeshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0283_move_zeroes/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-7-array
https://github.com/pytdev/LeetCode-in-Net#day-8-string-1
https://github.com/pytdev/LeetCode-in-Net#day-9-string-1
https://github.com/pytdev/LeetCode-in-Net#day-10-linked-list-and-tree
Maximum Depth of Binary Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0104_maximum_depth_of_binary_tree/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-11-containers-and-libraries
Valid Anagramhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0242_valid_anagram/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-12-class-and-object
https://github.com/pytdev/LeetCode-in-Net#programming-skills-ii
https://github.com/pytdev/LeetCode-in-Net#day-1-3
Find the Index of the First Occurrence in a Stringhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0028_find_the_index_of_the_first_occurrence_in_a_string/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-2-3
https://github.com/pytdev/LeetCode-in-Net#day-3-3
Evaluate Reverse Polish Notationhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0150_evaluate_reverse_polish_notation/Solution.cs
Plus Onehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0066_plus_one/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-4-3
https://github.com/pytdev/LeetCode-in-Net#day-5-3
Add Binaryhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0067_add_binary/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-6-3
Daily Temperatureshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0701_0800/S0739_daily_temperatures/Solution.cs
Length of Last Wordhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0058_length_of_last_word/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-7-3
Rotate Imagehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0048_rotate_image/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-8-3
Spiral Matrixhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0054_spiral_matrix/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-9-3
https://github.com/pytdev/LeetCode-in-Net#day-10-3
https://github.com/pytdev/LeetCode-in-Net#day-11-3
Group Anagramshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0049_group_anagrams/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-12-3
Find All Anagrams in a Stringhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0401_0500/S0438_find_all_anagrams_in_a_string/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-13-2
https://github.com/pytdev/LeetCode-in-Net#day-14-2
Copy List with Random Pointerhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0138_copy_list_with_random_pointer/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-15-2
Add Two Numbershttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0002_add_two_numbers/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-16-2
Rotate Listhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0061_rotate_list/Solution.cs
Binary Search Tree Iteratorhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0173_binary_search_tree_iterator/BSTIterator.cs
https://github.com/pytdev/LeetCode-in-Net#day-17-2
https://github.com/pytdev/LeetCode-in-Net#day-18-2
Min Stackhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0155_min_stack/MinStack.cs
https://github.com/pytdev/LeetCode-in-Net#day-19-2
https://github.com/pytdev/LeetCode-in-Net#day-20-2
Insert Delete GetRandom O(1)https://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0301_0400/S0380_insert_delete_getrandom_o1/RandomizedSet.cs
https://github.com/pytdev/LeetCode-in-Net#graph-theory-i
https://github.com/pytdev/LeetCode-in-Net#day-1-matrix-related-problems
Number of Islandshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0200_number_of_islands/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-2-matrix-related-problems
https://github.com/pytdev/LeetCode-in-Net#day-3-matrix-related-problems
https://github.com/pytdev/LeetCode-in-Net#day-4-matrix-related-problems
https://github.com/pytdev/LeetCode-in-Net#day-5-matrix-related-problems
https://github.com/pytdev/LeetCode-in-Net#day-6-matrix-related-problems
https://github.com/pytdev/LeetCode-in-Net#day-7-standard-traversal
https://github.com/pytdev/LeetCode-in-Net#day-8-standard-traversal
https://github.com/pytdev/LeetCode-in-Net#day-9-standard-traversal
https://github.com/pytdev/LeetCode-in-Net#day-10-standard-traversal
https://github.com/pytdev/LeetCode-in-Net#day-11-breadth-first-search
https://github.com/pytdev/LeetCode-in-Net#day-12-breadth-first-search
Minimum Genetic Mutationhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0401_0500/S0433_minimum_genetic_mutation/Solution.cs
Word Ladderhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0127_word_ladder/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#day-13-graph-theory
https://github.com/pytdev/LeetCode-in-Net#day-14-graph-theory
https://github.com/pytdev/LeetCode-in-Net#sql-i
https://github.com/pytdev/LeetCode-in-Net#day-1-select
https://github.com/pytdev/LeetCode-in-Net#day-2-select-and-order
https://github.com/pytdev/LeetCode-in-Net#day-3-string-processing-functions
https://github.com/pytdev/LeetCode-in-Net#day-4-union-and-select
https://github.com/pytdev/LeetCode-in-Net#day-5-union
https://github.com/pytdev/LeetCode-in-Net#day-6-union
https://github.com/pytdev/LeetCode-in-Net#day-7-function
https://github.com/pytdev/LeetCode-in-Net#day-8-function
https://github.com/pytdev/LeetCode-in-Net#day-9-control-of-flow
https://github.com/pytdev/LeetCode-in-Net#day-10-where
https://github.com/pytdev/LeetCode-in-Net#algorithms
Longest Common Subsequencehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G1101_1200/S1143_longest_common_subsequence/Solution.cs
Maximum Sum Circular Subarrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0901_1000/S0918_maximum_sum_circular_subarray/Solution.cs
Snakes and Laddershttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0901_1000/S0909_snakes_and_ladders/Solution.cs
Partition Labelshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0701_0800/S0763_partition_labels/Solution.cs
Daily Temperatureshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0701_0800/S0739_daily_temperatures/Solution.cs
Palindromic Substringshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0601_0700/S0647_palindromic_substrings/Solution.cs
Average of Levels in Binary Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0601_0700/S0637_average_of_levels_in_binary_tree/Solution.cs
Subarray Sum Equals Khttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0501_0600/S0560_subarray_sum_equals_k/Solution.cs
Diameter of Binary Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0501_0600/S0543_diameter_of_binary_tree/Solution.cs
Minimum Absolute Difference in BSThttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0501_0600/S0530_minimum_absolute_difference_in_bst/Solution.cs
IPOhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0501_0600/S0502_ipo/Solution.cs
Target Sumhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0401_0500/S0494_target_sum/Solution.cs
Minimum Number of Arrows to Burst Balloonshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0401_0500/S0452_minimum_number_of_arrows_to_burst_balloons/Solution.cs
Find All Anagrams in a Stringhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0401_0500/S0438_find_all_anagrams_in_a_string/Solution.cs
Path Sum IIIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0401_0500/S0437_path_sum_iii/Solution.cs
Minimum Genetic Mutationhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0401_0500/S0433_minimum_genetic_mutation/Solution.cs
Construct Quad Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0401_0500/S0427_construct_quad_tree/Solution.cs
Partition Equal Subset Sumhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0401_0500/S0416_partition_equal_subset_sum/Solution.cs
Evaluate Divisionhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0301_0400/S0399_evaluate_division/Solution.cs
Decode Stringhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0301_0400/S0394_decode_string/Solution.cs
Is Subsequencehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0301_0400/S0392_is_subsequence/Solution.cs
Ransom Notehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0301_0400/S0383_ransom_note/Solution.cs
Insert Delete GetRandom O(1)https://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0301_0400/S0380_insert_delete_getrandom_o1/RandomizedSet.cs
Find K Pairs with Smallest Sumshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0301_0400/S0373_find_k_pairs_with_smallest_sums/Solution.cs
Top K Frequent Elementshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0301_0400/S0347_top_k_frequent_elements/Solution.cs
Counting Bitshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0301_0400/S0338_counting_bits/Solution.cs
Coin Changehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0301_0400/S0322_coin_change/Solution.cs
Longest Increasing Subsequencehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0300_longest_increasing_subsequence/Solution.cs
Find Median from Data Streamhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0295_find_median_from_data_stream/MedianFinder.cs
Word Patternhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0290_word_pattern/Solution.cs
Game of Lifehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0289_game_of_life/Solution.cs
Find the Duplicate Numberhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0287_find_the_duplicate_number/Solution.cs
Move Zeroeshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0283_move_zeroes/Solution.cs
H-Indexhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0274_h_index/Solution.cs
Valid Anagramhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0242_valid_anagram/Solution.cs
Search a 2D Matrix IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0240_search_a_2d_matrix_ii/Solution.cs
Sliding Window Maximumhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0239_sliding_window_maximum/Solution.cs
Product of Array Except Selfhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0238_product_of_array_except_self/Solution.cs
Lowest Common Ancestor of a Binary Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0236_lowest_common_ancestor_of_a_binary_tree/Solution.cs
Palindrome Linked Listhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0234_palindrome_linked_list/Solution.cs
Kth Smallest Element in a BSThttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0230_kth_smallest_element_in_a_bst/Solution.cs
Summary Rangeshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0228_summary_ranges/Solution.cs
Invert Binary Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0226_invert_binary_tree/Solution.cs
Basic Calculatorhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0224_basic_calculator/Solution.cs
Count Complete Tree Nodeshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0222_count_complete_tree_nodes/Solution.cs
Maximal Squarehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0221_maximal_square/Solution.cs
Contains Duplicate IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0219_contains_duplicate_ii/Solution.cs
Kth Largest Element in an Arrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0215_kth_largest_element_in_an_array/Solution.cs
Word Search IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0212_word_search_ii/Solution.cs
Design Add and Search Words Data Structurehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0211_design_add_and_search_words_data_structure/WordDictionary.cs
Course Schedule IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0210_course_schedule_ii/Solution.cs
Minimum Size Subarray Sumhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0209_minimum_size_subarray_sum/Solution.cs
Implement Trie (Prefix Tree)https://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0208_implement_trie_prefix_tree/Trie.cs
Course Schedulehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0207_course_schedule/Solution.cs
Reverse Linked Listhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0206_reverse_linked_list/Solution.cs
Isomorphic Stringshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0205_isomorphic_strings/Solution.cs
Happy Numberhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0202_happy_number/Solution.cs
Bitwise AND of Numbers Rangehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0201_0300/S0201_bitwise_and_of_numbers_range/Solution.cs
Number of Islandshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0200_number_of_islands/Solution.cs
Binary Tree Right Side Viewhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0199_binary_tree_right_side_view/Solution.cs
House Robberhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0198_house_robber/Solution.cs
Number of 1 Bitshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0191_number_of_1_bits/Solution.cs
Reverse Bitshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0190_reverse_bits/Solution.cs
Rotate Arrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0189_rotate_array/Solution.cs
Best Time to Buy and Sell Stock IVhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0188_best_time_to_buy_and_sell_stock_iv/Solution.cs
Binary Search Tree Iteratorhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0173_binary_search_tree_iterator/BSTIterator.cs
Factorial Trailing Zeroeshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0172_factorial_trailing_zeroes/Solution.cs
Majority Elementhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0169_majority_element/Solution.cs
Two Sum II - Input Array Is Sortedhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0167_two_sum_ii_input_array_is_sorted/Solution.cs
Find Peak Elementhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0162_find_peak_element/Solution.cs
Intersection of Two Linked Listshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0160_intersection_of_two_linked_lists/Solution.cs
Min Stackhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0155_min_stack/MinStack.cs
Find Minimum in Rotated Sorted Arrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0153_find_minimum_in_rotated_sorted_array/Solution.cs
Maximum Product Subarrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0152_maximum_product_subarray/Solution.cs
Reverse Words in a Stringhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0151_reverse_words_in_a_string/Solution.cs
Evaluate Reverse Polish Notationhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0150_evaluate_reverse_polish_notation/Solution.cs
Max Points on a Linehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0149_max_points_on_a_line/Solution.cs
Sort Listhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0148_sort_list/Solution.cs
LRU Cachehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0146_lru_cache/LRUCache.cs
Linked List Cycle IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0142_linked_list_cycle_ii/Solution.cs
Linked List Cyclehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0141_linked_list_cycle/Solution.cs
Word Breakhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0139_word_break/Solution.cs
Copy List with Random Pointerhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0138_copy_list_with_random_pointer/Solution.cs
Single Number IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0137_single_number_ii/Solution.cs
Single Numberhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0136_single_number/Solution.cs
Candyhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0135_candy/Solution.cs
Gas Stationhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0134_gas_station/Solution.cs
Clone Graphhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0133_clone_graph/Solution.cs
Palindrome Partitioninghttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0131_palindrome_partitioning/Solution.cs
Surrounded Regionshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0130_surrounded_regions/Solution.cs
Sum Root to Leaf Numbershttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0129_sum_root_to_leaf_numbers/Solution.cs
Longest Consecutive Sequencehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0128_longest_consecutive_sequence/Solution.cs
Word Ladderhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0127_word_ladder/Solution.cs
Valid Palindromehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0125_valid_palindrome/Solution.cs
Binary Tree Maximum Path Sumhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0124_binary_tree_maximum_path_sum/Solution.cs
Best Time to Buy and Sell Stock IIIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0123_best_time_to_buy_and_sell_stock_iii/Solution.cs
Best Time to Buy and Sell Stock IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0122_best_time_to_buy_and_sell_stock_ii/Solution.cs
Best Time to Buy and Sell Stockhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0121_best_time_to_buy_and_sell_stock/Solution.cs
Trianglehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0120_triangle/Solution.cs
Populating Next Right Pointers in Each Node IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0117_populating_next_right_pointers_in_each_node_ii/Solution.cs
Flatten Binary Tree to Linked Listhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0114_flatten_binary_tree_to_linked_list/Solution.cs
Path Sumhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0112_path_sum/Solution.cs
Convert Sorted Array to Binary Search Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0108_convert_sorted_array_to_binary_search_tree/Solution.cs
Construct Binary Tree from Inorder and Postorder Traversalhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0106_construct_binary_tree_from_inorder_and_postorder_traversal/Solution.cs
Construct Binary Tree from Preorder and Inorder Traversalhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.cs
Maximum Depth of Binary Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0104_maximum_depth_of_binary_tree/Solution.cs
Binary Tree Zigzag Level Order Traversalhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0103_binary_tree_zigzag_level_order_traversal/Solution.cs
Binary Tree Level Order Traversalhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0102_binary_tree_level_order_traversal/Solution.cs
Symmetric Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0101_0200/S0101_symmetric_tree/Solution.cs
Same Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0100_same_tree/Solution.cs
Validate Binary Search Treehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0098_validate_binary_search_tree/Solution.cs
Interleaving Stringhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0097_interleaving_string/Solution.cs
Unique Binary Search Treeshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0096_unique_binary_search_trees/Solution.cs
Binary Tree Inorder Traversalhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0094_binary_tree_inorder_traversal/Solution.cs
Reverse Linked List IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0092_reverse_linked_list_ii/Solution.cs
Merge Sorted Arrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0088_merge_sorted_array/Solution.cs
Partition Listhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0086_partition_list/Solution.cs
Largest Rectangle in Histogramhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0084_largest_rectangle_in_histogram/Solution.cs
Remove Duplicates from Sorted List IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0082_remove_duplicates_from_sorted_list_ii/Solution.cs
Remove Duplicates from Sorted Array IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0080_remove_duplicates_from_sorted_array_ii/Solution.cs
Word Searchhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0079_word_search/Solution.cs
Subsetshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0078_subsets/Solution.cs
Combinationshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0077_combinations/Solution.cs
Minimum Window Substringhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0076_minimum_window_substring/Solution.cs
Sort Colorshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0075_sort_colors/Solution.cs
Search a 2D Matrixhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0074_search_a_2d_matrix/Solution.cs
Set Matrix Zeroeshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0073_set_matrix_zeroes/Solution.cs
Edit Distancehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0072_edit_distance/Solution.cs
Simplify Pathhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0071_simplify_path/Solution.cs
Climbing Stairshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0070_climbing_stairs/Solution.cs
Sqrt(x)https://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0069_sqrtx/Solution.cs
Text Justificationhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0068_text_justification/Solution.cs
Add Binaryhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0067_add_binary/Solution.cs
Plus Onehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0066_plus_one/Solution.cs
Minimum Path Sumhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0064_minimum_path_sum/Solution.cs
Unique Paths IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0063_unique_paths_ii/Solution.cs
Unique Pathshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0062_unique_paths/Solution.cs
Rotate Listhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0061_rotate_list/Solution.cs
Length of Last Wordhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0058_length_of_last_word/Solution.cs
Insert Intervalhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0057_insert_interval/Solution.cs
Merge Intervalshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0056_merge_intervals/Solution.cs
Jump Gamehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0055_jump_game/Solution.cs
Spiral Matrixhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0054_spiral_matrix/Solution.cs
Maximum Subarrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0053_maximum_subarray/Solution.cs
N-Queens IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0052_n_queens_ii/Solution.cs
N-Queenshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0051_n_queens/Solution.cs
Pow(x, n)https://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0050_powx_n/Solution.cs
Group Anagramshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0049_group_anagrams/Solution.cs
Rotate Imagehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0048_rotate_image/Solution.cs
Permutationshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0046_permutations/Solution.cs
Jump Game IIhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0045_jump_game_ii/Solution.cs
Trapping Rain Waterhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0042_trapping_rain_water/Solution.cs
First Missing Positivehttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0041_first_missing_positive/Solution.cs
Combination Sumhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0039_combination_sum/Solution.cs
Valid Sudokuhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0036_valid_sudoku/Solution.cs
Search Insert Positionhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0035_search_insert_position/Solution.cs
Find First and Last Position of Element in Sorted Arrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0034_find_first_and_last_position_of_element_in_sorted_array/Solution.cs
Search in Rotated Sorted Arrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0033_search_in_rotated_sorted_array/Solution.cs
Longest Valid Parentheseshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0032_longest_valid_parentheses/Solution.cs
Next Permutationhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0031_next_permutation/Solution.cs
Substring with Concatenation of All Wordshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0030_substring_with_concatenation_of_all_words/Solution.cs
Find the Index of the First Occurrence in a Stringhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0028_find_the_index_of_the_first_occurrence_in_a_string/Solution.cs
Remove Elementhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0027_remove_element/Solution.cs
Remove Duplicates from Sorted Arrayhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0026_remove_duplicates_from_sorted_array/Solution.cs
Reverse Nodes in k-Grouphttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0025_reverse_nodes_in_k_group/Solution.cs
Swap Nodes in Pairshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0024_swap_nodes_in_pairs/Solution.cs
Merge k Sorted Listshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0023_merge_k_sorted_lists/Solution.cs
Generate Parentheseshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0022_generate_parentheses/Solution.cs
Merge Two Sorted Listshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0021_merge_two_sorted_lists/Solution.cs
Valid Parentheseshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0020_valid_parentheses/Solution.cs
Remove Nth Node From End of Listhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0019_remove_nth_node_from_end_of_list/Solution.cs
Letter Combinations of a Phone Numberhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0017_letter_combinations_of_a_phone_number/Solution.cs
3Sumhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0015_3sum/Solution.cs
Longest Common Prefixhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0014_longest_common_prefix/Solution.cs
Roman to Integerhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0013_roman_to_integer/Solution.cs
Integer to Romanhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0012_integer_to_roman/Solution.cs
Container With Most Waterhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0011_container_with_most_water/Solution.cs
Regular Expression Matchinghttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0010_regular_expression_matching/Solution.cs
Palindrome Numberhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0009_palindrome_number/Solution.cs
String to Integer (atoi)https://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0008_string_to_integer_atoi/Solution.cs
Reverse Integerhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0007_reverse_integer/Solution.cs
Zigzag Conversionhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0006_zigzag_conversion/Solution.cs
Longest Palindromic Substringhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0005_longest_palindromic_substring/Solution.cs
Median of Two Sorted Arrayshttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0004_median_of_two_sorted_arrays/Solution.cs
Longest Substring Without Repeating Charactershttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0003_longest_substring_without_repeating_characters/Solution.cs
Add Two Numbershttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0002_add_two_numbers/Solution.cs
Two Sumhttps://github.com/pytdev/LeetCode-in-Net/blob/main/LeetCodeNet/G0001_0100/S0001_two_sum/Solution.cs
https://github.com/pytdev/LeetCode-in-Net#contributing
leetcode-in-net.github.iohttps://leetcode-in-net.github.io
Readme https://github.com/pytdev/LeetCode-in-Net#readme-ov-file
MIT license https://github.com/pytdev/LeetCode-in-Net#MIT-1-ov-file
Please reload this pagehttps://github.com/pytdev/LeetCode-in-Net
Activityhttps://github.com/pytdev/LeetCode-in-Net/activity
Custom propertieshttps://github.com/pytdev/LeetCode-in-Net/custom-properties
0 forkshttps://github.com/pytdev/LeetCode-in-Net/forks
Report repository https://github.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2Fpytdev%2FLeetCode-in-Net&report=pytdev+%28user%29
Releaseshttps://github.com/pytdev/LeetCode-in-Net/releases
Packages 0https://github.com/orgs/pytdev/packages?repo_name=LeetCode-in-Net
Please reload this pagehttps://github.com/pytdev/LeetCode-in-Net
Contributorshttps://github.com/pytdev/LeetCode-in-Net/graphs/contributors
Please reload this pagehttps://github.com/pytdev/LeetCode-in-Net
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.