René's URL Explorer Experiment


Title: GitHub - bsnyl5/LeetCode-in-Java: Java-based LeetCode algorithm problem solutions, regularly updated.

Open Graph Title: GitHub - bsnyl5/LeetCode-in-Java: Java-based LeetCode algorithm problem solutions, regularly updated.

X Title: GitHub - bsnyl5/LeetCode-in-Java: Java-based LeetCode algorithm problem solutions, regularly updated.

Description: Java-based LeetCode algorithm problem solutions, regularly updated. - bsnyl5/LeetCode-in-Java

Open Graph Description: Java-based LeetCode algorithm problem solutions, regularly updated. - bsnyl5/LeetCode-in-Java

X Description: Java-based LeetCode algorithm problem solutions, regularly updated. - bsnyl5/LeetCode-in-Java

Opengraph URL: https://github.com/bsnyl5/LeetCode-in-Java

X: @github

direct link

Domain: patch-diff.githubusercontent.com

route-pattern/:user_id/:repository
route-controllerfiles
route-actiondisambiguate
fetch-noncev2:2fe253af-2c24-39b5-0a72-4d9e5fc5c474
current-catalog-service-hashf3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb
request-idA618:1A6433:6D5D0D2:8FD4A34:6975209D
html-safe-nonce810ef85234d1fd679ce974a8f3b7762075d3c468854ab063a884149b83b46d72
visitor-payloadeyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJBNjE4OjFBNjQzMzo2RDVEMEQyOjhGRDRBMzQ6Njk3NTIwOUQiLCJ2aXNpdG9yX2lkIjoiMjA1NTIwODExMTM2NTc1OTEzMyIsInJlZ2lvbl9lZGdlIjoiaWFkIiwicmVnaW9uX3JlbmRlciI6ImlhZCJ9
visitor-hmacc3ef4247c1fd3a1e464bd5af5697f91959453732d0036be86b8c521dc68112b4
hovercard-subject-tagrepository:886052361
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/bsnyl5/LeetCode-in-Java
twitter:imagehttps://opengraph.githubassets.com/0c1dea95debc5364a90b48e76fa7f776765e612402e19a456192f75acde3f047/bsnyl5/LeetCode-in-Java
twitter:cardsummary_large_image
og:imagehttps://opengraph.githubassets.com/0c1dea95debc5364a90b48e76fa7f776765e612402e19a456192f75acde3f047/bsnyl5/LeetCode-in-Java
og:image:altJava-based LeetCode algorithm problem solutions, regularly updated. - bsnyl5/LeetCode-in-Java
og:image:width1200
og:image:height600
og:site_nameGitHub
og:typeobject
hostnamegithub.com
expected-hostnamegithub.com
None4a4bf5f4e28041a9d2e5c107d7d20b78b4294ba261cab243b28167c16a623a1f
turbo-cache-controlno-preview
go-importgithub.com/bsnyl5/LeetCode-in-Java git https://github.com/bsnyl5/LeetCode-in-Java.git
octolytics-dimension-user_id185165947
octolytics-dimension-user_loginbsnyl5
octolytics-dimension-repository_id886052361
octolytics-dimension-repository_nwobsnyl5/LeetCode-in-Java
octolytics-dimension-repository_publictrue
octolytics-dimension-repository_is_forktrue
octolytics-dimension-repository_parent_id426947282
octolytics-dimension-repository_parent_nwojavadev/LeetCode-in-Java
octolytics-dimension-repository_network_root_id426947282
octolytics-dimension-repository_network_root_nwojavadev/LeetCode-in-Java
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
release488b30e96dfd057fbbe44c6665ccbc030b729dde
ui-targetfull
theme-color#1e2327
color-schemelight dark

Links:

Skip to contenthttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#start-of-content
https://patch-diff.githubusercontent.com/
Sign in https://patch-diff.githubusercontent.com/login?return_to=https%3A%2F%2Fgithub.com%2Fbsnyl5%2FLeetCode-in-Java
GitHub CopilotWrite better code with AIhttps://github.com/features/copilot
GitHub SparkBuild and deploy intelligent appshttps://github.com/features/spark
GitHub ModelsManage and compare promptshttps://github.com/features/models
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
GitHub SponsorsFund open source developershttps://github.com/sponsors
Security Labhttps://securitylab.github.com
Maintainer Communityhttps://maintainers.github.com
Acceleratorhttps://github.com/accelerator
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://patch-diff.githubusercontent.com/login?return_to=https%3A%2F%2Fgithub.com%2Fbsnyl5%2FLeetCode-in-Java
Sign up https://patch-diff.githubusercontent.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=bsnyl5%2FLeetCode-in-Java
Reloadhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java
Reloadhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java
Reloadhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java
bsnyl5 https://patch-diff.githubusercontent.com/bsnyl5
LeetCode-in-Javahttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java
javadev/LeetCode-in-Javahttps://patch-diff.githubusercontent.com/javadev/LeetCode-in-Java
Notifications https://patch-diff.githubusercontent.com/login?return_to=%2Fbsnyl5%2FLeetCode-in-Java
Fork 0 https://patch-diff.githubusercontent.com/login?return_to=%2Fbsnyl5%2FLeetCode-in-Java
Star 0 https://patch-diff.githubusercontent.com/login?return_to=%2Fbsnyl5%2FLeetCode-in-Java
leetcode-in-java.github.iohttps://leetcode-in-java.github.io
MIT license https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/LICENSE
0 stars https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/stargazers
102 forks https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/forks
Branches https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/branches
Tags https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/tags
Activity https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/activity
Star https://patch-diff.githubusercontent.com/login?return_to=%2Fbsnyl5%2FLeetCode-in-Java
Notifications https://patch-diff.githubusercontent.com/login?return_to=%2Fbsnyl5%2FLeetCode-in-Java
Code https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java
Pull requests 0 https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/pulls
Actions https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/actions
Projects 0 https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/projects
Security 0 https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/security
Insights https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/pulse
Code https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java
Pull requests https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/pulls
Actions https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/actions
Projects https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/projects
Security https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/security
Insights https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/pulse
Brancheshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/branches
Tagshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/tags
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/branches
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/tags
2,506 Commitshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/commits/main/
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/commits/main/
.circlecihttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/tree/main/.circleci
.circlecihttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/tree/main/.circleci
.githubhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/tree/main/.github
.githubhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/tree/main/.github
gradle/wrapperhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/tree/main/gradle/wrapper
gradle/wrapperhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/tree/main/gradle/wrapper
srchttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/tree/main/src
srchttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/tree/main/src
.gitignorehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/.gitignore
.gitignorehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/.gitignore
LICENSEhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/LICENSE
LICENSEhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/LICENSE
README.mdhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/README.md
README.mdhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/README.md
SECURITY.mdhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/SECURITY.md
SECURITY.mdhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/SECURITY.md
build.gradlehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/build.gradle
build.gradlehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/build.gradle
checkstyle.xmlhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/checkstyle.xml
checkstyle.xmlhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/checkstyle.xml
codecov.ymlhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/codecov.yml
codecov.ymlhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/codecov.yml
gradle.propertieshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/gradle.properties
gradle.propertieshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/gradle.properties
gradlewhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/gradlew
gradlewhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/gradlew
gradlew.bathttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/gradlew.bat
gradlew.bathttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/gradlew.bat
pom-central.xmlhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/pom-central.xml
pom-central.xmlhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/pom-central.xml
pom-central21.xmlhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/pom-central21.xml
pom-central21.xmlhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/pom-central21.xml
pom.xmlhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/pom.xml
pom.xmlhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/pom.xml
settings.gradlehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/settings.gradle
settings.gradlehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/settings.gradle
READMEhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java
Licensehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java
Securityhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#leetcode-in-java
https://central.sonatype.com/artifact/com.github.javadev/leetcode-in-java/1.39
https://github.com/javadev/leetcode-in-java/blob/main/LICENSE
https://github.com/javadev/LeetCode-in-Java/actions/workflows/maven.yml
https://sonarcloud.io/summary/overall?id=javadev_LeetCode-in-Java
https://javadoc.io/doc/com.github.javadev/leetcode-in-java
https://github.com/javadev/LeetCode-in-Java
https://github.com/javadev/LeetCode-in-Java/fork
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#installation
"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
Algorithm Ihttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#algorithm-i
Algorithm IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#algorithm-ii
Binary Search Ihttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#binary-search-i
Binary Search IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#binary-search-ii
Dynamic Programming Ihttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#dynamic-programming-i
Programming Skills Ihttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#programming-skills-i
Programming Skills IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#programming-skills-ii
Graph Theory Ihttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#graph-theory-i
SQL Ihttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#sql-i
Level 1https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#level-1
Level 2https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#level-2
Udemyhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#udemy
Data Structure Ihttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#data-structure-i
Data Structure IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#data-structure-ii
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#algorithm-i
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-1-binary-search
Binary Searchhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0704_binary_search/Solution.java
First Bad Versionhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0278_first_bad_version/Solution.java
Search Insert Positionhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0035_search_insert_position/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-2-two-pointers
Squares of a Sorted Arrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0977_squares_of_a_sorted_array/Solution.java
Rotate Arrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0189_rotate_array/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-3-two-pointers
Move Zeroeshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0283_move_zeroes/Solution.java
Two Sum II - Input Array Is Sortedhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0167_two_sum_ii_input_array_is_sorted/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-4-two-pointers
Reverse Stringhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0344_reverse_string/Solution.java
Reverse Words in a String IIIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0557_reverse_words_in_a_string_iii/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-5-two-pointers
Middle of the Linked Listhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0876_middle_of_the_linked_list/Solution.java
Remove Nth Node From End of Listhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-6-sliding-window
Longest Substring Without Repeating Charactershttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.java
Permutation in Stringhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0567_permutation_in_string/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-7-breadth-first-search-depth-first-search
Flood Fillhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0733_flood_fill/Solution.java
Max Area of Islandhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0695_max_area_of_island/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-8-breadth-first-search-depth-first-search
Merge Two Binary Treeshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0617_merge_two_binary_trees/Solution.java
Populating Next Right Pointers in Each Nodehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0116_populating_next_right_pointers_in_each_node/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-9-breadth-first-search-depth-first-search
01 Matrixhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0542_01_matrix/Solution.java
Rotting Orangeshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0994_rotting_oranges/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-10-recursion-backtracking
Merge Two Sorted Listshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0021_merge_two_sorted_lists/Solution.java
Reverse Linked Listhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0206_reverse_linked_list/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-11-recursion-backtracking
Combinationshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0077_combinations/Solution.java
Permutationshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0046_permutations/Solution.java
Letter Case Permutationhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0784_letter_case_permutation/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-12-dynamic-programming
Climbing Stairshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0070_climbing_stairs/Solution.java
House Robberhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0198_house_robber/Solution.java
Trianglehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0120_triangle/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-13-bit-manipulation
Power of Twohttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0231_power_of_two/Solution.java
Number of 1 Bitshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0191_number_of_1_bits/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-14-bit-manipulation
Reverse Bitshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0190_reverse_bits/Solution.java
Single Numberhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0136_single_number/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#algorithm-ii
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-1-binary-search-1
Find First and Last Position of Element in Sorted Arrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.java
Search in Rotated Sorted Arrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.java
Search a 2D Matrixhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0074_search_a_2d_matrix/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-2-binary-search
Find Minimum in Rotated Sorted Arrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.java
Find Peak Elementhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0162_find_peak_element/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-3-two-pointers-1
Remove Duplicates from Sorted List IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0082_remove_duplicates_from_sorted_list_ii/Solution.java
3Sumhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0015_3sum/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-4-two-pointers-1
Backspace String Comparehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0844_backspace_string_compare/Solution.java
Interval List Intersectionshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0986_interval_list_intersections/Solution.java
Container With Most Waterhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0011_container_with_most_water/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-5-sliding-window
Find All Anagrams in a Stringhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.java
Subarray Product Less Than Khttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0713_subarray_product_less_than_k/Solution.java
Minimum Size Subarray Sumhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0209_minimum_size_subarray_sum/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-6-breadth-first-search-depth-first-search
Number of Islandshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0200_number_of_islands/Solution.java
Number of Provinceshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0547_number_of_provinces/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-7-breadth-first-search-depth-first-search-1
Populating Next Right Pointers in Each Node IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0117_populating_next_right_pointers_in_each_node_ii/Solution.java
Subtree of Another Treehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0572_subtree_of_another_tree/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-8-breadth-first-search-depth-first-search-1
Shortest Path in Binary Matrixhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1091_shortest_path_in_binary_matrix/Solution.java
Surrounded Regionshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0130_surrounded_regions/Solution.java
All Paths From Source to Targethttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0797_all_paths_from_source_to_target/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-9-recursion-backtracking
Subsetshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0078_subsets/Solution.java
Subsets IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0090_subsets_ii/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-10-recursion-backtracking-1
Permutations IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0047_permutations_ii/Solution.java
Combination Sumhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0039_combination_sum/Solution.java
Combination Sum IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0040_combination_sum_ii/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-11-recursion-backtracking-1
Letter Combinations of a Phone Numberhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.java
Generate Parentheseshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0022_generate_parentheses/Solution.java
Word Searchhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0079_word_search/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-12-dynamic-programming-1
House Robber IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0213_house_robber_ii/Solution.java
Jump Gamehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0055_jump_game/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-13-dynamic-programming
Jump Game IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0045_jump_game_ii/Solution.java
Unique Pathshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0062_unique_paths/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-14-dynamic-programming
Longest Palindromic Substringhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0005_longest_palindromic_substring/Solution.java
Arithmetic Sliceshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0413_arithmetic_slices/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-15-dynamic-programming
Decode Wayshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0091_decode_ways/Solution.java
Word Breakhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0139_word_break/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-16-dynamic-programming
Longest Increasing Subsequencehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0300_longest_increasing_subsequence/Solution.java
Number of Longest Increasing Subsequencehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0673_number_of_longest_increasing_subsequence/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-17-dynamic-programming
Longest Common Subsequencehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java
Delete Operation for Two Stringshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0583_delete_operation_for_two_strings/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-18-dynamic-programming
Edit Distancehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0072_edit_distance/Solution.java
Coin Changehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0322_coin_change/Solution.java
Integer Breakhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0343_integer_break/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-19-bit-manipulation
Bitwise AND of Numbers Rangehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0201_bitwise_and_of_numbers_range/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-20-others
Shuffle an Arrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0384_shuffle_an_array/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-21-others
Happy Numberhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0202_happy_number/Solution.java
Max Points on a Linehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0149_max_points_on_a_line/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#binary-search-i
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-1
Binary Searchhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0704_binary_search/Solution.java
Guess Number Higher or Lowerhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0374_guess_number_higher_or_lower/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-2
Search Insert Positionhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0035_search_insert_position/Solution.java
Peak Index in a Mountain Arrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0852_peak_index_in_a_mountain_array/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-3
Valid Perfect Squarehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0367_valid_perfect_square/Solution.java
Find the Distance Value Between Two Arrayshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1385_find_the_distance_value_between_two_arrays/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-4
Sqrt(x)https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0069_sqrtx/Solution.java
Find Smallest Letter Greater Than Targethttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0744_find_smallest_letter_greater_than_target/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-5
First Bad Versionhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0278_first_bad_version/Solution.java
Find First and Last Position of Element in Sorted Arrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-6
Arranging Coinshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0441_arranging_coins/Solution.java
Kth Missing Positive Numberhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1539_kth_missing_positive_number/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-7
Two Sum II - Input Array Is Sortedhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0167_two_sum_ii_input_array_is_sorted/Solution.java
Special Array With X Elements Greater Than or Equal Xhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1608_special_array_with_x_elements_greater_than_or_equal_x/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-8
Count Negative Numbers in a Sorted Matrixhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1351_count_negative_numbers_in_a_sorted_matrix/Solution.java
Search a 2D Matrixhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0074_search_a_2d_matrix/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-9
The K Weakest Rows in a Matrixhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1337_the_k_weakest_rows_in_a_matrix/Solution.java
Check If N and Its Double Existhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1346_check_if_n_and_its_double_exist/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-10
Intersection of Two Arrays IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0350_intersection_of_two_arrays_ii/Solution.java
Sum of Square Numbershttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0633_sum_of_square_numbers/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-11
Maximum Distance Between a Pair of Valueshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1855_maximum_distance_between_a_pair_of_values/Solution.java
Search in Rotated Sorted Arrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-12
Find Minimum in Rotated Sorted Arrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#binary-search-ii
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-1-1
Minimum Size Subarray Sumhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0209_minimum_size_subarray_sum/Solution.java
Valid Triangle Numberhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0611_valid_triangle_number/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-2-1
Find K Closest Elementshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0658_find_k_closest_elements/Solution.java
Find the Student that Will Replace the Chalkhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1894_find_the_student_that_will_replace_the_chalk/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-3-1
Longest Increasing Subsequencehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0300_longest_increasing_subsequence/Solution.java
Minimum Limit of Balls in a Baghttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1760_minimum_limit_of_balls_in_a_bag/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-4-1
Koko Eating Bananashttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0875_koko_eating_bananas/Solution.java
Magnetic Force Between Two Ballshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1552_magnetic_force_between_two_balls/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-5-1
Find the Duplicate Numberhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0287_find_the_duplicate_number/Solution.java
Find the Smallest Divisor Given a Thresholdhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1283_find_the_smallest_divisor_given_a_threshold/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-6-1
Maximum Number of Removable Charactershttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1898_maximum_number_of_removable_characters/Solution.java
Minimum Speed to Arrive on Timehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1870_minimum_speed_to_arrive_on_time/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-7-1
Minimum Number of Days to Make m Bouquetshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1482_minimum_number_of_days_to_make_m_bouquets/Solution.java
Minimum Absolute Sum Differencehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1818_minimum_absolute_sum_difference/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-8-1
Search a 2D Matrix IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.java
H-Index IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0275_h_index_ii/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-9-1
Frequency of the Most Frequent Elementhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1838_frequency_of_the_most_frequent_element/Solution.java
Single Element in a Sorted Arrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0540_single_element_in_a_sorted_array/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-10-1
Count Complete Tree Nodeshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0222_count_complete_tree_nodes/Solution.java
Ways to Split Array Into Three Subarrayshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1712_ways_to_split_array_into_three_subarrays/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-11-1
Most Profit Assigning Workhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0826_most_profit_assigning_work/Solution.java
Find Right Intervalhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0436_find_right_interval/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-12-1
Search in Rotated Sorted Array IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0081_search_in_rotated_sorted_array_ii/Solution.java
Find Peak Elementhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0162_find_peak_element/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-13
Find Minimum in Rotated Sorted Array IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0154_find_minimum_in_rotated_sorted_array_ii/Solution.java
Random Pick with Weighthttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0528_random_pick_with_weight/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-14
Range Sum of Sorted Subarray Sumshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1508_range_sum_of_sorted_subarray_sums/Solution.java
Shortest Subarray to be Removed to Make Array Sortedhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1574_shortest_subarray_to_be_removed_to_make_array_sorted/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-15
Maximum Side Length of a Square with Sum Less than or Equal to Thresholdhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1292_maximum_side_length_of_a_square_with_sum_less_than_or_equal_to_threshold/Solution.java
Number of Subsequences That Satisfy the Given Sum Conditionhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1498_number_of_subsequences_that_satisfy_the_given_sum_condition/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-16
Time Based Key-Value Storehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0981_time_based_key_value_store/TimeMap.java
Sum of Mutated Array Closest to Targethttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1300_sum_of_mutated_array_closest_to_target/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-17
Maximum Value at a Given Index in a Bounded Arrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1802_maximum_value_at_a_given_index_in_a_bounded_array/Solution.java
Find a Peak Element IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1901_find_a_peak_element_ii/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-18
Snapshot Arrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1146_snapshot_array/SnapshotArray.java
Avoid Flood in The Cityhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1488_avoid_flood_in_the_city/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-19
Find Latest Group of Size Mhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1562_find_latest_group_of_size_m/Solution.java
Sell Diminishing-Valued Colored Ballshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1648_sell_diminishing_valued_colored_balls/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-20
Ugly Number IIIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1201_ugly_number_iii/Solution.java
Online Electionhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0911_online_election/TopVotedCandidate.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#dynamic-programming-i
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-1-2
Fibonacci Numberhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0509_fibonacci_number/Solution.java
N-th Tribonacci Numberhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1137_n_th_tribonacci_number/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-2-2
Climbing Stairshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0070_climbing_stairs/Solution.java
Min Cost Climbing Stairshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0746_min_cost_climbing_stairs/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-3-2
House Robberhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0198_house_robber/Solution.java
House Robber IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0213_house_robber_ii/Solution.java
Delete and Earnhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0740_delete_and_earn/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-4-2
Jump Gamehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0055_jump_game/Solution.java
Jump Game IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0045_jump_game_ii/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-5-2
Maximum Subarrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0053_maximum_subarray/Solution.java
Maximum Sum Circular Subarrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0918_maximum_sum_circular_subarray/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-6-2
Maximum Product Subarrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0152_maximum_product_subarray/Solution.java
Maximum Length of Subarray With Positive Producthttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1567_maximum_length_of_subarray_with_positive_product/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-7-2
Best Sightseeing Pairhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1014_best_sightseeing_pair/Solution.java
Best Time to Buy and Sell Stockhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.java
Best Time to Buy and Sell Stock IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0122_best_time_to_buy_and_sell_stock_ii/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-8-2
Best Time to Buy and Sell Stock with Cooldownhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0309_best_time_to_buy_and_sell_stock_with_cooldown/Solution.java
Best Time to Buy and Sell Stock with Transaction Feehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0714_best_time_to_buy_and_sell_stock_with_transaction_fee/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-9-2
Word Breakhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0139_word_break/Solution.java
Trapping Rain Waterhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0042_trapping_rain_water/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-10-2
Arithmetic Sliceshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0413_arithmetic_slices/Solution.java
Decode Wayshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0091_decode_ways/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-11-2
Ugly Number IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0264_ugly_number_ii/Solution.java
Unique Binary Search Treeshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0096_unique_binary_search_trees/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-12-2
Pascal's Trianglehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0118_pascals_triangle/Solution.java
Pascal's Triangle IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0119_pascals_triangle_ii/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-13-1
Minimum Falling Path Sumhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0931_minimum_falling_path_sum/Solution.java
Trianglehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0120_triangle/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-14-1
Matrix Block Sumhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1314_matrix_block_sum/Solution.java
Range Sum Query 2D - Immutablehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0304_range_sum_query_2d_immutable/NumMatrix.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-15-1
Unique Pathshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0062_unique_paths/Solution.java
Unique Paths IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0063_unique_paths_ii/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-16-1
Minimum Path Sumhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0064_minimum_path_sum/Solution.java
Maximal Squarehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0221_maximal_square/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-17-1
Longest Palindromic Substringhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0005_longest_palindromic_substring/Solution.java
Longest Palindromic Subsequencehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0516_longest_palindromic_subsequence/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-18-1
Longest Increasing Subsequencehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0300_longest_increasing_subsequence/Solution.java
Wiggle Subsequencehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0376_wiggle_subsequence/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-19-1
Is Subsequencehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0392_is_subsequence/Solution.java
Longest Common Subsequencehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java
Edit Distancehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0072_edit_distance/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-20-1
Coin Changehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0322_coin_change/Solution.java
Coin Change 2https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0518_coin_change_2/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-21
Combination Sum IVhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0377_combination_sum_iv/Solution.java
Integer Breakhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0343_integer_break/Solution.java
Perfect Squareshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0279_perfect_squares/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#programming-skills-i
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-1-basic-data-type
Count Odd Numbers in an Interval Rangehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1523_count_odd_numbers_in_an_interval_range/Solution.java
Average Salary Excluding the Minimum and Maximum Salaryhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1491_average_salary_excluding_the_minimum_and_maximum_salary/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-2-operator
Number of 1 Bitshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0191_number_of_1_bits/Solution.java
Subtract the Product and Sum of Digits of an Integerhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1281_subtract_the_product_and_sum_of_digits_of_an_integer/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-3-conditional-statements
Largest Perimeter Trianglehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0976_largest_perimeter_triangle/Solution.java
Find Nearest Point That Has the Same X or Y Coordinatehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1779_find_nearest_point_that_has_the_same_x_or_y_coordinate/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-4-loop
Sign of the Product of an Arrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1822_sign_of_the_product_of_an_array/Solution.java
Can Make Arithmetic Progression From Sequencehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1502_can_make_arithmetic_progression_from_sequence/Solution.java
Happy Numberhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0202_happy_number/Solution.java
Check if One String Swap Can Make Strings Equalhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1790_check_if_one_string_swap_can_make_strings_equal/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-5-function
N-ary Tree Preorder Traversalhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0589_n_ary_tree_preorder_traversal/Solution.java
Next Greater Element Ihttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0496_next_greater_element_i/Solution.java
Check If It Is a Straight Linehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1232_check_if_it_is_a_straight_line/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-6-array
Sum of All Odd Length Subarrayshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1588_sum_of_all_odd_length_subarrays/Solution.java
Move Zeroeshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0283_move_zeroes/Solution.java
Richest Customer Wealthhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1672_richest_customer_wealth/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-7-array
Matrix Diagonal Sumhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1572_matrix_diagonal_sum/Solution.java
Reshape the Matrixhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0566_reshape_the_matrix/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-8-string
Merge Strings Alternatelyhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1768_merge_strings_alternately/Solution.java
Goal Parser Interpretationhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1678_goal_parser_interpretation/Solution.java
Find the Differencehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0389_find_the_difference/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-9-string
To Lower Casehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0709_to_lower_case/Solution.java
Decrypt String from Alphabet to Integer Mappinghttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1309_decrypt_string_from_alphabet_to_integer_mapping/Solution.java
Verifying an Alien Dictionaryhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0953_verifying_an_alien_dictionary/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-10-linked-list-and-tree
Convert Binary Number in a Linked List to Integerhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1290_convert_binary_number_in_a_linked_list_to_integer/Solution.java
Middle of the Linked Listhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0876_middle_of_the_linked_list/Solution.java
Maximum Depth of Binary Treehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.java
Sum of Left Leaveshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0404_sum_of_left_leaves/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-11-containers-and-libraries
Sort Integers by The Number of 1 Bitshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1356_sort_integers_by_the_number_of_1_bits/Solution.java
Implement Queue using Stackshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0232_implement_queue_using_stacks/MyQueue.java
Valid Anagramhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0242_valid_anagram/Solution.java
Contains Duplicatehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0217_contains_duplicate/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-12-class-and-object
Design Parking Systemhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1603_design_parking_system/ParkingSystem.java
Range Sum Query - Immutablehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0303_range_sum_query_immutable/NumArray.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#programming-skills-ii
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-1-3
Monotonic Arrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0896_monotonic_array/Solution.java
Implement strStr()https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0028_find_the_index_of_the_first_occurrence_in_a_string/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-2-3
Balanced Binary Treehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0110_balanced_binary_tree/Solution.java
Repeated Substring Patternhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0459_repeated_substring_pattern/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-3-3
Evaluate Reverse Polish Notationhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0150_evaluate_reverse_polish_notation/Solution.java
Plus Onehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0066_plus_one/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-4-3
Linked List in Binary Treehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1367_linked_list_in_binary_tree/Solution.java
Multiply Stringshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0043_multiply_strings/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-5-3
Add Binaryhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0067_add_binary/Solution.java
Add to Array-Form of Integerhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0989_add_to_array_form_of_integer/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-6-3
Daily Temperatureshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0739_daily_temperatures/Solution.java
Length of Last Wordhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0058_length_of_last_word/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-7-3
Rotate Imagehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0048_rotate_image/Solution.java
Determine Whether Matrix Can Be Obtained By Rotationhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1886_determine_whether_matrix_can_be_obtained_by_rotation/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-8-3
Spiral Matrixhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0054_spiral_matrix/Solution.java
K Closest Points to Originhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0973_k_closest_points_to_origin/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-9-3
Arithmetic Subarrayshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1630_arithmetic_subarrays/Solution.java
N-ary Tree Level Order Traversalhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0429_n_ary_tree_level_order_traversal/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-10-3
Next Greater Element IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0503_next_greater_element_ii/Solution.java
Next Greater Element IIIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0556_next_greater_element_iii/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-11-3
Time Needed to Inform All Employeeshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1376_time_needed_to_inform_all_employees/Solution.java
Group Anagramshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0049_group_anagrams/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-12-3
Find All Anagrams in a Stringhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.java
Subarray Product Less Than Khttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0713_subarray_product_less_than_k/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-13-2
Range Sum Query 2D - Immutablehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0304_range_sum_query_2d_immutable/NumMatrix.java
Smallest Range IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0910_smallest_range_ii/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-14-2
Reorder Listhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0143_reorder_list/Solution.java
Copy List with Random Pointerhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0138_copy_list_with_random_pointer/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-15-2
Add Two Numbershttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0002_add_two_numbers/Solution.java
Add Two Numbers IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0445_add_two_numbers_ii/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-16-2
Rotate Listhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0061_rotate_list/Solution.java
Binary Search Tree Iteratorhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0173_binary_search_tree_iterator/BSTIterator.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-17-2
Seat Reservation Managerhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1845_seat_reservation_manager/SeatManager.java
Lemonade Changehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0860_lemonade_change/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-18-2
Min Stackhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0155_min_stack/MinStack.java
Flatten Nested List Iteratorhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0341_flatten_nested_list_iterator/NestedIterator.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-19-2
Design Authentication Managerhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1797_design_authentication_manager/AuthenticationManager.java
Design Linked Listhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0707_design_linked_list/MyLinkedList.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-20-2
Insert Delete GetRandom O(1)https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0380_insert_delete_getrandom_o1/RandomizedSet.java
Design Circular Queuehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0622_design_circular_queue/MyCircularQueue.java
My Calendar Ihttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0729_my_calendar_i/MyCalendar.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#graph-theory-i
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-1-matrix-related-problems
Flood Fillhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0733_flood_fill/Solution.java
Number of Islandshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0200_number_of_islands/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-2-matrix-related-problems
Max Area of Islandhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0695_max_area_of_island/Solution.java
Number of Closed Islandshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1254_number_of_closed_islands/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-3-matrix-related-problems
Number of Enclaveshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1020_number_of_enclaves/Solution.java
Count Sub Islandshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1905_count_sub_islands/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-4-matrix-related-problems
As Far from Land as Possiblehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1162_as_far_from_land_as_possible/Solution.java
Pacific Atlantic Water Flowhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0417_pacific_atlantic_water_flow/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-5-matrix-related-problems
Shortest Path in Binary Matrixhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1091_shortest_path_in_binary_matrix/Solution.java
01 Matrixhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0542_01_matrix/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-6-matrix-related-problems
Shortest Bridgehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0934_shortest_bridge/Solution.java
Nearest Exit from Entrance in Mazehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1926_nearest_exit_from_entrance_in_maze/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-7-standard-traversal
All Paths From Source to Targethttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0797_all_paths_from_source_to_target/Solution.java
Keys and Roomshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0841_keys_and_rooms/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-8-standard-traversal
Number of Provinceshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0547_number_of_provinces/Solution.java
Number of Operations to Make Network Connectedhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1319_number_of_operations_to_make_network_connected/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-9-standard-traversal
Time Needed to Inform All Employeeshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1376_time_needed_to_inform_all_employees/Solution.java
Find Eventual Safe Stateshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0802_find_eventual_safe_states/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-10-standard-traversal
Shortest Path with Alternating Colorshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1129_shortest_path_with_alternating_colors/Solution.java
Reorder Routes to Make All Paths Lead to the City Zerohttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero/Solution.java
Shortest Path Visiting All Nodeshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0847_shortest_path_visiting_all_nodes/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-11-breadth-first-search
Jump Game IIIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1306_jump_game_iii/Solution.java
Minimum Jumps to Reach Homehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1654_minimum_jumps_to_reach_home/Solution.java
Water and Jug Problemhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0365_water_and_jug_problem/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-12-breadth-first-search
Minimum Genetic Mutationhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0433_minimum_genetic_mutation/Solution.java
Open the Lockhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0752_open_the_lock/Solution.java
Word Ladderhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0127_word_ladder/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-13-graph-theory
Find the Town Judgehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0997_find_the_town_judge/Solution.java
Minimum Number of Vertices to Reach All Nodeshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1557_minimum_number_of_vertices_to_reach_all_nodes/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-14-graph-theory
Maximal Network Rankhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1615_maximal_network_rank/Solution.java
Possible Bipartitionhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0886_possible_bipartition/Solution.java
Is Graph Bipartite?https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0785_is_graph_bipartite/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#sql-i
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-1-select
Big Countrieshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0595_big_countries/script.sql
Recyclable and Low Fat Productshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1757_recyclable_and_low_fat_products/script.sql
Find Customer Refereehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0584_find_customer_referee/script.sql
Customers Who Never Orderhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0183_customers_who_never_order/script.sql
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-2-select-and-order
Calculate Special Bonushttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1873_calculate_special_bonus/script.sql
Swap Salaryhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0627_swap_salary/script.sql
Delete Duplicate Emailshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0196_delete_duplicate_emails/script.sql
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-3-string-processing-functions
Fix Names in a Tablehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1667_fix_names_in_a_table/script.sql
Group Sold Products By The Datehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1484_group_sold_products_by_the_date/script.sql
Patients With a Conditionhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1527_patients_with_a_condition/script.sql
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-4-union-and-select
Employees With Missing Informationhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1965_employees_with_missing_information/script.sql
Rearrange Products Tablehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1795_rearrange_products_table/script.sql
Tree Nodehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0608_tree_node/script.sql
Second Highest Salaryhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0176_second_highest_salary/script.sql
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-5-union
Combine Two Tableshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0175_combine_two_tables/script.sql
Customer Who Visited but Did Not Make Any Transactionshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1581_customer_who_visited_but_did_not_make_any_transactions/script.sql
Article Views Ihttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1148_article_views_i/script.sql
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-6-union
Rising Temperaturehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0197_rising_temperature/script.sql
Sales Personhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0607_sales_person/script.sql
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-7-function
User Activity for the Past 30 Days Ihttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1141_user_activity_for_the_past_30_days_i/script.sql
Daily Leads and Partnershttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1693_daily_leads_and_partners/script.sql
Find Followers Counthttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1729_find_followers_count/script.sql
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-8-function
Customer Placing the Largest Number of Ordershttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0586_customer_placing_the_largest_number_of_orders/script.sql
Game Play Analysis Ihttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0511_game_play_analysis_i/script.sql
The Latest Login in 2020https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1890_the_latest_login_in_2020/script.sql
Find Total Time Spent by Each Employeehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1741_find_total_time_spent_by_each_employee/script.sql
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-9-control-of-flow
Capital Gain/Losshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1393_capital_gainloss/script.sql
Top Travellershttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1407_top_travellers/script.sql
Market Analysis Ihttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1158_market_analysis_i/script.sql
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-10-where
Duplicate Emailshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0182_duplicate_emails/script.sql
Actors and Directors Who Cooperated At Least Three Timeshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1050_actors_and_directors_who_cooperated_at_least_three_times/script.sql
Bank Account Summary IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1587_bank_account_summary_ii/script.sql
Sales Analysis IIIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1084_sales_analysis_iii/script.sql
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#level-1
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-1-prefix-sum
Running Sum of 1d Arrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1480_running_sum_of_1d_array/Solution.java
Find Pivot Indexhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0724_find_pivot_index/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-2-string
Isomorphic Stringshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0205_isomorphic_strings/Solution.java
Is Subsequencehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0392_is_subsequence/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-3-linked-list
Merge Two Sorted Listshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0021_merge_two_sorted_lists/Solution.java
Reverse Linked Listhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0206_reverse_linked_list/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-4-linked-list
Middle of the Linked Listhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0876_middle_of_the_linked_list/Solution.java
Linked List Cycle IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0142_linked_list_cycle_ii/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-5-greedy
Best Time to Buy and Sell Stockhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.java
Longest Palindromehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0409_longest_palindrome/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-6-tree
N-ary Tree Preorder Traversalhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0589_n_ary_tree_preorder_traversal/Solution.java
Binary Tree Level Order Traversalhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-7-binary-search
Binary Searchhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0704_binary_search/Solution.java
First Bad Versionhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0278_first_bad_version/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-8-binary-search-tree
Validate Binary Search Treehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0098_validate_binary_search_tree/Solution.java
Lowest Common Ancestor of a Binary Search Treehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0235_lowest_common_ancestor_of_a_binary_search_tree/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-9-graphbfsdfs
Flood Fillhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0733_flood_fill/Solution.java
Number of Islandshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0200_number_of_islands/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-10-dynamic-programming
Fibonacci Numberhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0509_fibonacci_number/Solution.java
Climbing Stairshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0070_climbing_stairs/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-11-dynamic-programming
Min Cost Climbing Stairshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0746_min_cost_climbing_stairs/Solution.java
Unique Pathshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0062_unique_paths/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-12-sliding-windowtwo-pointer
Find All Anagrams in a Stringhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.java
Longest Repeating Character Replacementhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0424_longest_repeating_character_replacement/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-13-hashmap
Two Sumhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0001_two_sum/Solution.java
Bulls and Cowshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0299_bulls_and_cows/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-14-stack
Backspace String Comparehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0844_backspace_string_compare/Solution.java
Decode Stringhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0394_decode_string/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-15-heap
Last Stone Weighthttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1046_last_stone_weight/Solution.java
Top K Frequent Wordshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0692_top_k_frequent_words/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#level-2
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-1-implementationsimulation
Happy Numberhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0202_happy_number/Solution.java
Spiral Matrixhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0054_spiral_matrix/Solution.java
Where Will the Ball Fallhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1706_where_will_the_ball_fall/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-2-string-1
Longest Common Prefixhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0014_longest_common_prefix/Solution.java
Multiply Stringshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0043_multiply_strings/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-3-linked-list-1
Remove Nth Node From End of Listhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.java
Palindrome Linked Listhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0234_palindrome_linked_list/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-4-linked-list-1
Odd Even Linked Listhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0328_odd_even_linked_list/Solution.java
Sort Listhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0148_sort_list/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-5-greedy-1
Longest Palindrome by Concatenating Two Letter Wordshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2131_longest_palindrome_by_concatenating_two_letter_words/Solution.java
Task Schedulerhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0621_task_scheduler/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-6-tree-1
Invert Binary Treehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0226_invert_binary_tree/Solution.java
Balanced Binary Treehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0110_balanced_binary_tree/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-7-tree
Diameter of Binary Treehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0543_diameter_of_binary_tree/Solution.java
Path Sum IIIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0437_path_sum_iii/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-8-binary-search
Search a 2D Matrixhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0074_search_a_2d_matrix/Solution.java
Search in Rotated Sorted Arrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-9-binary-search-tree
Convert Sorted Array to Binary Search Treehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0108_convert_sorted_array_to_binary_search_tree/Solution.java
Kth Smallest Element in a BSThttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.java
Binary Search Tree Iteratorhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0173_binary_search_tree_iterator/BSTIterator.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-10-graphbfsdfs
Rotting Orangeshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0994_rotting_oranges/Solution.java
Pacific Atlantic Water Flowhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0417_pacific_atlantic_water_flow/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-11-graphbfsdfs
Course Schedule IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0210_course_schedule_ii/Solution.java
Bus Routeshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0815_bus_routes/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-12-dynamic-programming-2
House Robberhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0198_house_robber/Solution.java
Coin Changehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0322_coin_change/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-13-dynamic-programming-1
Partition Equal Subset Sumhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0416_partition_equal_subset_sum/Solution.java
Maximum Product Subarrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0152_maximum_product_subarray/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-14-sliding-windowtwo-pointer
Longest Substring Without Repeating Charactershttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.java
3Sum Closesthttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0016_3sum_closest/Solution.java
Minimum Window Substringhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0076_minimum_window_substring/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-15-tree
Same Treehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0100_same_tree/Solution.java
Symmetric Treehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0101_symmetric_tree/Solution.java
Binary Tree Right Side Viewhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0199_binary_tree_right_side_view/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-16-design
Implement Queue using Stackshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0232_implement_queue_using_stacks/MyQueue.java
Min Stackhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0155_min_stack/MinStack.java
Implement Trie (Prefix Tree)https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0208_implement_trie_prefix_tree/Trie.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-17-interval
Insert Intervalhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0057_insert_interval/Solution.java
Merge Intervalshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0056_merge_intervals/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-18-stack
Asteroid Collisionhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0735_asteroid_collision/Solution.java
Basic Calculator IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0227_basic_calculator_ii/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-19-union-find
Number of Provinceshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0547_number_of_provinces/Solution.java
Most Stones Removed with Same Row or Columnhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0947_most_stones_removed_with_same_row_or_column/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-20-brute-forcebacktracking
Combination Sumhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0039_combination_sum/Solution.java
Permutationshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0046_permutations/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#udemy
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#udemy-integers
Fizz Buzzhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0412_fizz_buzz/Solution.java
Single Numberhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0136_single_number/Solution.java
Reverse Integerhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0007_reverse_integer/Solution.java
Palindrome Numberhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0009_palindrome_number/Solution.java
Factorial Trailing Zeroeshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0172_factorial_trailing_zeroes/Solution.java
Pow(x, n)https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0050_powx_n/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#udemy-strings
Reverse Stringhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0344_reverse_string/Solution.java
Longest Common Prefixhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0014_longest_common_prefix/Solution.java
Repeated DNA Sequenceshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0187_repeated_dna_sequences/Solution.java
Longest Substring Without Repeating Charactershttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.java
Valid Parentheseshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0020_valid_parentheses/Solution.java
Longest Palindromic Substringhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0005_longest_palindromic_substring/Solution.java
Decode Stringhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0394_decode_string/Solution.java
Valid Anagramhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0242_valid_anagram/Solution.java
Group Anagramshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0049_group_anagrams/Solution.java
Reverse Words in a Stringhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0151_reverse_words_in_a_string/Solution.java
Integer to English Wordshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0273_integer_to_english_words/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#udemy-binary-search
Binary Searchhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0704_binary_search/Solution.java
Search in Rotated Sorted Arrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.java
Find Minimum in Rotated Sorted Arrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#udemy-arrays
Best Time to Buy and Sell Stockhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.java
Move Zeroeshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0283_move_zeroes/Solution.java
Two Sumhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0001_two_sum/Solution.java
Contains Duplicatehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0217_contains_duplicate/Solution.java
Length of Last Wordhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0058_length_of_last_word/Solution.java
Can Place Flowershttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0605_can_place_flowers/Solution.java
Best Time to Buy and Sell Stock IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0122_best_time_to_buy_and_sell_stock_ii/Solution.java
Remove Duplicates from Sorted Array IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0080_remove_duplicates_from_sorted_array_ii/Solution.java
Rotate Arrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0189_rotate_array/Solution.java
Jump Gamehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0055_jump_game/Solution.java
Sort Colorshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0075_sort_colors/Solution.java
Plus Onehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0066_plus_one/Solution.java
Product of Array Except Selfhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0238_product_of_array_except_self/Solution.java
Sequential Digitshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1291_sequential_digits/Solution.java
Find All Numbers Disappeared in an Arrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0448_find_all_numbers_disappeared_in_an_array/Solution.java
Find All Duplicates in an Arrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0442_find_all_duplicates_in_an_array/Solution.java
First Missing Positivehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0041_first_missing_positive/Solution.java
Degree of an Arrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0697_degree_of_an_array/Solution.java
K-diff Pairs in an Arrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0532_k_diff_pairs_in_an_array/Solution.java
Subarray Product Less Than Khttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0713_subarray_product_less_than_k/Solution.java
Minimum Domino Rotations For Equal Rowhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1007_minimum_domino_rotations_for_equal_row/Solution.java
Jump Game IIIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1306_jump_game_iii/Solution.java
132 Patternhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0456_132_pattern/Solution.java
Sliding Window Maximumhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0239_sliding_window_maximum/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#udemy-two-pointers
Is Subsequencehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0392_is_subsequence/Solution.java
Valid Palindromehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0125_valid_palindrome/Solution.java
Squares of a Sorted Arrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0977_squares_of_a_sorted_array/Solution.java
Remove Duplicates from Sorted Arrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0026_remove_duplicates_from_sorted_array/Solution.java
Trapping Rain Waterhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0042_trapping_rain_water/Solution.java
3Sumhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0015_3sum/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#udemy-famous-algorithm
Maximum Subarrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0053_maximum_subarray/Solution.java
Majority Elementhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0169_majority_element/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#udemy-sorting-algorithms
Sort an Arrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0912_sort_an_array/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#udemy-2d-arraysmatrix
Range Sum Query 2D - Immutablehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0304_range_sum_query_2d_immutable/NumMatrix.java
Search a 2D Matrixhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0074_search_a_2d_matrix/Solution.java
Spiral Matrixhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0054_spiral_matrix/Solution.java
Rotate Imagehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0048_rotate_image/Solution.java
Matrix Diagonal Sumhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1572_matrix_diagonal_sum/Solution.java
Set Matrix Zeroeshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0073_set_matrix_zeroes/Solution.java
Merge Intervalshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0056_merge_intervals/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#udemy-linked-list
Flatten Binary Tree to Linked Listhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.java
Add Two Numbers IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0445_add_two_numbers_ii/Solution.java
Odd Even Linked Listhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0328_odd_even_linked_list/Solution.java
Rotate Listhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0061_rotate_list/Solution.java
Swap Nodes in Pairshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0024_swap_nodes_in_pairs/Solution.java
Middle of the Linked Listhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0876_middle_of_the_linked_list/Solution.java
Linked List Cycle IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0142_linked_list_cycle_ii/Solution.java
Linked List Cyclehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0141_linked_list_cycle/Solution.java
Reverse Linked Listhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0206_reverse_linked_list/Solution.java
Merge Two Sorted Listshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0021_merge_two_sorted_lists/Solution.java
Intersection of Two Linked Listshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0160_intersection_of_two_linked_lists/Solution.java
Palindrome Linked Listhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0234_palindrome_linked_list/Solution.java
Copy List with Random Pointerhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0138_copy_list_with_random_pointer/Solution.java
Reverse Nodes in k-Grouphttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.java
LRU Cachehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0146_lru_cache/LRUCache.java
Design Linked Listhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0707_design_linked_list/MyLinkedList.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#udemy-tree-stack-queue
Binary Tree Preorder Traversalhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0144_binary_tree_preorder_traversal/Solution.java
Binary Tree Inorder Traversalhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0094_binary_tree_inorder_traversal/Solution.java
Binary Tree Postorder Traversalhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0145_binary_tree_postorder_traversal/Solution.java
Binary Tree Level Order Traversalhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.java
Binary Tree Zigzag Level Order Traversalhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0103_binary_tree_zigzag_level_order_traversal/Solution.java
Convert Sorted Array to Binary Search Treehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0108_convert_sorted_array_to_binary_search_tree/Solution.java
Construct Binary Search Tree from Preorder Traversalhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1008_construct_binary_search_tree_from_preorder_traversal/Solution.java
Diameter of Binary Treehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0543_diameter_of_binary_tree/Solution.java
Range Sum of BSThttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0938_range_sum_of_bst/Solution.java
Same Treehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0100_same_tree/Solution.java
Invert Binary Treehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0226_invert_binary_tree/Solution.java
Minimum Depth of Binary Treehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0111_minimum_depth_of_binary_tree/Solution.java
Maximum Depth of Binary Treehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.java
Balanced Binary Treehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0110_balanced_binary_tree/Solution.java
Insert into a Binary Search Treehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0701_insert_into_a_binary_search_tree/Solution.java
Serialize and Deserialize Binary Treehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0297_serialize_and_deserialize_binary_tree/Codec.java
Binary Tree Maximum Path Sumhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.java
Validate Binary Search Treehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0098_validate_binary_search_tree/Solution.java
House Robber IIIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0337_house_robber_iii/Solution.java
Lowest Common Ancestor of a Binary Treehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.java
Binary Tree Camerashttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0968_binary_tree_cameras/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#udemy-trie-and-heap
Implement Trie (Prefix Tree)https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0208_implement_trie_prefix_tree/Trie.java
Prefix and Suffix Searchhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0745_prefix_and_suffix_search/WordFilter.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#udemy-graph
Number of Islandshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0200_number_of_islands/Solution.java
Clone Graphhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0133_clone_graph/Solution.java
Pacific Atlantic Water Flowhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0417_pacific_atlantic_water_flow/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#udemy-dynamic-programming
Trianglehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0120_triangle/Solution.java
Pascal's Trianglehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0118_pascals_triangle/Solution.java
Pascal's Triangle IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0119_pascals_triangle_ii/Solution.java
Word Breakhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0139_word_break/Solution.java
Maximum Product Subarrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0152_maximum_product_subarray/Solution.java
House Robberhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0198_house_robber/Solution.java
House Robber IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0213_house_robber_ii/Solution.java
Fibonacci Numberhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0509_fibonacci_number/Solution.java
Climbing Stairshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0070_climbing_stairs/Solution.java
Minimum Path Sumhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0064_minimum_path_sum/Solution.java
Longest Increasing Subsequencehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0300_longest_increasing_subsequence/Solution.java
Longest Common Subsequencehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java
Edit Distancehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0072_edit_distance/Solution.java
Wildcard Matchinghttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0044_wildcard_matching/Solution.java
Regular Expression Matchinghttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0010_regular_expression_matching/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#udemy-backtrackingrecursion
Generate Parentheseshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0022_generate_parentheses/Solution.java
Combination Sumhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0039_combination_sum/Solution.java
Combination Sum IIIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0216_combination_sum_iii/Solution.java
Subsetshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0078_subsets/Solution.java
Letter Combinations of a Phone Numberhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.java
Permutationshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0046_permutations/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#udemy-bit-manipulation
Number of 1 Bitshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0191_number_of_1_bits/Solution.java
Find the Differencehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0389_find_the_difference/Solution.java
Reverse Bitshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0190_reverse_bits/Solution.java
Hamming Distancehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0461_hamming_distance/Solution.java
Complement of Base 10 Integerhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1009_complement_of_base_10_integer/Solution.java
Counting Bitshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0338_counting_bits/Solution.java
Sum of Two Integershttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0371_sum_of_two_integers/Solution.java
Divide Two Integershttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0029_divide_two_integers/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#udemy-design
Min Stackhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0155_min_stack/MinStack.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#data-structure-i
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-1-array
Contains Duplicatehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0217_contains_duplicate/Solution.java
Maximum Subarrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0053_maximum_subarray/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-2-array
Two Sumhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0001_two_sum/Solution.java
Merge Sorted Arrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0088_merge_sorted_array/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-3-array
Intersection of Two Arrays IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0350_intersection_of_two_arrays_ii/Solution.java
Best Time to Buy and Sell Stockhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-4-array
Reshape the Matrixhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0566_reshape_the_matrix/Solution.java
Pascal's Trianglehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0118_pascals_triangle/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-5-array
Valid Sudokuhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0036_valid_sudoku/Solution.java
Search a 2D Matrixhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0074_search_a_2d_matrix/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-6-string
First Unique Character in a Stringhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0387_first_unique_character_in_a_string/Solution.java
Ransom Notehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0383_ransom_note/Solution.java
Valid Anagramhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0242_valid_anagram/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-7-linked-list
Linked List Cyclehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0141_linked_list_cycle/Solution.java
Merge Two Sorted Listshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0021_merge_two_sorted_lists/Solution.java
Remove Linked List Elementshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0203_remove_linked_list_elements/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-8-linked-list
Reverse Linked Listhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0206_reverse_linked_list/Solution.java
Remove Duplicates from Sorted Listhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0083_remove_duplicates_from_sorted_list/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-9-stack-queue
Valid Parentheseshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0020_valid_parentheses/Solution.java
Implement Queue using Stackshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0232_implement_queue_using_stacks/MyQueue.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-10-tree
Binary Tree Preorder Traversalhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0144_binary_tree_preorder_traversal/Solution.java
Binary Tree Inorder Traversalhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0094_binary_tree_inorder_traversal/Solution.java
Binary Tree Postorder Traversalhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0145_binary_tree_postorder_traversal/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-11-tree
Binary Tree Level Order Traversalhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.java
Maximum Depth of Binary Treehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.java
Symmetric Treehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0101_symmetric_tree/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-12-tree
Invert Binary Treehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0226_invert_binary_tree/Solution.java
Path Sumhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0112_path_sum/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-13-tree
Search in a Binary Search Treehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0700_search_in_a_binary_search_tree/Solution.java
Insert into a Binary Search Treehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0701_insert_into_a_binary_search_tree/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-14-tree
Validate Binary Search Treehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0098_validate_binary_search_tree/Solution.java
Two Sum IV - Input is a BSThttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0653_two_sum_iv_input_is_a_bst/Solution.java
Lowest Common Ancestor of a Binary Search Treehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0235_lowest_common_ancestor_of_a_binary_search_tree/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#data-structure-ii
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-1-array-1
Single Numberhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0136_single_number/Solution.java
Majority Elementhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0169_majority_element/Solution.java
3Sumhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0015_3sum/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-2-array-1
Sort Colorshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0075_sort_colors/Solution.java
Merge Intervalshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0056_merge_intervals/Solution.java
Design HashMaphttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0706_design_hashmap/MyHashMap.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-3-array-1
Pascal's Triangle IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0119_pascals_triangle_ii/Solution.java
Rotate Imagehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0048_rotate_image/Solution.java
Spiral Matrix IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0059_spiral_matrix_ii/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-4-array-1
Search a 2D Matrix IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.java
Non-overlapping Intervalshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0435_non_overlapping_intervals/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-5-array-1
Increasing Triplet Subsequencehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0334_increasing_triplet_subsequence/Solution.java
Product of Array Except Selfhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0238_product_of_array_except_self/Solution.java
Subarray Sum Equals Khttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0560_subarray_sum_equals_k/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-6-string-1
Add Stringshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0415_add_strings/Solution.java
Longest Palindromehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0409_longest_palindrome/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-7-string
Word Patternhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0290_word_pattern/Solution.java
Partition Labelshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0763_partition_labels/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-8-string-1
Group Anagramshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0049_group_anagrams/Solution.java
Multiply Stringshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0043_multiply_strings/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-9-string-1
Repeated DNA Sequenceshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0187_repeated_dna_sequences/Solution.java
Longest Palindromic Substringhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0005_longest_palindromic_substring/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-10-linked-list
Add Two Numbershttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0002_add_two_numbers/Solution.java
Linked List Cycle IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0142_linked_list_cycle_ii/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-11-linked-list
Intersection of Two Linked Listshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0160_intersection_of_two_linked_lists/Solution.java
Remove Duplicates from Sorted List IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0082_remove_duplicates_from_sorted_list_ii/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-12-linked-list
Swap Nodes in Pairshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0024_swap_nodes_in_pairs/Solution.java
Design Linked Listhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0707_design_linked_list/MyLinkedList.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-13-linked-list
Reverse Nodes in k-Grouphttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.java
Reorder Listhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0143_reorder_list/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-14-stack-queue
Min Stackhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0155_min_stack/MinStack.java
Minimum Remove to Make Valid Parentheseshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1249_minimum_remove_to_make_valid_parentheses/Solution.java
Find the Winner of the Circular Gamehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1823_find_the_winner_of_the_circular_game/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-15-tree-1
Convert Sorted Array to Binary Search Treehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0108_convert_sorted_array_to_binary_search_tree/Solution.java
Construct Binary Tree from Preorder and Inorder Traversalhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.java
Binary Tree Zigzag Level Order Traversalhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0103_binary_tree_zigzag_level_order_traversal/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-16-tree
Binary Tree Right Side Viewhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0199_binary_tree_right_side_view/Solution.java
Path Sum IIhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0113_path_sum_ii/Solution.java
Delete Node in a BSThttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0450_delete_node_in_a_bst/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-17-tree
Kth Smallest Element in a BSThttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.java
Binary Search Tree Iteratorhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0173_binary_search_tree_iterator/BSTIterator.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-18-tree
Lowest Common Ancestor of a Binary Treehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.java
Serialize and Deserialize Binary Treehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0297_serialize_and_deserialize_binary_tree/Codec.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-19-graph
Find the Town Judgehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0997_find_the_town_judge/Solution.java
Minimum Number of Vertices to Reach All Nodeshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1557_minimum_number_of_vertices_to_reach_all_nodes/Solution.java
Keys and Roomshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0841_keys_and_rooms/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-20-heap-priority-queue
Kth Largest Element in an Arrayhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.java
Top K Frequent Elementshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0347_top_k_frequent_elements/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#day-21-heap-priority-queue
Sort Characters By Frequencyhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0451_sort_characters_by_frequency/Solution.java
K Closest Points to Originhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0973_k_closest_points_to_origin/Solution.java
https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#contributing
leetcode-in-java.github.iohttps://leetcode-in-java.github.io
Readme https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#readme-ov-file
MIT license https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#MIT-1-ov-file
Security policy https://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java#security-ov-file
Please reload this pagehttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java
Activityhttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/activity
Custom propertieshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/custom-properties
0 starshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/stargazers
0 watchinghttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/watchers
0 forkshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/forks
Report repository https://patch-diff.githubusercontent.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2Fbsnyl5%2FLeetCode-in-Java&report=bsnyl5+%28user%29
Releaseshttps://patch-diff.githubusercontent.com/bsnyl5/LeetCode-in-Java/releases
Packages 0https://patch-diff.githubusercontent.com/orgs/bsnyl5/packages?repo_name=LeetCode-in-Java
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.