René's URL Explorer Experiment


Title: GitHub - pekumar7/LeetCode-in-Java: Java Solution for LeetCode algorithm problems, continually updating.

Open Graph Title: GitHub - pekumar7/LeetCode-in-Java: Java Solution for LeetCode algorithm problems, continually updating.

X Title: GitHub - pekumar7/LeetCode-in-Java: Java Solution for LeetCode algorithm problems, continually updating.

Description: Java Solution for LeetCode algorithm problems, continually updating. - pekumar7/LeetCode-in-Java

Open Graph Description: Java Solution for LeetCode algorithm problems, continually updating. - pekumar7/LeetCode-in-Java

X Description: Java Solution for LeetCode algorithm problems, continually updating. - pekumar7/LeetCode-in-Java

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

X: @github

direct link

Domain: patch-diff.githubusercontent.com

route-pattern/:user_id/:repository
route-controllerfiles
route-actiondisambiguate
fetch-noncev2:17c8304a-9d84-df8c-da3f-c6a0882c7362
current-catalog-service-hashf3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb
request-id9C84:36131C:13E781D:1C18326:697238B7
html-safe-nonce965f22eb514b0c09e97773b6e5257f75c178666057d70b99d375d45191c1b4a6
visitor-payloadeyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiI5Qzg0OjM2MTMxQzoxM0U3ODFEOjFDMTgzMjY6Njk3MjM4QjciLCJ2aXNpdG9yX2lkIjoiNjI4MjI0NDg4MTc2MjEwNTUyNyIsInJlZ2lvbl9lZGdlIjoiaWFkIiwicmVnaW9uX3JlbmRlciI6ImlhZCJ9
visitor-hmac584cf40ccecc5a4c73ce00fa8e1af58c71ab7b021c958ed6557d5e2720ab5d33
hovercard-subject-tagrepository:507543903
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/pekumar7/LeetCode-in-Java
twitter:imagehttps://opengraph.githubassets.com/f360047fde16d28f45569b10666bb79dfdc05858ddef5fc355ce28738f31ceb1/pekumar7/LeetCode-in-Java
twitter:cardsummary_large_image
og:imagehttps://opengraph.githubassets.com/f360047fde16d28f45569b10666bb79dfdc05858ddef5fc355ce28738f31ceb1/pekumar7/LeetCode-in-Java
og:image:altJava Solution for LeetCode algorithm problems, continually updating. - pekumar7/LeetCode-in-Java
og:image:width1200
og:image:height600
og:site_nameGitHub
og:typeobject
hostnamegithub.com
expected-hostnamegithub.com
None3272b1e540db48cb02dab38469e01f8bc1d0ec4984ec870db3829659e109d2e3
turbo-cache-controlno-preview
go-importgithub.com/pekumar7/LeetCode-in-Java git https://github.com/pekumar7/LeetCode-in-Java.git
octolytics-dimension-user_id63391033
octolytics-dimension-user_loginpekumar7
octolytics-dimension-repository_id507543903
octolytics-dimension-repository_nwopekumar7/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
release0d362c8696f774bd4bde925e900be46408550b5d
ui-targetfull
theme-color#1e2327
color-schemelight dark

Links:

Skip to contenthttps://patch-diff.githubusercontent.com/pekumar7/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%2Fpekumar7%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%2Fpekumar7%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=pekumar7%2FLeetCode-in-Java
Reloadhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java
Reloadhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java
Reloadhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java
pekumar7 https://patch-diff.githubusercontent.com/pekumar7
LeetCode-in-Javahttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java
javadev/LeetCode-in-Javahttps://patch-diff.githubusercontent.com/javadev/LeetCode-in-Java
Notifications https://patch-diff.githubusercontent.com/login?return_to=%2Fpekumar7%2FLeetCode-in-Java
Fork 0 https://patch-diff.githubusercontent.com/login?return_to=%2Fpekumar7%2FLeetCode-in-Java
Star 1 https://patch-diff.githubusercontent.com/login?return_to=%2Fpekumar7%2FLeetCode-in-Java
leetcode-in-java.github.iohttps://leetcode-in-java.github.io
MIT license https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/LICENSE
1 star https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/stargazers
102 forks https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/forks
Branches https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/branches
Tags https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/tags
Activity https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/activity
Star https://patch-diff.githubusercontent.com/login?return_to=%2Fpekumar7%2FLeetCode-in-Java
Notifications https://patch-diff.githubusercontent.com/login?return_to=%2Fpekumar7%2FLeetCode-in-Java
Code https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java
Pull requests 0 https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/pulls
Actions https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/actions
Projects 0 https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/projects
Security Uh oh! There was an error while loading. Please reload this page. https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/security
Please reload this pagehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java
Insights https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/pulse
Code https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java
Pull requests https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/pulls
Actions https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/actions
Projects https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/projects
Security https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/security
Insights https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/pulse
Brancheshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/branches
Tagshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/tags
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/branches
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/tags
1,777 Commitshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/commits/main/
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/commits/main/
.github/workflowshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/tree/main/.github/workflows
.github/workflowshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/tree/main/.github/workflows
gradle/wrapperhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/tree/main/gradle/wrapper
gradle/wrapperhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/tree/main/gradle/wrapper
srchttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/tree/main/src
srchttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/tree/main/src
.gitignorehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/.gitignore
.gitignorehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/.gitignore
LICENSEhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/LICENSE
LICENSEhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/LICENSE
README.mdhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/README.md
README.mdhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/README.md
SECURITY.mdhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/SECURITY.md
SECURITY.mdhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/SECURITY.md
build.gradlehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/build.gradle
build.gradlehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/build.gradle
checkstyle.xmlhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/checkstyle.xml
checkstyle.xmlhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/checkstyle.xml
codecov.ymlhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/codecov.yml
codecov.ymlhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/codecov.yml
gradle.propertieshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/gradle.properties
gradle.propertieshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/gradle.properties
gradlewhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/gradlew
gradlewhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/gradlew
gradlew.bathttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/gradlew.bat
gradlew.bathttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/gradlew.bat
pom-central.xmlhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/pom-central.xml
pom-central.xmlhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/pom-central.xml
pom-central11.xmlhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/pom-central11.xml
pom-central11.xmlhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/pom-central11.xml
pom-central17.xmlhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/pom-central17.xml
pom-central17.xmlhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/pom-central17.xml
pom.xmlhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/pom.xml
pom.xmlhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/pom.xml
settings.gradlehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/settings.gradle
settings.gradlehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/settings.gradle
READMEhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java
Licensehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java
Securityhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#leetcode-in-java
http://search.maven.org/#search%7Cga%7C1%7Cg%3A%22com.github.javadev%22%20AND%20a%3A%22leetcode-in-java%22
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/pekumar7/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
Data Structure Ihttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#data-structure-i
Data Structure IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#data-structure-ii
Algorithm Ihttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#algorithm-i
Algorithm IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#algorithm-ii
Binary Search Ihttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#binary-search-i
Binary Search IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#binary-search-ii
Dynamic Programming Ihttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#dynamic-programming-i
Programming Skills Ihttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#programming-skills-i
Programming Skills IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#programming-skills-ii
Graph Theory Ihttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#graph-theory-i
SQL Ihttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#sql-i
Level 1https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#level-1
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#data-structure-i
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-1-array
Contains Duplicatehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0217_contains_duplicate/Solution.java
Maximum Subarrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0053_maximum_subarray/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-2-array
Two Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0001_two_sum/Solution.java
Merge Sorted Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0088_merge_sorted_array/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-3-array
Intersection of Two Arrays IIhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java#day-4-array
Reshape the Matrixhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0566_reshape_the_matrix/Solution.java
Pascal's Trianglehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0118_pascals_triangle/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-5-array
Valid Sudokuhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0036_valid_sudoku/Solution.java
Search a 2D Matrixhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0074_search_a_2d_matrix/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-6-string
First Unique Character in a Stringhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0383_ransom_note/Solution.java
Valid Anagramhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0242_valid_anagram/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-7-linked-list
Linked List Cyclehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0141_linked_list_cycle/Solution.java
Merge Two Sorted Listshttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0203_remove_linked_list_elements/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-8-linked-list
Reverse Linked Listhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0083_remove_duplicates_from_sorted_list/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-9-stack-queue
Valid Parentheseshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0020_valid_parentheses/Solution.java
Implement Queue using Stackshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0232_implement_queue_using_stacks/MyQueue.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-10-tree
Binary Tree Preorder Traversalhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0145_binary_tree_postorder_traversal/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-11-tree
Binary Tree Level Order Traversalhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.java
Symmetric Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0101_symmetric_tree/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-12-tree
Invert Binary Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0226_invert_binary_tree/Solution.java
Path Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0112_path_sum/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-13-tree
Search in a Binary Search Treehttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0701_insert_into_a_binary_search_tree/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-14-tree
Validate Binary Search Treehttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java#data-structure-ii
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-1-array-1
Single Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0136_single_number/Solution.java
Majority Elementhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0169_majority_element/Solution.java
3Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0015_3sum/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-2-array-1
Sort Colorshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0075_sort_colors/Solution.java
Merge Intervalshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0056_merge_intervals/Solution.java
Design HashMaphttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0706_design_hashmap/MyHashMap.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-3-array-1
Pascal's Triangle IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0119_pascals_triangle_ii/Solution.java
Rotate Imagehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0048_rotate_image/Solution.java
Spiral Matrix IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0059_spiral_matrix_ii/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-4-array-1
Search a 2D Matrix IIhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0435_non_overlapping_intervals/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-5-array-1
Increasing Triplet Subsequencehttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0560_subarray_sum_equals_k/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-6-string-1
Add Stringshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0415_add_strings/Solution.java
Longest Palindromehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0409_longest_palindrome/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-7-string
Word Patternhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0290_word_pattern/Solution.java
Partition Labelshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0763_partition_labels/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-8-string
Group Anagramshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0049_group_anagrams/Solution.java
Multiply Stringshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0043_multiply_strings/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-9-string
Repeated DNA Sequenceshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0187_repeated_dna_sequences/Solution.java
Longest Palindromic Substringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0005_longest_palindromic_substring/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-10-linked-list
Add Two Numbershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0002_add_two_numbers/Solution.java
Linked List Cycle IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0142_linked_list_cycle_ii/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-11-linked-list
Intersection of Two Linked Listshttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0082_remove_duplicates_from_sorted_list_ii/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-12-linked-list
Swap Nodes in Pairshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0024_swap_nodes_in_pairs/Solution.java
Design Linked Listhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0707_design_linked_list/MyLinkedList.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-13-linked-list
Reverse Nodes in k-Grouphttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.java
Reorder Listhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0143_reorder_list/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-14-stack-queue
Min Stackhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java#day-15-tree
Convert Sorted Array to Binary Search Treehttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0103_binary_tree_zigzag_level_order_traversal/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-16-tree
Binary Tree Right Side Viewhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0450_delete_node_in_a_bst/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-17-tree
Kth Smallest Element in a BSThttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0173_binary_search_tree_iterator/BSTIterator.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-18-tree
Lowest Common Ancestor of a Binary Treehttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0297_serialize_and_deserialize_binary_tree/Codec.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-19-graph
Find the Town Judgehttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0841_keys_and_rooms/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-20-heap-priority-queue
Kth Largest Element in an Arrayhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0347_top_k_frequent_elements/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-21-heap-priority-queue
Sort Characters By Frequencyhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0973_k_closest_points_to_origin/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#algorithm-i
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-1-binary-search
Binary Searchhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0704_binary_search/Solution.java
First Bad Versionhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0278_first_bad_version/Solution.java
Search Insert Positionhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0035_search_insert_position/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-2-two-pointers
Squares of a Sorted Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0977_squares_of_a_sorted_array/Solution.java
Rotate Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0189_rotate_array/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-3-two-pointers
Move Zeroeshttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java#day-4-two-pointers
Reverse Stringhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0557_reverse_words_in_a_string_iii/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-5-two-pointers
Middle of the Linked Listhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java#day-6-sliding-window
Longest Substring Without Repeating Charactershttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0567_permutation_in_string/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-7-breadth-first-search-depth-first-search
Flood Fillhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0733_flood_fill/Solution.java
Max Area of Islandhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0695_max_area_of_island/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-8-breadth-first-search-depth-first-search
Merge Two Binary Treeshttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java#day-9-breadth-first-search-depth-first-search
01 Matrixhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0542_01_matrix/Solution.java
Rotting Orangeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0994_rotting_oranges/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-10-recursion-backtracking
Merge Two Sorted Listshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0021_merge_two_sorted_lists/Solution.java
Reverse Linked Listhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0206_reverse_linked_list/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-11-recursion-backtracking
Combinationshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0077_combinations/Solution.java
Permutationshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0046_permutations/Solution.java
Letter Case Permutationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0784_letter_case_permutation/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-12-dynamic-programming
Climbing Stairshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0070_climbing_stairs/Solution.java
House Robberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0198_house_robber/Solution.java
Trianglehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0120_triangle/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-13-bit-manipulation
Power of Twohttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0231_power_of_two/Solution.java
Number of 1 Bitshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0191_number_of_1_bits/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-14-bit-manipulation
Reverse Bitshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0190_reverse_bits/Solution.java
Single Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0136_single_number/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#algorithm-ii
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-1-binary-search-1
Find First and Last Position of Element in Sorted Arrayhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0074_search_a_2d_matrix/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-2-binary-search
Find Minimum in Rotated Sorted Arrayhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0162_find_peak_element/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-3-two-pointers-1
Remove Duplicates from Sorted List IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0082_remove_duplicates_from_sorted_list_ii/Solution.java
3Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0015_3sum/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-4-two-pointers-1
Backspace String Comparehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0844_backspace_string_compare/Solution.java
Interval List Intersectionshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0986_interval_list_intersections/Solution.java
Container With Most Waterhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0011_container_with_most_water/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-5-sliding-window
Find All Anagrams in a Stringhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0209_minimum_size_subarray_sum/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-6-breadth-first-search-depth-first-search
Number of Islandshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0200_number_of_islands/Solution.java
Number of Provinceshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0547_number_of_provinces/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-7-breadth-first-search-depth-first-search-1
Populating Next Right Pointers in Each Node IIhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0572_subtree_of_another_tree/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-8-breadth-first-search-depth-first-search-1
Shortest Path in Binary Matrixhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1091_shortest_path_in_binary_matrix/Solution.java
Surrounded Regionshttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0797_all_paths_from_source_to_target/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-9-recursion-backtracking
Subsetshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0078_subsets/Solution.java
Subsets IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0090_subsets_ii/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-10-recursion-backtracking-1
Permutations IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0047_permutations_ii/Solution.java
Combination Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0039_combination_sum/Solution.java
Combination Sum IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0040_combination_sum_ii/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-11-recursion-backtracking-1
Letter Combinations of a Phone Numberhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0022_generate_parentheses/Solution.java
Word Searchhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0079_word_search/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-12-dynamic-programming-1
House Robber IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0213_house_robber_ii/Solution.java
Jump Gamehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0055_jump_game/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-13-dynamic-programming
Jump Game IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0045_jump_game_ii/Solution.java
Unique Pathshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0062_unique_paths/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-14-dynamic-programming
Longest Palindromic Substringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0005_longest_palindromic_substring/Solution.java
Arithmetic Sliceshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0413_arithmetic_slices/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-15-dynamic-programming
Decode Wayshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0091_decode_ways/Solution.java
Word Breakhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0139_word_break/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-16-dynamic-programming
Longest Increasing Subsequencehttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0673_number_of_longest_increasing_subsequence/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-17-dynamic-programming
Longest Common Subsequencehttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0583_delete_operation_for_two_strings/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-18-dynamic-programming
Edit Distancehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0072_edit_distance/Solution.java
Coin Changehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0322_coin_change/Solution.java
Integer Breakhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0343_integer_break/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-19-bit-manipulation
Bitwise AND of Numbers Rangehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0201_bitwise_and_of_numbers_range/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-20-others
Shuffle an Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0384_shuffle_an_array/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-21-others
Happy Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0202_happy_number/Solution.java
Max Points on a Linehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0149_max_points_on_a_line/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#binary-search-i
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-1
Binary Searchhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0704_binary_search/Solution.java
Guess Number Higher or Lowerhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0374_guess_number_higher_or_lower/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-2
Search Insert Positionhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0852_peak_index_in_a_mountain_array/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-3
Valid Perfect Squarehttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java#day-4
Sqrt(x)https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0069_sqrtx/Solution.java
Find Smallest Letter Greater Than Targethttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0744_find_smallest_letter_greater_than_target/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-5
First Bad Versionhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java#day-6
Arranging Coinshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0441_arranging_coins/Solution.java
Kth Missing Positive Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1539_kth_missing_positive_number/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-7
Two Sum II - Input Array Is Sortedhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java#day-8
Count Negative Numbers in a Sorted Matrixhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0074_search_a_2d_matrix/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-9
The K Weakest Rows in a Matrixhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java#day-10
Intersection of Two Arrays IIhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0633_sum_of_square_numbers/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-11
Maximum Distance Between a Pair of Valueshttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-12
Find Minimum in Rotated Sorted Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#binary-search-ii
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-1-1
Minimum Size Subarray Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0209_minimum_size_subarray_sum/Solution.java
Valid Triangle Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0611_valid_triangle_number/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-2-1
Find K Closest Elementshttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java#day-3-1
Longest Increasing Subsequencehttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java#day-4-1
Koko Eating Bananashttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1552_magnetic_force_between_two_balls/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-5-1
Find the Duplicate Numberhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java#day-6-1
Maximum Number of Removable Charactershttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1870_minimum_speed_to_arrive_on_time/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-7-1
Minimum Number of Days to Make m Bouquetshttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1818_minimum_absolute_sum_difference/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-8-1
Search a 2D Matrix IIhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0275_h_index_ii/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-9-1
Frequency of the Most Frequent Elementhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0540_single_element_in_a_sorted_array/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-10-1
Count Complete Tree Nodeshttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java#day-11-1
Most Profit Assigning Workhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0826_most_profit_assigning_work/Solution.java
Find Right Intervalhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0436_find_right_interval/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-12-1
Search in Rotated Sorted Array IIhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0162_find_peak_element/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-13
Find Minimum in Rotated Sorted Array IIhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0528_random_pick_with_weight/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-14
Range Sum of Sorted Subarray Sumshttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java#day-15
Maximum Side Length of a Square with Sum Less than or Equal to Thresholdhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java#day-16
Time Based Key-Value Storehttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java#day-17
Maximum Value at a Given Index in a Bounded Arrayhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1901_find_a_peak_element_ii/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-18
Snapshot Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1146_snapshot_array/SnapshotArray.java
Avoid Flood in The Cityhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1488_avoid_flood_in_the_city/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-19
Find Latest Group of Size Mhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1648_sell_diminishing_valued_colored_balls/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-20
Ugly Number IIIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1201_ugly_number_iii/Solution.java
Online Electionhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0911_online_election/TopVotedCandidate.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#dynamic-programming-i
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-1-2
Fibonacci Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0509_fibonacci_number/Solution.java
N-th Tribonacci Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1137_n_th_tribonacci_number/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-2-2
Climbing Stairshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0070_climbing_stairs/Solution.java
Min Cost Climbing Stairshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0746_min_cost_climbing_stairs/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-3-2
House Robberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0198_house_robber/Solution.java
House Robber IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0213_house_robber_ii/Solution.java
Delete and Earnhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0740_delete_and_earn/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-4-2
Jump Gamehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0055_jump_game/Solution.java
Jump Game IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0045_jump_game_ii/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-5-2
Maximum Subarrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0053_maximum_subarray/Solution.java
Maximum Sum Circular Subarrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0918_maximum_sum_circular_subarray/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-6-2
Maximum Product Subarrayhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java#day-7-2
Best Sightseeing Pairhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java#day-8-2
Best Time to Buy and Sell Stock with Cooldownhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java#day-9-2
Word Breakhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0139_word_break/Solution.java
Trapping Rain Waterhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0042_trapping_rain_water/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-10-2
Arithmetic Sliceshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0413_arithmetic_slices/Solution.java
Decode Wayshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0091_decode_ways/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-11-2
Ugly Number IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0264_ugly_number_ii/Solution.java
Unique Binary Search Treeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0096_unique_binary_search_trees/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-12-2
Pascal's Trianglehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0118_pascals_triangle/Solution.java
Pascal's Triangle IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0119_pascals_triangle_ii/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-13-1
Minimum Falling Path Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0931_minimum_falling_path_sum/Solution.java
Trianglehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0120_triangle/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-14-1
Matrix Block Sumhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0304_range_sum_query_2d_immutable/NumMatrix.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-15-1
Unique Pathshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0062_unique_paths/Solution.java
Unique Paths IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0063_unique_paths_ii/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-16-1
Minimum Path Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0064_minimum_path_sum/Solution.java
Maximal Squarehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0221_maximal_square/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-17-1
Longest Palindromic Substringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0005_longest_palindromic_substring/Solution.java
Longest Palindromic Subsequencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0516_longest_palindromic_subsequence/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-18-1
Longest Increasing Subsequencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0300_longest_increasing_subsequence/Solution.java
Wiggle Subsequencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0376_wiggle_subsequence/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-19-1
Is Subsequencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0392_is_subsequence/Solution.java
Longest Common Subsequencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java
Edit Distancehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0072_edit_distance/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-20-1
Coin Changehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0322_coin_change/Solution.java
Coin Change 2https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0518_coin_change_2/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-21
Combination Sum IVhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0377_combination_sum_iv/Solution.java
Integer Breakhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0343_integer_break/Solution.java
Perfect Squareshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0279_perfect_squares/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#programming-skills-i
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-1-basic-data-type
Count Odd Numbers in an Interval Rangehttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java#day-2-operator
Number of 1 Bitshttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java#day-3-conditional-statements
Largest Perimeter Trianglehttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java#day-4-loop
Sign of the Product of an Arrayhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java#day-5-function
N-ary Tree Preorder Traversalhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java#day-6-array
Sum of All Odd Length Subarrayshttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0283_move_zeroes/Solution.java
Richest Customer Wealthhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1672_richest_customer_wealth/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-7-array
Matrix Diagonal Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1572_matrix_diagonal_sum/Solution.java
Reshape the Matrixhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0566_reshape_the_matrix/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-8-string-1
Merge Strings Alternatelyhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1768_merge_strings_alternately/Solution.java
Goal Parser Interpretationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1678_goal_parser_interpretation/Solution.java
Find the Differencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0389_find_the_difference/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-9-string-1
To Lower Casehttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0953_verifying_an_alien_dictionary/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-10-linked-list-and-tree
Convert Binary Number in a Linked List to Integerhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0404_sum_of_left_leaves/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-11-containers-and-libraries
Sort Integers by The Number of 1 Bitshttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0232_implement_queue_using_stacks/MyQueue.java
Valid Anagramhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0242_valid_anagram/Solution.java
Contains Duplicatehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0217_contains_duplicate/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-12-class-and-object
Design Parking Systemhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1603_design_parking_system/ParkingSystem.java
Range Sum Query - Immutablehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0303_range_sum_query_immutable/NumArray.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#programming-skills-ii
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-1-3
Monotonic Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0896_monotonic_array/Solution.java
Implement strStr()https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0028_implement_strstr/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-2-3
Balanced Binary Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0110_balanced_binary_tree/Solution.java
Repeated Substring Patternhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0459_repeated_substring_pattern/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-3-3
Evaluate Reverse Polish Notationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0150_evaluate_reverse_polish_notation/Solution.java
Plus Onehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0066_plus_one/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-4-3
Linked List in Binary Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1367_linked_list_in_binary_tree/Solution.java
Multiply Stringshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0043_multiply_strings/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-5-3
Add Binaryhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0989_add_to_array_form_of_integer/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-6-3
Daily Temperatureshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0739_daily_temperatures/Solution.java
Length of Last Wordhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0058_length_of_last_word/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-7-3
Rotate Imagehttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java#day-8-3
Spiral Matrixhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0054_spiral_matrix/Solution.java
K Closest Points to Originhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0973_k_closest_points_to_origin/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-9-3
Arithmetic Subarrayshttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0429_n_ary_tree_level_order_traversal/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-10-3
Next Greater Element IIhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0556_next_greater_element_iii/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-11-3
Time Needed to Inform All Employeeshttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0049_group_anagrams/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-12-3
Find All Anagrams in a Stringhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0713_subarray_product_less_than_k/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-13-2
Range Sum Query 2D - Immutablehttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0910_smallest_range_ii/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-14-2
Reorder Listhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0143_reorder_list/Solution.java
Copy List with Random Pointerhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0138_copy_list_with_random_pointer/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-15-2
Add Two Numbershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0002_add_two_numbers/Solution.java
Add Two Numbers IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0445_add_two_numbers_ii/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-16-2
Rotate Listhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0061_rotate_list/Solution.java
Binary Search Tree Iteratorhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0173_binary_search_tree_iterator/BSTIterator.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-17-2
Seat Reservation Managerhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1845_seat_reservation_manager/SeatManager.java
Lemonade Changehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0860_lemonade_change/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-18-2
Min Stackhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0155_min_stack/MinStack.java
Flatten Nested List Iteratorhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0341_flatten_nested_list_iterator/NestedIterator.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-19-2
Design Authentication Managerhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1797_design_authentication_manager/AuthenticationManager.java
Design Linked Listhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0707_design_linked_list/MyLinkedList.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-20-2
Insert Delete GetRandom O(1)https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0380_insert_delete_getrandom_o1/RandomizedSet.java
Design Circular Queuehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0622_design_circular_queue/MyCircularQueue.java
My Calendar Ihttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0729_my_calendar_i/MyCalendar.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#graph-theory-i
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-1-matrix-related-problems
Flood Fillhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0733_flood_fill/Solution.java
Number of Islandshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0200_number_of_islands/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-2-matrix-related-problems
Max Area of Islandhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1254_number_of_closed_islands/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-3-matrix-related-problems
Number of Enclaveshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1020_number_of_enclaves/Solution.java
Count Sub Islandshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1905_count_sub_islands/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-4-matrix-related-problems
As Far from Land as Possiblehttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0417_pacific_atlantic_water_flow/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-5-matrix-related-problems
Shortest Path in Binary Matrixhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1091_shortest_path_in_binary_matrix/Solution.java
01 Matrixhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0542_01_matrix/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-6-matrix-related-problems
Shortest Bridgehttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1926_nearest_exit_from_entrance_in_maze/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-7-standard-traversal
All Paths From Source to Targethttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0841_keys_and_rooms/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-8-standard-traversal
Number of Provinceshttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java#day-9-standard-traversal
Time Needed to Inform All Employeeshttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0802_find_eventual_safe_states/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-10-standard-traversal
Shortest Path with Alternating Colorshttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0847_shortest_path_visiting_all_nodes/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-11-breadth-first-search
Jump Game IIIhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0365_water_and_jug_problem/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-12-breadth-first-search
Minimum Genetic Mutationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0433_minimum_genetic_mutation/Solution.java
Open the Lockhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0752_open_the_lock/Solution.java
Word Ladderhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0127_word_ladder/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-13-graph-theory
Find the Town Judgehttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java#day-14-graph-theory
Maximal Network Rankhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1615_maximal_network_rank/Solution.java
Possible Bipartitionhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0886_possible_bipartition/Solution.java
Is Graph Bipartite?https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0785_is_graph_bipartite/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#sql-i
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-1-select
Big Countrieshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0595_big_countries/script.sql
Recyclable and Low Fat Productshttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0584_find_customer_referee/script.sql
Customers Who Never Orderhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0183_customers_who_never_order/script.sql
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-2-select-and-order
Calculate Special Bonushttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1873_calculate_special_bonus/script.sql
Swap Salaryhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0627_swap_salary/script.sql
Delete Duplicate Emailshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0196_delete_duplicate_emails/script.sql
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-3-string-processing-functions
Fix Names in a Tablehttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1527_patients_with_a_condition/script.sql
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-4-union-and-select
Employees With Missing Informationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1965_employees_with_missing_information/script.sql
Rearrange Products Tablehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1795_rearrange_products_table/script.sql
Tree Nodehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0608_tree_node/script.sql
Second Highest Salaryhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0176_second_highest_salary/script.sql
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-5-union
Combine Two Tableshttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1148_article_views_i/script.sql
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-6-union
Rising Temperaturehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0197_rising_temperature/script.sql
Sales Personhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0607_sales_person/script.sql
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-7-function
User Activity for the Past 30 Days Ihttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1693_daily_leads_and_partners/script.sql
Find Followers Counthttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1729_find_followers_count/script.sql
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-8-function
Customer Placing the Largest Number of Ordershttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java#day-9-control-of-flow
Capital Gain/Losshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1393_capital_gainloss/script.sql
Top Travellershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1407_top_travellers/script.sql
Market Analysis Ihttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1158_market_analysis_i/script.sql
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-10-where
Duplicate Emailshttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1587_bank_account_summary_ii/script.sql
Sales Analysis IIIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1084_sales_analysis_iii/script.sql
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#level-1
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-1-prefix-sum
Running Sum of 1d Arrayhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0724_find_pivot_index/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-2-string
Isomorphic Stringshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0205_isomorphic_strings/Solution.java
Is Subsequencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0392_is_subsequence/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-3-linked-list
Merge Two Sorted Listshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0021_merge_two_sorted_lists/Solution.java
Reverse Linked Listhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0206_reverse_linked_list/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-4-linked-list
Middle of the Linked Listhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0142_linked_list_cycle_ii/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-5-greedy
Best Time to Buy and Sell Stockhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0409_longest_palindrome/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-6-tree
N-ary Tree Preorder Traversalhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-7-binary-search
Binary Searchhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0704_binary_search/Solution.java
First Bad Versionhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0278_first_bad_version/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-8-binary-search-tree
Validate Binary Search Treehttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/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/pekumar7/LeetCode-in-Java#day-9-graphbfsdfs
Flood Fillhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0733_flood_fill/Solution.java
Number of Islandshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0200_number_of_islands/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-10-dynamic-programming
Fibonacci Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0509_fibonacci_number/Solution.java
Climbing Stairshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0070_climbing_stairs/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-11-dynamic-programming
Min Cost Climbing Stairshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0746_min_cost_climbing_stairs/Solution.java
Unique Pathshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0062_unique_paths/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-12-sliding-windowtwo-pointer
Find All Anagrams in a Stringhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0424_longest_repeating_character_replacement/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-13-hashmap
Two Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0001_two_sum/Solution.java
Bulls and Cowshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0299_bulls_and_cows/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-14-stack
Backspace String Comparehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0844_backspace_string_compare/Solution.java
Decode Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0394_decode_string/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#day-15-heap
Last Stone Weighthttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1046_last_stone_weight/Solution.java
Top K Frequent Wordshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0692_top_k_frequent_words/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#algorithms
Count Unreachable Pairs of Nodes in an Undirected Graphhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2301_2400/s2316_count_unreachable_pairs_of_nodes_in_an_undirected_graph/Solution.java
Count Asteriskshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2301_2400/s2315_count_asterisks/Solution.java
Selling Pieces of Woodhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2301_2400/s2312_selling_pieces_of_wood/Solution.java
Longest Binary Subsequence Less Than or Equal to Khttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2301_2400/s2311_longest_binary_subsequence_less_than_or_equal_to_k/Solution.java
Sum of Numbers With Units Digit Khttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2301_2400/s2310_sum_of_numbers_with_units_digit_k/Solution.java
Greatest English Letter in Upper and Lower Casehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2301_2400/s2309_greatest_english_letter_in_upper_and_lower_case/Solution.java
Naming a Companyhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2301_2400/s2306_naming_a_company/Solution.java
Fair Distribution of Cookieshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2301_2400/s2305_fair_distribution_of_cookies/Solution.java
Minimum Path Cost in a Gridhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2301_2400/s2304_minimum_path_cost_in_a_grid/Solution.java
Calculate Amount Paid in Taxeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2301_2400/s2303_calculate_amount_paid_in_taxes/Solution.java
Count Subarrays With Score Less Than Khttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2301_2400/s2302_count_subarrays_with_score_less_than_k/Solution.java
Match Substring After Replacementhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2301_2400/s2301_match_substring_after_replacement/Solution.java
Successful Pairs of Spells and Potionshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2300_successful_pairs_of_spells_and_potions/Solution.java
Strong Password Checker IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2299_strong_password_checker_ii/Solution.java
Design a Text Editorhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2296_design_a_text_editor/TextEditor.java
Replace Elements in an Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2295_replace_elements_in_an_array/Solution.java
Partition Array Such That Maximum Difference Is Khttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2294_partition_array_such_that_maximum_difference_is_k/Solution.java
Min Max Gamehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2293_min_max_game/Solution.java
Minimum Obstacle Removal to Reach Cornerhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2290_minimum_obstacle_removal_to_reach_corner/Solution.java
Steps to Make Array Non-decreasinghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2289_steps_to_make_array_non_decreasing/Solution.java
Apply Discount to Priceshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2288_apply_discount_to_prices/Solution.java
Rearrange Characters to Make Target Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2287_rearrange_characters_to_make_target_string/Solution.java
Booking Concert Tickets in Groupshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2286_booking_concert_tickets_in_groups/BookMyShow.java
Maximum Total Importance of Roadshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2285_maximum_total_importance_of_roads/Solution.java
Sender With Largest Word Counthttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2284_sender_with_largest_word_count/Solution.java
Check if Number Has Equal Digit Count and Digit Valuehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2283_check_if_number_has_equal_digit_count_and_digit_value/Solution.java
Sum of Total Strength of Wizardshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2281_sum_of_total_strength_of_wizards/Solution.java
Minimum Lines to Represent a Line Charthttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2280_minimum_lines_to_represent_a_line_chart/Solution.java
Maximum Bags With Full Capacity of Rockshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2279_maximum_bags_with_full_capacity_of_rocks/Solution.java
Percentage of Letter in Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2278_percentage_of_letter_in_string/Solution.java
Count Integers in Intervalshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2276_count_integers_in_intervals/CountIntervals.java
Largest Combination With Bitwise AND Greater Than Zerohttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2275_largest_combination_with_bitwise_and_greater_than_zero/Solution.java
Maximum Consecutive Floors Without Special Floorshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2274_maximum_consecutive_floors_without_special_floors/Solution.java
Find Resultant Array After Removing Anagramshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2273_find_resultant_array_after_removing_anagrams/Solution.java
Substring With Largest Variancehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2272_substring_with_largest_variance/Solution.java
Maximum White Tiles Covered by a Carpethttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2271_maximum_white_tiles_covered_by_a_carpet/Solution.java
Number of Ways to Split Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2270_number_of_ways_to_split_array/Solution.java
Find the K-Beauty of a Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2269_find_the_k_beauty_of_a_number/Solution.java
Check if There Is a Valid Parentheses String Pathhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2267_check_if_there_is_a_valid_parentheses_string_path/Solution.java
Count Number of Textshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2266_count_number_of_texts/Solution.java
Count Nodes Equal to Average of Subtreehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2265_count_nodes_equal_to_average_of_subtree/Solution.java
Largest 3-Same-Digit Number in Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2264_largest_3_same_digit_number_in_string/Solution.java
Total Appeal of A Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2262_total_appeal_of_a_string/Solution.java
K Divisible Elements Subarrayshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2261_k_divisible_elements_subarrays/Solution.java
Minimum Consecutive Cards to Pick Uphttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2260_minimum_consecutive_cards_to_pick_up/Solution.java
Remove Digit From Number to Maximize Resulthttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2259_remove_digit_from_number_to_maximize_result/Solution.java
Escape the Spreading Firehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2258_escape_the_spreading_fire/Solution.java
Count Unguarded Cells in the Gridhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2257_count_unguarded_cells_in_the_grid/Solution.java
Minimum Average Differencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2256_minimum_average_difference/Solution.java
Count Prefixes of a Given Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2255_count_prefixes_of_a_given_string/Solution.java
Number of Flowers in Full Bloomhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2251_number_of_flowers_in_full_bloom/Solution.java
Count Number of Rectangles Containing Each Pointhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2250_count_number_of_rectangles_containing_each_point/Solution.java
Count Lattice Points Inside a Circlehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2249_count_lattice_points_inside_a_circle/Solution.java
Intersection of Multiple Arrayshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2248_intersection_of_multiple_arrays/Solution.java
Longest Path With Different Adjacent Charactershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2246_longest_path_with_different_adjacent_characters/Solution.java
Maximum Trailing Zeros in a Cornered Pathhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2245_maximum_trailing_zeros_in_a_cornered_path/Solution.java
Minimum Rounds to Complete All Taskshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2244_minimum_rounds_to_complete_all_tasks/Solution.java
Calculate Digit Sum of a Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2243_calculate_digit_sum_of_a_string/Solution.java
Maximum Score of a Node Sequencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2242_maximum_score_of_a_node_sequence/Solution.java
Design an ATM Machinehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2241_design_an_atm_machine/ATM.java
Number of Ways to Buy Pens and Pencilshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2240_number_of_ways_to_buy_pens_and_pencils/Solution.java
Find Closest Number to Zerohttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2239_find_closest_number_to_zero/Solution.java
Root Equals Sum of Childrenhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2236_root_equals_sum_of_children/Solution.java
Add Two Integershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2235_add_two_integers/Solution.java
Maximum Total Beauty of the Gardenshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2234_maximum_total_beauty_of_the_gardens/Solution.java
Maximum Product After K Incrementshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2233_maximum_product_after_k_increments/Solution.java
Minimize Result by Adding Parentheses to Expressionhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2232_minimize_result_by_adding_parentheses_to_expression/Solution.java
Largest Number After Digit Swaps by Parityhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2231_largest_number_after_digit_swaps_by_parity/Solution.java
Encrypt and Decrypt Stringshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2227_encrypt_and_decrypt_strings/Encrypter.java
Maximum Candies Allocated to K Childrenhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2226_maximum_candies_allocated_to_k_children/Solution.java
Find Players With Zero or One Losseshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2225_find_players_with_zero_or_one_losses/Solution.java
Minimum Number of Operations to Convert Timehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2224_minimum_number_of_operations_to_convert_time/Solution.java
Sum of Scores of Built Stringshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2223_sum_of_scores_of_built_strings/Solution.java
Number of Ways to Select Buildingshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2222_number_of_ways_to_select_buildings/Solution.java
Find Triangular Sum of an Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2221_find_triangular_sum_of_an_array/Solution.java
Minimum Bit Flips to Convert Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2220_minimum_bit_flips_to_convert_number/Solution.java
Maximum Value of K Coins From Pileshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2218_maximum_value_of_k_coins_from_piles/Solution.java
Find Palindrome With Fixed Lengthhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2217_find_palindrome_with_fixed_length/Solution.java
Minimum Deletions to Make Array Beautifulhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2216_minimum_deletions_to_make_array_beautiful/Solution.java
Find the Difference of Two Arrayshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2215_find_the_difference_of_two_arrays/Solution.java
Longest Substring of One Repeating Characterhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2213_longest_substring_of_one_repeating_character/Solution.java
Maximum Points in an Archery Competitionhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2212_maximum_points_in_an_archery_competition/Solution.java
Count Collisions on a Roadhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2211_count_collisions_on_a_road/Solution.java
Count Hills and Valleys in an Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2210_count_hills_and_valleys_in_an_array/Solution.java
Minimum White Tiles After Covering With Carpetshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2209_minimum_white_tiles_after_covering_with_carpets/Solution.java
Minimum Operations to Halve Array Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2208_minimum_operations_to_halve_array_sum/Solution.java
Maximize Number of Subsequences in a Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2207_maximize_number_of_subsequences_in_a_string/Solution.java
Divide Array Into Equal Pairshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2206_divide_array_into_equal_pairs/Solution.java
Minimum Weighted Subgraph With the Required Pathshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2203_minimum_weighted_subgraph_with_the_required_paths/Solution.java
Maximize the Topmost Element After K Moveshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2202_maximize_the_topmost_element_after_k_moves/Solution.java
Count Artifacts That Can Be Extractedhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2201_2300/s2201_count_artifacts_that_can_be_extracted/Solution.java
Find All K-Distant Indices in an Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2200_find_all_k_distant_indices_in_an_array/Solution.java
Replace Non-Coprime Numbers in Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2197_replace_non_coprime_numbers_in_array/Solution.java
Create Binary Tree From Descriptionshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2196_create_binary_tree_from_descriptions/Solution.java
Append K Integers With Minimal Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2195_append_k_integers_with_minimal_sum/Solution.java
Cells in a Range on an Excel Sheethttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2194_cells_in_a_range_on_an_excel_sheet/Solution.java
Minimum Number of Moves to Make Palindromehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2193_minimum_number_of_moves_to_make_palindrome/Solution.java
All Ancestors of a Node in a Directed Acyclic Graphhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2192_all_ancestors_of_a_node_in_a_directed_acyclic_graph/Solution.java
Sort the Jumbled Numbershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2191_sort_the_jumbled_numbers/Solution.java
Most Frequent Number Following Key In an Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2190_most_frequent_number_following_key_in_an_array/Solution.java
Minimum Time to Finish the Racehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2188_minimum_time_to_finish_the_race/Solution.java
Minimum Time to Complete Tripshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2187_minimum_time_to_complete_trips/Solution.java
Minimum Number of Steps to Make Two Strings Anagram IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2186_minimum_number_of_steps_to_make_two_strings_anagram_ii/Solution.java
Counting Words With a Given Prefixhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2185_counting_words_with_a_given_prefix/Solution.java
Count Array Pairs Divisible by Khttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2183_count_array_pairs_divisible_by_k/Solution.java
Construct String With Repeat Limithttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2182_construct_string_with_repeat_limit/Solution.java
Merge Nodes in Between Zeroshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2181_merge_nodes_in_between_zeros/Solution.java
Count Integers With Even Digit Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2180_count_integers_with_even_digit_sum/Solution.java
Count Good Triplets in an Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2179_count_good_triplets_in_an_array/Solution.java
Maximum Split of Positive Even Integershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2178_maximum_split_of_positive_even_integers/Solution.java
Find Three Consecutive Integers That Sum to a Given Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2177_find_three_consecutive_integers_that_sum_to_a_given_number/Solution.java
Count Equal and Divisible Pairs in an Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2176_count_equal_and_divisible_pairs_in_an_array/Solution.java
Maximum AND Sum of Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2172_maximum_and_sum_of_array/Solution.java
Removing Minimum Number of Magic Beanshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2171_removing_minimum_number_of_magic_beans/Solution.java
Minimum Operations to Make the Array Alternatinghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2170_minimum_operations_to_make_the_array_alternating/Solution.java
Count Operations to Obtain Zerohttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2169_count_operations_to_obtain_zero/Solution.java
Minimum Time to Remove All Cars Containing Illegal Goodshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2167_minimum_time_to_remove_all_cars_containing_illegal_goods/Solution.java
Design Bitsethttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2166_design_bitset/Bitset.java
Smallest Value of the Rearranged Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2165_smallest_value_of_the_rearranged_number/Solution.java
Sort Even and Odd Indices Independentlyhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2164_sort_even_and_odd_indices_independently/Solution.java
Minimum Difference in Sums After Removal of Elementshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2163_minimum_difference_in_sums_after_removal_of_elements/Solution.java
Minimum Cost to Set Cooking Timehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2162_minimum_cost_to_set_cooking_time/Solution.java
Partition Array According to Given Pivothttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2161_partition_array_according_to_given_pivot/Solution.java
Minimum Sum of Four Digit Number After Splitting Digitshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2160_minimum_sum_of_four_digit_number_after_splitting_digits/Solution.java
Groups of Stringshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2157_groups_of_strings/Solution.java
Find Substring With Given Hash Valuehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2156_find_substring_with_given_hash_value/Solution.java
All Divisions With the Highest Score of a Binary Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2155_all_divisions_with_the_highest_score_of_a_binary_array/Solution.java
Keep Multiplying Found Values by Twohttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2154_keep_multiplying_found_values_by_two/Solution.java
Maximum Good People Based on Statementshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2151_maximum_good_people_based_on_statements/Solution.java
Find All Lonely Numbers in the Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2150_find_all_lonely_numbers_in_the_array/Solution.java
Rearrange Array Elements by Signhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2149_rearrange_array_elements_by_sign/Solution.java
Count Elements With Strictly Smaller and Greater Elementshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2148_count_elements_with_strictly_smaller_and_greater_elements/Solution.java
Number of Ways to Divide a Long Corridorhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2147_number_of_ways_to_divide_a_long_corridor/Solution.java
K Highest Ranked Items Within a Price Rangehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2146_k_highest_ranked_items_within_a_price_range/Solution.java
Count the Hidden Sequenceshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2145_count_the_hidden_sequences/Solution.java
Minimum Cost of Buying Candies With Discounthttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2144_minimum_cost_of_buying_candies_with_discount/Solution.java
Maximum Running Time of N Computershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2141_maximum_running_time_of_n_computers/Solution.java
Solving Questions With Brainpowerhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2140_solving_questions_with_brainpower/Solution.java
Minimum Moves to Reach Target Scorehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2139_minimum_moves_to_reach_target_score/Solution.java
Divide a String Into Groups of Size khttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2138_divide_a_string_into_groups_of_size_k/Solution.java
Earliest Possible Day of Full Bloomhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2136_earliest_possible_day_of_full_bloom/Solution.java
Count Words Obtained After Adding a Letterhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2135_count_words_obtained_after_adding_a_letter/Solution.java
Minimum Swaps to Group All 1's Together IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2134_minimum_swaps_to_group_all_1s_together_ii/Solution.java
Check if Every Row and Column Contains All Numbershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2133_check_if_every_row_and_column_contains_all_numbers/Solution.java
Stamping the Gridhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2132_stamping_the_grid/Solution.java
Longest Palindrome by Concatenating Two Letter Wordshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2131_longest_palindrome_by_concatenating_two_letter_words/Solution.java
Maximum Twin Sum of a Linked Listhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2130_maximum_twin_sum_of_a_linked_list/Solution.java
Capitalize the Titlehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2129_capitalize_the_title/Solution.java
Maximum Employees to Be Invited to a Meetinghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2127_maximum_employees_to_be_invited_to_a_meeting/Solution.java
Destroying Asteroidshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2126_destroying_asteroids/Solution.java
Number of Laser Beams in a Bankhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2125_number_of_laser_beams_in_a_bank/Solution.java
Check if All A's Appears Before All B'shttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2124_check_if_all_as_appears_before_all_bs/Solution.java
Recover the Original Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2122_recover_the_original_array/Solution.java
Intervals Between Identical Elementshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2121_intervals_between_identical_elements/Solution.java
Execution of All Suffix Instructions Staying in a Gridhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2120_execution_of_all_suffix_instructions_staying_in_a_grid/Solution.java
A Number After a Double Reversalhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2119_a_number_after_a_double_reversal/Solution.java
Abbreviating the Product of a Rangehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2117_abbreviating_the_product_of_a_range/Solution.java
Check if a Parentheses String Can Be Validhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2116_check_if_a_parentheses_string_can_be_valid/Solution.java
Find All Possible Recipes from Given Supplieshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2115_find_all_possible_recipes_from_given_supplies/Solution.java
Maximum Number of Words Found in Sentenceshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2114_maximum_number_of_words_found_in_sentences/Solution.java
Minimum Operations to Make the Array K-Increasinghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2111_minimum_operations_to_make_the_array_k_increasing/Solution.java
Number of Smooth Descent Periods of a Stockhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2110_number_of_smooth_descent_periods_of_a_stock/Solution.java
Adding Spaces to a Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2109_adding_spaces_to_a_string/Solution.java
Find First Palindromic String in the Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2108_find_first_palindromic_string_in_the_array/Solution.java
Maximum Fruits Harvested After at Most K Stepshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2106_maximum_fruits_harvested_after_at_most_k_steps/Solution.java
Watering Plants IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2105_watering_plants_ii/Solution.java
Sum of Subarray Rangeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2104_sum_of_subarray_ranges/Solution.java
Rings and Rodshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2103_rings_and_rods/Solution.java
Sequentially Ordinal Rank Trackerhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2102_sequentially_ordinal_rank_tracker/SORTracker.java
Detonate the Maximum Bombshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2101_2200/s2101_detonate_the_maximum_bombs/Solution.java
Find Good Days to Rob the Bankhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2100_find_good_days_to_rob_the_bank/Solution.java
Find Subsequence of Length K With the Largest Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2099_find_subsequence_of_length_k_with_the_largest_sum/Solution.java
Valid Arrangement of Pairshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2097_valid_arrangement_of_pairs/Solution.java
Step-By-Step Directions From a Binary Tree Node to Anotherhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2096_step_by_step_directions_from_a_binary_tree_node_to_another/Solution.java
Delete the Middle Node of a Linked Listhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2095_delete_the_middle_node_of_a_linked_list/Solution.java
Finding 3-Digit Even Numbershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2094_finding_3_digit_even_numbers/Solution.java
Find All People With Secrethttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2092_find_all_people_with_secret/Solution.java
Removing Minimum and Maximum From Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2091_removing_minimum_and_maximum_from_array/Solution.java
K Radius Subarray Averageshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2090_k_radius_subarray_averages/Solution.java
Find Target Indices After Sorting Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2089_find_target_indices_after_sorting_array/Solution.java
Count Fertile Pyramids in a Landhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2088_count_fertile_pyramids_in_a_land/Solution.java
Minimum Cost Homecoming of a Robot in a Gridhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2087_minimum_cost_homecoming_of_a_robot_in_a_grid/Solution.java
Minimum Number of Buckets Required to Collect Rainwater from Houseshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2086_minimum_number_of_buckets_required_to_collect_rainwater_from_houses/Solution.java
Count Common Words With One Occurrencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2085_count_common_words_with_one_occurrence/Solution.java
Sum of k-Mirror Numbershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2081_sum_of_k_mirror_numbers/Solution.java
Range Frequency Querieshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2080_range_frequency_queries/RangeFreqQuery.java
Watering Plantshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2079_watering_plants/Solution.java
Two Furthest Houses With Different Colorshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2078_two_furthest_houses_with_different_colors/Solution.java
Process Restricted Friend Requestshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2076_process_restricted_friend_requests/Solution.java
Decode the Slanted Ciphertexthttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2075_decode_the_slanted_ciphertext/Solution.java
Reverse Nodes in Even Length Groupshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2074_reverse_nodes_in_even_length_groups/Solution.java
Time Needed to Buy Ticketshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2073_time_needed_to_buy_tickets/Solution.java
Maximum Number of Tasks You Can Assignhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2071_maximum_number_of_tasks_you_can_assign/Solution.java
Most Beautiful Item for Each Queryhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2070_most_beautiful_item_for_each_query/Solution.java
Walking Robot Simulation IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2069_walking_robot_simulation_ii/Robot.java
Check Whether Two Strings are Almost Equivalenthttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2068_check_whether_two_strings_are_almost_equivalent/Solution.java
Maximum Path Quality of a Graphhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2065_maximum_path_quality_of_a_graph/Solution.java
Minimized Maximum of Products Distributed to Any Storehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2064_minimized_maximum_of_products_distributed_to_any_store/Solution.java
Vowels of All Substringshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2063_vowels_of_all_substrings/Solution.java
Count Vowel Substrings of a Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2062_count_vowel_substrings_of_a_string/Solution.java
Check if an Original String Exists Given Two Encoded Stringshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2060_check_if_an_original_string_exists_given_two_encoded_strings/Solution.java
Minimum Operations to Convert Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2059_minimum_operations_to_convert_number/Solution.java
Find the Minimum and Maximum Number of Nodes Between Critical Pointshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2058_find_the_minimum_and_maximum_number_of_nodes_between_critical_points/Solution.java
Smallest Index With Equal Valuehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2057_smallest_index_with_equal_value/Solution.java
Number of Valid Move Combinations On Chessboardhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2056_number_of_valid_move_combinations_on_chessboard/Solution.java
Plates Between Candleshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2055_plates_between_candles/Solution.java
Two Best Non-Overlapping Eventshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2054_two_best_non_overlapping_events/Solution.java
Kth Distinct String in an Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2053_kth_distinct_string_in_an_array/Solution.java
Parallel Courses IIIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2050_parallel_courses_iii/Solution.java
Count Nodes With the Highest Scorehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2049_count_nodes_with_the_highest_score/Solution.java
Next Greater Numerically Balanced Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2048_next_greater_numerically_balanced_number/Solution.java
Number of Valid Words in a Sentencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2047_number_of_valid_words_in_a_sentence/Solution.java
Second Minimum Time to Reach Destinationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2045_second_minimum_time_to_reach_destination/Solution.java
Count Number of Maximum Bitwise-OR Subsetshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2044_count_number_of_maximum_bitwise_or_subsets/Solution.java
Simple Bank Systemhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2043_simple_bank_system/Bank.java
Check if Numbers Are Ascending in a Sentencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2042_check_if_numbers_are_ascending_in_a_sentence/Solution.java
Kth Smallest Product of Two Sorted Arrayshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2040_kth_smallest_product_of_two_sorted_arrays/Solution.java
The Time When the Network Becomes Idlehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2039_the_time_when_the_network_becomes_idle/Solution.java
Remove Colored Pieces if Both Neighbors are the Same Colorhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2038_remove_colored_pieces_if_both_neighbors_are_the_same_color/Solution.java
Minimum Number of Moves to Seat Everyonehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2037_minimum_number_of_moves_to_seat_everyone/Solution.java
Partition Array Into Two Arrays to Minimize Sum Differencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2035_partition_array_into_two_arrays_to_minimize_sum_difference/Solution.java
Stock Price Fluctuationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2034_stock_price_fluctuation/StockPrice.java
Minimum Operations to Make a Uni-Value Gridhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2033_minimum_operations_to_make_a_uni_value_grid/Solution.java
Two Out of Threehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2032_two_out_of_three/Solution.java
Smallest K-Length Subsequence With Occurrences of a Letterhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2030_smallest_k_length_subsequence_with_occurrences_of_a_letter/Solution.java
Stone Game IXhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2029_stone_game_ix/Solution.java
Find Missing Observationshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2028_find_missing_observations/Solution.java
Minimum Moves to Convert Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2027_minimum_moves_to_convert_string/Solution.java
Maximum Number of Ways to Partition an Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2025_maximum_number_of_ways_to_partition_an_array/Solution.java
Maximize the Confusion of an Examhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2024_maximize_the_confusion_of_an_exam/Solution.java
Number of Pairs of Strings With Concatenation Equal to Targethttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2023_number_of_pairs_of_strings_with_concatenation_equal_to_target/Solution.java
Convert 1D Array Into 2D Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2022_convert_1d_array_into_2d_array/Solution.java
The Score of Students Solving Math Expressionhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2019_the_score_of_students_solving_math_expression/Solution.java
Check if Word Can Be Placed In Crosswordhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2018_check_if_word_can_be_placed_in_crossword/Solution.java
Grid Gamehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2017_grid_game/Solution.java
Maximum Difference Between Increasing Elementshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2016_maximum_difference_between_increasing_elements/Solution.java
Longest Subsequence Repeated k Timeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2014_longest_subsequence_repeated_k_times/Solution.java
Detect Squareshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2013_detect_squares/DetectSquares.java
Sum of Beauty in the Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2012_sum_of_beauty_in_the_array/Solution.java
Final Value of Variable After Performing Operationshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2011_final_value_of_variable_after_performing_operations/Solution.java
Minimum Number of Operations to Make Array Continuoushttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2009_minimum_number_of_operations_to_make_array_continuous/Solution.java
Maximum Earnings From Taxihttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2008_maximum_earnings_from_taxi/Solution.java
Find Original Array From Doubled Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2007_find_original_array_from_doubled_array/Solution.java
Count Number of Pairs With Absolute Difference Khttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2006_count_number_of_pairs_with_absolute_difference_k/Solution.java
Smallest Missing Genetic Value in Each Subtreehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2003_smallest_missing_genetic_value_in_each_subtree/Solution.java
Maximum Product of the Length of Two Palindromic Subsequenceshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2002_maximum_product_of_the_length_of_two_palindromic_subsequences/Solution.java
Number of Pairs of Interchangeable Rectangleshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g2001_2100/s2001_number_of_pairs_of_interchangeable_rectangles/Solution.java
Reverse Prefix of Wordhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s2000_reverse_prefix_of_word/Solution.java
GCD Sort of an Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1998_gcd_sort_of_an_array/Solution.java
First Day Where You Have Been in All the Roomshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1997_first_day_where_you_have_been_in_all_the_rooms/Solution.java
The Number of Weak Characters in the Gamehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1996_the_number_of_weak_characters_in_the_game/Solution.java
Count Special Quadrupletshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1995_count_special_quadruplets/Solution.java
The Number of Good Subsetshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1994_the_number_of_good_subsets/Solution.java
Operations on Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1993_operations_on_tree/LockingTree.java
Find All Groups of Farmlandhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1992_find_all_groups_of_farmland/Solution.java
Find the Middle Index in Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1991_find_the_middle_index_in_array/Solution.java
Number of Unique Good Subsequenceshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1987_number_of_unique_good_subsequences/Solution.java
Minimum Number of Work Sessions to Finish the Taskshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1986_minimum_number_of_work_sessions_to_finish_the_tasks/Solution.java
Find the Kth Largest Integer in the Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1985_find_the_kth_largest_integer_in_the_array/Solution.java
Minimum Difference Between Highest and Lowest of K Scoreshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1984_minimum_difference_between_highest_and_lowest_of_k_scores/Solution.java
Find Array Given Subset Sumshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1982_find_array_given_subset_sums/Solution.java
Minimize the Difference Between Target and Chosen Elementshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1981_minimize_the_difference_between_target_and_chosen_elements/Solution.java
Find Unique Binary Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1980_find_unique_binary_string/Solution.java
Find Greatest Common Divisor of Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1979_find_greatest_common_divisor_of_array/Solution.java
Number of Ways to Separate Numbershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1977_number_of_ways_to_separate_numbers/Solution.java
Number of Ways to Arrive at Destinationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1976_number_of_ways_to_arrive_at_destination/Solution.java
Maximum Matrix Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1975_maximum_matrix_sum/Solution.java
Minimum Time to Type Word Using Special Typewriterhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1974_minimum_time_to_type_word_using_special_typewriter/Solution.java
Find if Path Exists in Graphhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1971_find_if_path_exists_in_graph/Solution.java
Last Day Where You Can Still Crosshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1970_last_day_where_you_can_still_cross/Solution.java
Minimum Non-Zero Product of the Array Elementshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1969_minimum_non_zero_product_of_the_array_elements/Solution.java
Array With Elements Not Equal to Average of Neighborshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1968_array_with_elements_not_equal_to_average_of_neighbors/Solution.java
Number of Strings That Appear as Substrings in Wordhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1967_number_of_strings_that_appear_as_substrings_in_word/Solution.java
Employees With Missing Informationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1965_employees_with_missing_information/script.sql
Find the Longest Valid Obstacle Course at Each Positionhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1964_find_the_longest_valid_obstacle_course_at_each_position/Solution.java
Minimum Number of Swaps to Make the String Balancedhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1963_minimum_number_of_swaps_to_make_the_string_balanced/Solution.java
Remove Stones to Minimize the Totalhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1962_remove_stones_to_minimize_the_total/Solution.java
Check If String Is a Prefix of Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1961_check_if_string_is_a_prefix_of_array/Solution.java
Maximum Product of the Length of Two Palindromic Substringshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1960_maximum_product_of_the_length_of_two_palindromic_substrings/Solution.java
Minimum Total Space Wasted With K Resizing Operationshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1959_minimum_total_space_wasted_with_k_resizing_operations/Solution.java
Check if Move is Legalhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1958_check_if_move_is_legal/Solution.java
Delete Characters to Make Fancy Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1957_delete_characters_to_make_fancy_string/Solution.java
Count Number of Special Subsequenceshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1955_count_number_of_special_subsequences/Solution.java
Minimum Garden Perimeter to Collect Enough Appleshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1954_minimum_garden_perimeter_to_collect_enough_apples/Solution.java
Maximum Number of Weeks for Which You Can Workhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1953_maximum_number_of_weeks_for_which_you_can_work/Solution.java
Three Divisorshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1952_three_divisors/Solution.java
Delete Duplicate Folders in Systemhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1948_delete_duplicate_folders_in_system/Solution.java
Maximum Compatibility Score Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1947_maximum_compatibility_score_sum/Solution.java
Largest Number After Mutating Substringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1946_largest_number_after_mutating_substring/Solution.java
Sum of Digits of String After Converthttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1945_sum_of_digits_of_string_after_convert/Solution.java
Number of Visible People in a Queuehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1944_number_of_visible_people_in_a_queue/Solution.java
Describe the Paintinghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1943_describe_the_painting/Solution.java
The Number of the Smallest Unoccupied Chairhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1942_the_number_of_the_smallest_unoccupied_chair/Solution.java
Check if All Characters Have Equal Number of Occurrenceshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1941_check_if_all_characters_have_equal_number_of_occurrences/Solution.java
Maximum Genetic Difference Queryhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1938_maximum_genetic_difference_query/Solution.java
Maximum Number of Points with Costhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1937_maximum_number_of_points_with_cost/Solution.java
Add Minimum Number of Rungshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1936_add_minimum_number_of_rungs/Solution.java
Maximum Number of Words You Can Typehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1935_maximum_number_of_words_you_can_type/Solution.java
Merge BSTs to Create Single BSThttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1932_merge_bsts_to_create_single_bst/Solution.java
Painting a Grid With Three Different Colorshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1931_painting_a_grid_with_three_different_colors/Solution.java
Unique Length-3 Palindromic Subsequenceshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1930_unique_length_3_palindromic_subsequences/Solution.java
Concatenation of Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1929_concatenation_of_array/Solution.java
Minimum Cost to Reach Destination in Timehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1928_minimum_cost_to_reach_destination_in_time/Solution.java
Sum Gamehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1927_sum_game/Solution.java
Nearest Exit from Entrance in Mazehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1926_nearest_exit_from_entrance_in_maze/Solution.java
Count Square Sum Tripleshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1925_count_square_sum_triples/Solution.java
Longest Common Subpathhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1923_longest_common_subpath/Solution.java
Count Good Numbershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1922_count_good_numbers/Solution.java
Eliminate Maximum Number of Monstershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1921_eliminate_maximum_number_of_monsters/Solution.java
Build Array from Permutationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1920_build_array_from_permutation/Solution.java
Count Ways to Build Rooms in an Ant Colonyhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1916_count_ways_to_build_rooms_in_an_ant_colony/Solution.java
Number of Wonderful Substringshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1915_number_of_wonderful_substrings/Solution.java
Cyclically Rotating a Gridhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1914_cyclically_rotating_a_grid/Solution.java
Maximum Product Difference Between Two Pairshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1913_maximum_product_difference_between_two_pairs/Solution.java
Design Movie Rental Systemhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1912_design_movie_rental_system/MovieRentingSystem.java
Maximum Alternating Subsequence Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1911_maximum_alternating_subsequence_sum/Solution.java
Remove All Occurrences of a Substringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1910_remove_all_occurrences_of_a_substring/Solution.java
Remove One Element to Make the Array Strictly Increasinghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1909_remove_one_element_to_make_the_array_strictly_increasing/Solution.java
Minimum Absolute Difference Querieshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1906_minimum_absolute_difference_queries/Solution.java
Count Sub Islandshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1905_count_sub_islands/Solution.java
The Number of Full Rounds You Have Playedhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1904_the_number_of_full_rounds_you_have_played/Solution.java
Largest Odd Number in Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1903_largest_odd_number_in_string/Solution.java
Find a Peak Element IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1901_2000/s1901_find_a_peak_element_ii/Solution.java
The Earliest and Latest Rounds Where Players Competehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1900_the_earliest_and_latest_rounds_where_players_compete/Solution.java
Merge Triplets to Form Target Triplethttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1899_merge_triplets_to_form_target_triplet/Solution.java
Maximum Number of Removable Charactershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1898_maximum_number_of_removable_characters/Solution.java
Redistribute Characters to Make All Strings Equalhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1897_redistribute_characters_to_make_all_strings_equal/Solution.java
Minimum Cost to Change the Final Value of Expressionhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1896_minimum_cost_to_change_the_final_value_of_expression/Solution.java
Largest Magic Squarehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1895_largest_magic_square/Solution.java
Find the Student that Will Replace the Chalkhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1894_find_the_student_that_will_replace_the_chalk/Solution.java
Check if All the Integers in a Range Are Coveredhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1893_check_if_all_the_integers_in_a_range_are_covered/Solution.java
The Latest Login in 2020https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1890_the_latest_login_in_2020/script.sql
Minimum Space Wasted From Packaginghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1889_minimum_space_wasted_from_packaging/Solution.java
Minimum Number of Flips to Make the Binary String Alternatinghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1888_minimum_number_of_flips_to_make_the_binary_string_alternating/Solution.java
Reduction Operations to Make the Array Elements Equalhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1887_reduction_operations_to_make_the_array_elements_equal/Solution.java
Determine Whether Matrix Can Be Obtained By Rotationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1886_determine_whether_matrix_can_be_obtained_by_rotation/Solution.java
Egg Drop With 2 Eggs and N Floorshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1884_egg_drop_with_2_eggs_and_n_floors/Solution.java
Minimum Skips to Arrive at Meeting On Timehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1883_minimum_skips_to_arrive_at_meeting_on_time/Solution.java
Process Tasks Using Servershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1882_process_tasks_using_servers/Solution.java
Maximum Value after Insertionhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1881_maximum_value_after_insertion/Solution.java
Check if Word Equals Summation of Two Wordshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1880_check_if_word_equals_summation_of_two_words/Solution.java
Minimum XOR Sum of Two Arrayshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1879_minimum_xor_sum_of_two_arrays/Solution.java
Get Biggest Three Rhombus Sums in a Gridhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1878_get_biggest_three_rhombus_sums_in_a_grid/Solution.java
Minimize Maximum Pair Sum in Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1877_minimize_maximum_pair_sum_in_array/Solution.java
Substrings of Size Three with Distinct Charactershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1876_substrings_of_size_three_with_distinct_characters/Solution.java
Calculate Special Bonushttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1873_calculate_special_bonus/script.sql
Stone Game VIIIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1872_stone_game_viii/Solution.java
Jump Game VIIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1871_jump_game_vii/Solution.java
Minimum Speed to Arrive on Timehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1870_minimum_speed_to_arrive_on_time/Solution.java
Longer Contiguous Segments of Ones than Zeroshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1869_longer_contiguous_segments_of_ones_than_zeros/Solution.java
Number of Ways to Rearrange Sticks With K Sticks Visiblehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1866_number_of_ways_to_rearrange_sticks_with_k_sticks_visible/Solution.java
Finding Pairs With a Certain Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1865_finding_pairs_with_a_certain_sum/FindSumPairs.java
Minimum Number of Swaps to Make the Binary String Alternatinghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1864_minimum_number_of_swaps_to_make_the_binary_string_alternating/Solution.java
Sum of All Subset XOR Totalshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1863_sum_of_all_subset_xor_totals/Solution.java
Sum of Floored Pairshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1862_sum_of_floored_pairs/Solution.java
Rotating the Boxhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1861_rotating_the_box/Solution.java
Incremental Memory Leakhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1860_incremental_memory_leak/Solution.java
Sorting the Sentencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1859_sorting_the_sentence/Solution.java
Largest Color Value in a Directed Graphhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1857_largest_color_value_in_a_directed_graph/Solution.java
Maximum Subarray Min-Producthttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1856_maximum_subarray_min_product/Solution.java
Maximum Distance Between a Pair of Valueshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1855_maximum_distance_between_a_pair_of_values/Solution.java
Maximum Population Yearhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1854_maximum_population_year/Solution.java
Minimum Interval to Include Each Queryhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1851_minimum_interval_to_include_each_query/Solution.java
Minimum Adjacent Swaps to Reach the Kth Smallest Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1850_minimum_adjacent_swaps_to_reach_the_kth_smallest_number/Solution.java
Splitting a String Into Descending Consecutive Valueshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1849_splitting_a_string_into_descending_consecutive_values/Solution.java
Minimum Distance to the Target Elementhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1848_minimum_distance_to_the_target_element/Solution.java
Closest Roomhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1847_closest_room/Solution.java
Maximum Element After Decreasing and Rearranginghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1846_maximum_element_after_decreasing_and_rearranging/Solution.java
Seat Reservation Managerhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1845_seat_reservation_manager/SeatManager.java
Replace All Digits with Charactershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1844_replace_all_digits_with_characters/Solution.java
Maximum Building Heighthttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1840_maximum_building_height/Solution.java
Longest Substring Of All Vowels in Orderhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1839_longest_substring_of_all_vowels_in_order/Solution.java
Frequency of the Most Frequent Elementhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1838_frequency_of_the_most_frequent_element/Solution.java
Sum of Digits in Base Khttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1837_sum_of_digits_in_base_k/Solution.java
Find XOR Sum of All Pairs Bitwise ANDhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1835_find_xor_sum_of_all_pairs_bitwise_and/Solution.java
Single-Threaded CPUhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1834_single_threaded_cpu/Solution.java
Maximum Ice Cream Barshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1833_maximum_ice_cream_bars/Solution.java
Check if the Sentence Is Pangramhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1832_check_if_the_sentence_is_pangram/Solution.java
Minimum Number of Operations to Make String Sortedhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1830_minimum_number_of_operations_to_make_string_sorted/Solution.java
Maximum XOR for Each Queryhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1829_maximum_xor_for_each_query/Solution.java
Queries on Number of Points Inside a Circlehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1828_queries_on_number_of_points_inside_a_circle/Solution.java
Minimum Operations to Make the Array Increasinghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1827_minimum_operations_to_make_the_array_increasing/Solution.java
Finding MK Averagehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1825_finding_mk_average/MKAverage.java
Minimum Sideway Jumpshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1824_minimum_sideway_jumps/Solution.java
Find the Winner of the Circular Gamehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1823_find_the_winner_of_the_circular_game/Solution.java
Sign of the Product of an Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1822_sign_of_the_product_of_an_array/Solution.java
Number of Different Subsequences GCDshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1819_number_of_different_subsequences_gcds/Solution.java
Minimum Absolute Sum Differencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1818_minimum_absolute_sum_difference/Solution.java
Finding the Users Active Minuteshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1817_finding_the_users_active_minutes/Solution.java
Truncate Sentencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1816_truncate_sentence/Solution.java
Maximum Number of Groups Getting Fresh Donutshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1815_maximum_number_of_groups_getting_fresh_donuts/Solution.java
Count Nice Pairs in an Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1814_count_nice_pairs_in_an_array/Solution.java
Sentence Similarity IIIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1813_sentence_similarity_iii/Solution.java
Determine Color of a Chessboard Squarehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1812_determine_color_of_a_chessboard_square/Solution.java
Maximize Number of Nice Divisorshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1808_maximize_number_of_nice_divisors/Solution.java
Evaluate the Bracket Pairs of a Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1807_evaluate_the_bracket_pairs_of_a_string/Solution.java
Minimum Number of Operations to Reinitialize a Permutationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1806_minimum_number_of_operations_to_reinitialize_a_permutation/Solution.java
Number of Different Integers in a Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1805_number_of_different_integers_in_a_string/Solution.java
Count Pairs With XOR in a Rangehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1803_count_pairs_with_xor_in_a_range/Solution.java
Maximum Value at a Given Index in a Bounded Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1802_maximum_value_at_a_given_index_in_a_bounded_array/Solution.java
Number of Orders in the Backloghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1801_1900/s1801_number_of_orders_in_the_backlog/Solution.java
Maximum Ascending Subarray Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1800_maximum_ascending_subarray_sum/Solution.java
Maximize Score After N Operationshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1799_maximize_score_after_n_operations/Solution.java
Maximum Number of Consecutive Values You Can Makehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1798_maximum_number_of_consecutive_values_you_can_make/Solution.java
Design Authentication Managerhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1797_design_authentication_manager/AuthenticationManager.java
Second Largest Digit in a Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1796_second_largest_digit_in_a_string/Solution.java
Rearrange Products Tablehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1795_rearrange_products_table/script.sql
Maximum Score of a Good Subarrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1793_maximum_score_of_a_good_subarray/Solution.java
Maximum Average Pass Ratiohttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1792_maximum_average_pass_ratio/Solution.java
Find Center of Star Graphhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1791_find_center_of_star_graph/Solution.java
Check if One String Swap Can Make Strings Equalhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1790_check_if_one_string_swap_can_make_strings_equal/Solution.java
Make the XOR of All Segments Equal to Zerohttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1787_make_the_xor_of_all_segments_equal_to_zero/Solution.java
Number of Restricted Paths From First to Last Nodehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1786_number_of_restricted_paths_from_first_to_last_node/Solution.java
Minimum Elements to Add to Form a Given Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1785_minimum_elements_to_add_to_form_a_given_sum/Solution.java
Check if Binary String Has at Most One Segment of Oneshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1784_check_if_binary_string_has_at_most_one_segment_of_ones/Solution.java
Count Pairs Of Nodeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1782_count_pairs_of_nodes/Solution.java
Sum of Beauty of All Substringshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1781_sum_of_beauty_of_all_substrings/Solution.java
Check if Number is a Sum of Powers of Threehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1780_check_if_number_is_a_sum_of_powers_of_three/Solution.java
Find Nearest Point That Has the Same X or Y Coordinatehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1779_find_nearest_point_that_has_the_same_x_or_y_coordinate/Solution.java
Car Fleet IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1776_car_fleet_ii/Solution.java
Equal Sum Arrays With Minimum Number of Operationshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1775_equal_sum_arrays_with_minimum_number_of_operations/Solution.java
Closest Dessert Costhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1774_closest_dessert_cost/Solution.java
Count Items Matching a Rulehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1773_count_items_matching_a_rule/Solution.java
Maximize Palindrome Length From Subsequenceshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1771_maximize_palindrome_length_from_subsequences/Solution.java
Maximum Score from Performing Multiplication Operationshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1770_maximum_score_from_performing_multiplication_operations/Solution.java
Minimum Number of Operations to Move All Balls to Each Boxhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1769_minimum_number_of_operations_to_move_all_balls_to_each_box/Solution.java
Merge Strings Alternatelyhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1768_merge_strings_alternately/Solution.java
Tree of Coprimeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1766_tree_of_coprimes/Solution.java
Map of Highest Peakhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1765_map_of_highest_peak/Solution.java
Form Array by Concatenating Subarrays of Another Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1764_form_array_by_concatenating_subarrays_of_another_array/Solution.java
Longest Nice Substringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1763_longest_nice_substring/Solution.java
Minimum Degree of a Connected Trio in a Graphhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1761_minimum_degree_of_a_connected_trio_in_a_graph/Solution.java
Minimum Limit of Balls in a Baghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1760_minimum_limit_of_balls_in_a_bag/Solution.java
Count Number of Homogenous Substringshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1759_count_number_of_homogenous_substrings/Solution.java
Minimum Changes To Make Alternating Binary Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1758_minimum_changes_to_make_alternating_binary_string/Solution.java
Recyclable and Low Fat Productshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1757_recyclable_and_low_fat_products/script.sql
Closest Subsequence Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1755_closest_subsequence_sum/Solution.java
Largest Merge Of Two Stringshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1754_largest_merge_of_two_strings/Solution.java
Maximum Score From Removing Stoneshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1753_maximum_score_from_removing_stones/Solution.java
Check if Array Is Sorted and Rotatedhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1752_check_if_array_is_sorted_and_rotated/Solution.java
Maximum Number of Events That Can Be Attended IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1751_maximum_number_of_events_that_can_be_attended_ii/Solution.java
Minimum Length of String After Deleting Similar Endshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1750_minimum_length_of_string_after_deleting_similar_ends/Solution.java
Maximum Absolute Sum of Any Subarrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1749_maximum_absolute_sum_of_any_subarray/Solution.java
Sum of Unique Elementshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1748_sum_of_unique_elements/Solution.java
Palindrome Partitioning IVhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1745_palindrome_partitioning_iv/Solution.java
Can You Eat Your Favorite Candy on Your Favorite Day?https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1744_can_you_eat_your_favorite_candy_on_your_favorite_day/Solution.java
Restore the Array From Adjacent Pairshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1743_restore_the_array_from_adjacent_pairs/Solution.java
Maximum Number of Balls in a Boxhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1742_maximum_number_of_balls_in_a_box/Solution.java
Find Total Time Spent by Each Employeehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1741_find_total_time_spent_by_each_employee/script.sql
Building Boxeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1739_building_boxes/Solution.java
Find Kth Largest XOR Coordinate Valuehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1738_find_kth_largest_xor_coordinate_value/Solution.java
Change Minimum Characters to Satisfy One of Three Conditionshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1737_change_minimum_characters_to_satisfy_one_of_three_conditions/Solution.java
Latest Time by Replacing Hidden Digitshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1736_latest_time_by_replacing_hidden_digits/Solution.java
Count Ways to Make Array With Producthttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1735_count_ways_to_make_array_with_product/Solution.java
Decode XORed Permutationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1734_decode_xored_permutation/Solution.java
Minimum Number of People to Teachhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1733_minimum_number_of_people_to_teach/Solution.java
Find the Highest Altitudehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1732_find_the_highest_altitude/Solution.java
Find Followers Counthttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1729_find_followers_count/script.sql
Cat and Mouse IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1728_cat_and_mouse_ii/Solution.java
Largest Submatrix With Rearrangementshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1727_largest_submatrix_with_rearrangements/Solution.java
Tuple with Same Producthttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1726_tuple_with_same_product/Solution.java
Number Of Rectangles That Can Form The Largest Squarehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1725_number_of_rectangles_that_can_form_the_largest_square/Solution.java
Find Minimum Time to Finish All Jobshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1723_find_minimum_time_to_finish_all_jobs/Solution.java
Minimize Hamming Distance After Swap Operationshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1722_minimize_hamming_distance_after_swap_operations/Solution.java
Swapping Nodes in a Linked Listhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1721_swapping_nodes_in_a_linked_list/Solution.java
Decode XORed Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1720_decode_xored_array/Solution.java
Number Of Ways To Reconstruct A Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1719_number_of_ways_to_reconstruct_a_tree/Solution.java
Construct the Lexicographically Largest Valid Sequencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1718_construct_the_lexicographically_largest_valid_sequence/Solution.java
Maximum Score From Removing Substringshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1717_maximum_score_from_removing_substrings/Solution.java
Calculate Money in Leetcode Bankhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1716_calculate_money_in_leetcode_bank/Solution.java
Minimum Operations to Make a Subsequencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1713_minimum_operations_to_make_a_subsequence/Solution.java
Ways to Split Array Into Three Subarrayshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1712_ways_to_split_array_into_three_subarrays/Solution.java
Count Good Mealshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1711_count_good_meals/Solution.java
Maximum Units on a Truckhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1710_maximum_units_on_a_truck/Solution.java
Maximum XOR With an Element From Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1707_maximum_xor_with_an_element_from_array/Solution.java
Where Will the Ball Fallhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1706_where_will_the_ball_fall/Solution.java
Maximum Number of Eaten Appleshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1705_maximum_number_of_eaten_apples/Solution.java
Determine if String Halves Are Alikehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1704_determine_if_string_halves_are_alike/Solution.java
Minimum Adjacent Swaps for K Consecutive Oneshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1703_minimum_adjacent_swaps_for_k_consecutive_ones/Solution.java
Maximum Binary String After Changehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1702_maximum_binary_string_after_change/Solution.java
Average Waiting Timehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1701_1800/s1701_average_waiting_time/Solution.java
Number of Students Unable to Eat Lunchhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1700_number_of_students_unable_to_eat_lunch/Solution.java
Checking Existence of Edge Length Limited Pathshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1697_checking_existence_of_edge_length_limited_paths/Solution.java
Jump Game VIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1696_jump_game_vi/Solution.java
Maximum Erasure Valuehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1695_maximum_erasure_value/Solution.java
Reformat Phone Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1694_reformat_phone_number/Solution.java
Daily Leads and Partnershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1693_daily_leads_and_partners/script.sql
Maximum Height by Stacking Cuboidshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1691_maximum_height_by_stacking_cuboids/Solution.java
Stone Game VIIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1690_stone_game_vii/Solution.java
Partitioning Into Minimum Number Of Deci-Binary Numbershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1689_partitioning_into_minimum_number_of_deci_binary_numbers/Solution.java
Count of Matches in Tournamenthttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1688_count_of_matches_in_tournament/Solution.java
Delivering Boxes from Storage to Portshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1687_delivering_boxes_from_storage_to_ports/Solution.java
Stone Game VIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1686_stone_game_vi/Solution.java
Sum of Absolute Differences in a Sorted Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1685_sum_of_absolute_differences_in_a_sorted_array/Solution.java
Count the Number of Consistent Stringshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1684_count_the_number_of_consistent_strings/Solution.java
Minimum Incompatibilityhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1681_minimum_incompatibility/Solution.java
Concatenation of Consecutive Binary Numbershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1680_concatenation_of_consecutive_binary_numbers/Solution.java
Max Number of K-Sum Pairshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1679_max_number_of_k_sum_pairs/Solution.java
Goal Parser Interpretationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1678_goal_parser_interpretation/Solution.java
Minimize Deviation in Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1675_minimize_deviation_in_array/Solution.java
Minimum Moves to Make Array Complementaryhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1674_minimum_moves_to_make_array_complementary/Solution.java
Find the Most Competitive Subsequencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1673_find_the_most_competitive_subsequence/Solution.java
Richest Customer Wealthhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1672_richest_customer_wealth/Solution.java
Minimum Number of Removals to Make Mountain Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1671_minimum_number_of_removals_to_make_mountain_array/Solution.java
Design Front Middle Back Queuehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1670_design_front_middle_back_queue/FrontMiddleBackQueue.java
Merge In Between Linked Listshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1669_merge_in_between_linked_lists/Solution.java
Maximum Repeating Substringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1668_maximum_repeating_substring/Solution.java
Fix Names in a Tablehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1667_fix_names_in_a_table/script.sql
Minimum Initial Energy to Finish Taskshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1665_minimum_initial_energy_to_finish_tasks/Solution.java
Ways to Make a Fair Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1664_ways_to_make_a_fair_array/Solution.java
Smallest String With A Given Numeric Valuehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1663_smallest_string_with_a_given_numeric_value/Solution.java
Check If Two String Arrays are Equivalenthttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1662_check_if_two_string_arrays_are_equivalent/Solution.java
Maximize Grid Happinesshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1659_maximize_grid_happiness/Solution.java
Minimum Operations to Reduce X to Zerohttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1658_minimum_operations_to_reduce_x_to_zero/Solution.java
Determine if Two Strings Are Closehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1657_determine_if_two_strings_are_close/Solution.java
Design an Ordered Streamhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1656_design_an_ordered_stream/OrderedStream.java
Distribute Repeating Integershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1655_distribute_repeating_integers/Solution.java
Minimum Jumps to Reach Homehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1654_minimum_jumps_to_reach_home/Solution.java
Minimum Deletions to Make String Balancedhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1653_minimum_deletions_to_make_string_balanced/Solution.java
Defuse the Bombhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1652_defuse_the_bomb/Solution.java
Create Sorted Array through Instructionshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1649_create_sorted_array_through_instructions/Solution.java
Sell Diminishing-Valued Colored Ballshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1648_sell_diminishing_valued_colored_balls/Solution.java
Minimum Deletions to Make Character Frequencies Uniquehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1647_minimum_deletions_to_make_character_frequencies_unique/Solution.java
Get Maximum in Generated Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1646_get_maximum_in_generated_array/Solution.java
Kth Smallest Instructionshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1643_kth_smallest_instructions/Solution.java
Furthest Building You Can Reachhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1642_furthest_building_you_can_reach/Solution.java
Count Sorted Vowel Stringshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1641_count_sorted_vowel_strings/Solution.java
Check Array Formation Through Concatenationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1640_check_array_formation_through_concatenation/Solution.java
Number of Ways to Form a Target String Given a Dictionaryhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1639_number_of_ways_to_form_a_target_string_given_a_dictionary/Solution.java
Count Substrings That Differ by One Characterhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1638_count_substrings_that_differ_by_one_character/Solution.java
Widest Vertical Area Between Two Points Containing No Pointshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1637_widest_vertical_area_between_two_points_containing_no_points/Solution.java
Sort Array by Increasing Frequencyhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1636_sort_array_by_increasing_frequency/Solution.java
Rank Transform of a Matrixhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1632_rank_transform_of_a_matrix/Solution.java
Path With Minimum Efforthttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1631_path_with_minimum_effort/Solution.java
Arithmetic Subarrayshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1630_arithmetic_subarrays/Solution.java
Slowest Keyhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1629_slowest_key/Solution.java
Graph Connectivity With Thresholdhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1627_graph_connectivity_with_threshold/Solution.java
Best Team With No Conflictshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1626_best_team_with_no_conflicts/Solution.java
Lexicographically Smallest String After Applying Operationshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1625_lexicographically_smallest_string_after_applying_operations/Solution.java
Largest Substring Between Two Equal Charactershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1624_largest_substring_between_two_equal_characters/Solution.java
Fancy Sequencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1622_fancy_sequence/Fancy.java
Number of Sets of K Non-Overlapping Line Segmentshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1621_number_of_sets_of_k_non_overlapping_line_segments/Solution.java
Coordinate With Maximum Network Qualityhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1620_coordinate_with_maximum_network_quality/Solution.java
Mean of Array After Removing Some Elementshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1619_mean_of_array_after_removing_some_elements/Solution.java
Count Subtrees With Max Distance Between Citieshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1617_count_subtrees_with_max_distance_between_cities/Solution.java
Split Two Strings to Make Palindromehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1616_split_two_strings_to_make_palindrome/Solution.java
Maximal Network Rankhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1615_maximal_network_rank/Solution.java
Maximum Nesting Depth of the Parentheseshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1614_maximum_nesting_depth_of_the_parentheses/Solution.java
Minimum One Bit Operations to Make Integers Zerohttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1611_minimum_one_bit_operations_to_make_integers_zero/Solution.java
Maximum Number of Visible Pointshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1610_maximum_number_of_visible_points/Solution.java
Even Odd Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1609_even_odd_tree/Solution.java
Special Array With X Elements Greater Than or Equal Xhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1608_special_array_with_x_elements_greater_than_or_equal_x/Solution.java
Find Servers That Handled Most Number of Requestshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1606_find_servers_that_handled_most_number_of_requests/Solution.java
Find Valid Matrix Given Row and Column Sumshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1605_find_valid_matrix_given_row_and_column_sums/Solution.java
Alert Using Same Key-Card Three or More Times in a One Hour Periodhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1604_alert_using_same_key_card_three_or_more_times_in_a_one_hour_period/Solution.java
Design Parking Systemhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1603_design_parking_system/ParkingSystem.java
Maximum Number of Achievable Transfer Requestshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1601_1700/s1601_maximum_number_of_achievable_transfer_requests/Solution.java
Throne Inheritancehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1600_throne_inheritance/ThroneInheritance.java
Maximum Profit of Operating a Centennial Wheelhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1599_maximum_profit_of_operating_a_centennial_wheel/Solution.java
Crawler Log Folderhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1598_crawler_log_folder/Solution.java
Minimum Cost to Connect Two Groups of Pointshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1595_minimum_cost_to_connect_two_groups_of_points/Solution.java
Maximum Non Negative Product in a Matrixhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1594_maximum_non_negative_product_in_a_matrix/Solution.java
Split a String Into the Max Number of Unique Substringshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1593_split_a_string_into_the_max_number_of_unique_substrings/Solution.java
Rearrange Spaces Between Wordshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1592_rearrange_spaces_between_words/Solution.java
Strange Printer IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1591_strange_printer_ii/Solution.java
Make Sum Divisible by Phttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1590_make_sum_divisible_by_p/Solution.java
Maximum Sum Obtained of Any Permutationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1589_maximum_sum_obtained_of_any_permutation/Solution.java
Sum of All Odd Length Subarrayshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1588_sum_of_all_odd_length_subarrays/Solution.java
Bank Account Summary IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1587_bank_account_summary_ii/script.sql
Check If String Is Transformable With Substring Sort Operationshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1585_check_if_string_is_transformable_with_substring_sort_operations/Solution.java
Min Cost to Connect All Pointshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1584_min_cost_to_connect_all_points/Solution.java
Count Unhappy Friendshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1583_count_unhappy_friends/Solution.java
Special Positions in a Binary Matrixhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1582_special_positions_in_a_binary_matrix/Solution.java
Customer Who Visited but Did Not Make Any Transactionshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1581_customer_who_visited_but_did_not_make_any_transactions/script.sql
Remove Max Number of Edges to Keep Graph Fully Traversablehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1579_remove_max_number_of_edges_to_keep_graph_fully_traversable/Solution.java
Minimum Time to Make Rope Colorfulhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1578_minimum_time_to_make_rope_colorful/Solution.java
Number of Ways Where Square of Number Is Equal to Product of Two Numbershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1577_number_of_ways_where_square_of_number_is_equal_to_product_of_two_numbers/Solution.java
Replace All ?'s to Avoid Consecutive Repeating Charactershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1576_replace_all_s_to_avoid_consecutive_repeating_characters/Solution.java
Count All Possible Routeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1575_count_all_possible_routes/Solution.java
Shortest Subarray to be Removed to Make Array Sortedhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1574_shortest_subarray_to_be_removed_to_make_array_sorted/Solution.java
Number of Ways to Split a Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1573_number_of_ways_to_split_a_string/Solution.java
Matrix Diagonal Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1572_matrix_diagonal_sum/Solution.java
Number of Ways to Reorder Array to Get Same BSThttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1569_number_of_ways_to_reorder_array_to_get_same_bst/Solution.java
Minimum Number of Days to Disconnect Islandhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1568_minimum_number_of_days_to_disconnect_island/Solution.java
Maximum Length of Subarray With Positive Producthttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1567_maximum_length_of_subarray_with_positive_product/Solution.java
Detect Pattern of Length M Repeated K or More Timeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1566_detect_pattern_of_length_m_repeated_k_or_more_times/Solution.java
Stone Game Vhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1563_stone_game_v/Solution.java
Find Latest Group of Size Mhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1562_find_latest_group_of_size_m/Solution.java
Maximum Number of Coins You Can Gethttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1561_maximum_number_of_coins_you_can_get/Solution.java
Most Visited Sector in a Circular Trackhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1560_most_visited_sector_in_a_circular_track/Solution.java
Detect Cycles in 2D Gridhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1559_detect_cycles_in_2d_grid/Solution.java
Minimum Numbers of Function Calls to Make Target Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1558_minimum_numbers_of_function_calls_to_make_target_array/Solution.java
Minimum Number of Vertices to Reach All Nodeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1557_minimum_number_of_vertices_to_reach_all_nodes/Solution.java
Thousand Separatorhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1556_thousand_separator/Solution.java
Minimum Number of Days to Eat N Orangeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1553_minimum_number_of_days_to_eat_n_oranges/Solution.java
Magnetic Force Between Two Ballshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1552_magnetic_force_between_two_balls/Solution.java
Minimum Operations to Make Array Equalhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1551_minimum_operations_to_make_array_equal/Solution.java
Three Consecutive Oddshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1550_three_consecutive_odds/Solution.java
Minimum Cost to Cut a Stickhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1547_minimum_cost_to_cut_a_stick/Solution.java
Maximum Number of Non-Overlapping Subarrays With Sum Equals Targethttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1546_maximum_number_of_non_overlapping_subarrays_with_sum_equals_target/Solution.java
Find Kth Bit in Nth Binary Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1545_find_kth_bit_in_nth_binary_string/Solution.java
Make The String Greathttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1544_make_the_string_great/Solution.java
Find Longest Awesome Substringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1542_find_longest_awesome_substring/Solution.java
Minimum Insertions to Balance a Parentheses Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1541_minimum_insertions_to_balance_a_parentheses_string/Solution.java
Can Convert String in K Moveshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1540_can_convert_string_in_k_moves/Solution.java
Kth Missing Positive Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1539_kth_missing_positive_number/Solution.java
Get the Maximum Scorehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1537_get_the_maximum_score/Solution.java
Minimum Swaps to Arrange a Binary Gridhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1536_minimum_swaps_to_arrange_a_binary_grid/Solution.java
Find the Winner of an Array Gamehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1535_find_the_winner_of_an_array_game/Solution.java
Count Good Tripletshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1534_count_good_triplets/Solution.java
String Compression IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1531_string_compression_ii/Solution.java
Number of Good Leaf Nodes Pairshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1530_number_of_good_leaf_nodes_pairs/Solution.java
Minimum Suffix Flipshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1529_bulb_switcher_iv/Solution.java
Shuffle Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1528_shuffle_string/Solution.java
Patients With a Conditionhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1527_patients_with_a_condition/script.sql
Minimum Number of Increments on Subarrays to Form a Target Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1526_minimum_number_of_increments_on_subarrays_to_form_a_target_array/Solution.java
Number of Good Ways to Split a Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1525_number_of_good_ways_to_split_a_string/Solution.java
Number of Sub-arrays With Odd Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1524_number_of_sub_arrays_with_odd_sum/Solution.java
Count Odd Numbers in an Interval Rangehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1523_count_odd_numbers_in_an_interval_range/Solution.java
Find a Value of a Mysterious Function Closest to Targethttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1521_find_a_value_of_a_mysterious_function_closest_to_target/Solution.java
Maximum Number of Non-Overlapping Substringshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1520_maximum_number_of_non_overlapping_substrings/Solution.java
Number of Nodes in the Sub-Tree With the Same Labelhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1519_number_of_nodes_in_the_sub_tree_with_the_same_label/Solution.java
Water Bottleshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1518_water_bottles/Solution.java
Best Position for a Service Centrehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1515_best_position_for_a_service_centre/Solution.java
Path with Maximum Probabilityhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1514_path_with_maximum_probability/Solution.java
Number of Substrings With Only 1shttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1513_number_of_substrings_with_only_1s/Solution.java
Number of Good Pairshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1512_number_of_good_pairs/Solution.java
Stone Game IVhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1510_stone_game_iv/Solution.java
Minimum Difference Between Largest and Smallest Value in Three Moveshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1509_minimum_difference_between_largest_and_smallest_value_in_three_moves/Solution.java
Range Sum of Sorted Subarray Sumshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1508_range_sum_of_sorted_subarray_sums/Solution.java
Reformat Datehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1507_reformat_date/Solution.java
Minimum Possible Integer After at Most K Adjacent Swaps On Digitshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1505_minimum_possible_integer_after_at_most_k_adjacent_swaps_on_digits/Solution.java
Count Submatrices With All Oneshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1504_count_submatrices_with_all_ones/Solution.java
Last Moment Before All Ants Fall Out of a Plankhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1503_last_moment_before_all_ants_fall_out_of_a_plank/Solution.java
Can Make Arithmetic Progression From Sequencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1501_1600/s1502_can_make_arithmetic_progression_from_sequence/Solution.java
Max Value of Equationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1499_max_value_of_equation/Solution.java
Number of Subsequences That Satisfy the Given Sum Conditionhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1498_number_of_subsequences_that_satisfy_the_given_sum_condition/Solution.java
Check If Array Pairs Are Divisible by khttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1497_check_if_array_pairs_are_divisible_by_k/Solution.java
Path Crossinghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1496_path_crossing/Solution.java
Parallel Courses IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1494_parallel_courses_ii/Solution.java
Longest Subarray of 1's After Deleting One Elementhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1493_longest_subarray_of_1s_after_deleting_one_element/Solution.java
The kth Factor of nhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1492_the_kth_factor_of_n/Solution.java
Average Salary Excluding the Minimum and Maximum Salaryhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1491_average_salary_excluding_the_minimum_and_maximum_salary/Solution.java
Find Critical and Pseudo-Critical Edges in Minimum Spanning Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1489_find_critical_and_pseudo_critical_edges_in_minimum_spanning_tree/Solution.java
Avoid Flood in The Cityhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1488_avoid_flood_in_the_city/Solution.java
Making File Names Uniquehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1487_making_file_names_unique/Solution.java
XOR Operation in an Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1486_xor_operation_in_an_array/Solution.java
Group Sold Products By The Datehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1484_group_sold_products_by_the_date/script.sql
Kth Ancestor of a Tree Nodehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1483_kth_ancestor_of_a_tree_node/TreeAncestor.java
Minimum Number of Days to Make m Bouquetshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1482_minimum_number_of_days_to_make_m_bouquets/Solution.java
Least Number of Unique Integers after K Removalshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1481_least_number_of_unique_integers_after_k_removals/Solution.java
Running Sum of 1d Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1480_running_sum_of_1d_array/Solution.java
Allocate Mailboxeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1478_allocate_mailboxes/Solution.java
Find Two Non-overlapping Sub-arrays Each With Target Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1477_find_two_non_overlapping_sub_arrays_each_with_target_sum/Solution.java
Subrectangle Querieshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1476_subrectangle_queries/SubrectangleQueries.java
Final Prices With a Special Discount in a Shophttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1475_final_prices_with_a_special_discount_in_a_shop/Solution.java
Paint House IIIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1473_paint_house_iii/Solution.java
Design Browser Historyhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1472_design_browser_history/BrowserHistory.java
The k Strongest Values in an Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1471_the_k_strongest_values_in_an_array/Solution.java
Shuffle the Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1470_shuffle_the_array/Solution.java
Probability of a Two Boxes Having The Same Number of Distinct Ballshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1467_probability_of_a_two_boxes_having_the_same_number_of_distinct_balls/Solution.java
Reorder Routes to Make All Paths Lead to the City Zerohttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero/Solution.java
Maximum Area of a Piece of Cake After Horizontal and Vertical Cutshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1465_maximum_area_of_a_piece_of_cake_after_horizontal_and_vertical_cuts/Solution.java
Maximum Product of Two Elements in an Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1464_maximum_product_of_two_elements_in_an_array/Solution.java
Cherry Pickup IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1463_cherry_pickup_ii/Solution.java
Course Schedule IVhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1462_course_schedule_iv/Solution.java
Check If a String Contains All Binary Codes of Size Khttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1461_check_if_a_string_contains_all_binary_codes_of_size_k/Solution.java
Make Two Arrays Equal by Reversing Sub-arrayshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1460_make_two_arrays_equal_by_reversing_sub_arrays/Solution.java
Max Dot Product of Two Subsequenceshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1458_max_dot_product_of_two_subsequences/Solution.java
Pseudo-Palindromic Paths in a Binary Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1457_pseudo_palindromic_paths_in_a_binary_tree/Solution.java
Maximum Number of Vowels in a Substring of Given Lengthhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1456_maximum_number_of_vowels_in_a_substring_of_given_length/Solution.java
Check If a Word Occurs As a Prefix of Any Word in a Sentencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1455_check_if_a_word_occurs_as_a_prefix_of_any_word_in_a_sentence/Solution.java
Maximum Number of Darts Inside of a Circular Dartboardhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1453_maximum_number_of_darts_inside_of_a_circular_dartboard/Solution.java
People Whose List of Favorite Companies Is Not a Subset of Another Listhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1452_people_whose_list_of_favorite_companies_is_not_a_subset_of_another_list/Solution.java
Rearrange Words in a Sentencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1451_rearrange_words_in_a_sentence/Solution.java
Number of Students Doing Homework at a Given Timehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1450_number_of_students_doing_homework_at_a_given_time/Solution.java
Form Largest Integer With Digits That Add up to Targethttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1449_form_largest_integer_with_digits_that_add_up_to_target/Solution.java
Count Good Nodes in Binary Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1448_count_good_nodes_in_binary_tree/Solution.java
Simplified Fractionshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1447_simplified_fractions/Solution.java
Consecutive Charactershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1446_consecutive_characters/Solution.java
Number of Ways of Cutting a Pizzahttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1444_number_of_ways_of_cutting_a_pizza/Solution.java
Minimum Time to Collect All Apples in a Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1443_minimum_time_to_collect_all_apples_in_a_tree/Solution.java
Count Triplets That Can Form Two Arrays of Equal XORhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1442_count_triplets_that_can_form_two_arrays_of_equal_xor/Solution.java
Build an Array With Stack Operationshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1441_build_an_array_with_stack_operations/Solution.java
Find the Kth Smallest Sum of a Matrix With Sorted Rowshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1439_find_the_kth_smallest_sum_of_a_matrix_with_sorted_rows/Solution.java
Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limithttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1438_longest_continuous_subarray_with_absolute_diff_less_than_or_equal_to_limit/Solution.java
Check If All 1's Are at Least Length K Places Awayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1437_check_if_all_1s_are_at_least_length_k_places_away/Solution.java
Destination Cityhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1436_destination_city/Solution.java
Number of Ways to Wear Different Hats to Each Otherhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1434_number_of_ways_to_wear_different_hats_to_each_other/Solution.java
Check If a String Can Break Another Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1433_check_if_a_string_can_break_another_string/Solution.java
Max Difference You Can Get From Changing an Integerhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1432_max_difference_you_can_get_from_changing_an_integer/Solution.java
Kids With the Greatest Number of Candieshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1431_kids_with_the_greatest_number_of_candies/Solution.java
Constrained Subsequence Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1425_constrained_subsequence_sum/Solution.java
Diagonal Traverse IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1424_diagonal_traverse_ii/Solution.java
Maximum Points You Can Obtain from Cardshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1423_maximum_points_you_can_obtain_from_cards/Solution.java
Maximum Score After Splitting a Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1422_maximum_score_after_splitting_a_string/Solution.java
Build Array Where You Can Find The Maximum Exactly K Comparisonshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1420_build_array_where_you_can_find_the_maximum_exactly_k_comparisons/Solution.java
Minimum Number of Frogs Croakinghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1419_minimum_number_of_frogs_croaking/Solution.java
Display Table of Food Orders in a Restauranthttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1418_display_table_of_food_orders_in_a_restaurant/Solution.java
Reformat The Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1417_reformat_the_string/Solution.java
Restore The Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1416_restore_the_array/Solution.java
The k-th Lexicographical String of All Happy Strings of Length nhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1415_the_k_th_lexicographical_string_of_all_happy_strings_of_length_n/Solution.java
Find the Minimum Number of Fibonacci Numbers Whose Sum Is Khttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1414_find_the_minimum_number_of_fibonacci_numbers_whose_sum_is_k/Solution.java
Minimum Value to Get Positive Step by Step Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1413_minimum_value_to_get_positive_step_by_step_sum/Solution.java
Number of Ways to Paint N × 3 Gridhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1411_number_of_ways_to_paint_n_3_grid/Solution.java
HTML Entity Parserhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1410_html_entity_parser/Solution.java
Queries on a Permutation With Keyhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1409_queries_on_a_permutation_with_key/Solution.java
String Matching in an Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1408_string_matching_in_an_array/Solution.java
Top Travellershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1407_top_travellers/script.sql
Stone Game IIIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1406_stone_game_iii/Solution.java
Longest Happy Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1405_longest_happy_string/Solution.java
Number of Steps to Reduce a Number in Binary Representation to Onehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1404_number_of_steps_to_reduce_a_number_in_binary_representation_to_one/Solution.java
Minimum Subsequence in Non-Increasing Orderhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1403_minimum_subsequence_in_non_increasing_order/Solution.java
Reducing Disheshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1402_reducing_dishes/Solution.java
Circle and Rectangle Overlappinghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1401_1500/s1401_circle_and_rectangle_overlapping/Solution.java
Construct K Palindrome Stringshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1400_construct_k_palindrome_strings/Solution.java
Count Largest Grouphttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1399_count_largest_group/Solution.java
Find All Good Stringshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1397_find_all_good_strings/Solution.java
Design Underground Systemhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1396_design_underground_system/UndergroundSystem.java
Count Number of Teamshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1395_count_number_of_teams/Solution.java
Find Lucky Integer in an Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1394_find_lucky_integer_in_an_array/Solution.java
Capital Gain/Losshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1393_capital_gainloss/script.sql
Longest Happy Prefixhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1392_longest_happy_prefix/Solution.java
Check if There is a Valid Path in a Gridhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1391_check_if_there_is_a_valid_path_in_a_grid/Solution.java
Four Divisorshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1390_four_divisors/Solution.java
Create Target Array in the Given Orderhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1389_create_target_array_in_the_given_order/Solution.java
Pizza With 3n Sliceshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1388_pizza_with_3n_slices/Solution.java
Sort Integers by The Power Valuehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1387_sort_integers_by_the_power_value/Solution.java
Cinema Seat Allocationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1386_cinema_seat_allocation/Solution.java
Find the Distance Value Between Two Arrayshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1385_find_the_distance_value_between_two_arrays/Solution.java
Maximum Performance of a Teamhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1383_maximum_performance_of_a_team/Solution.java
Balance a Binary Search Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1382_balance_a_binary_search_tree/Solution.java
Design a Stack With Increment Operationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1381_design_a_stack_with_increment_operation/CustomStack.java
Lucky Numbers in a Matrixhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1380_lucky_numbers_in_a_matrix/Solution.java
Find a Corresponding Node of a Binary Tree in a Clone of That Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1379_find_a_corresponding_node_of_a_binary_tree_in_a_clone_of_that_tree/Solution.java
Frog Position After T Secondshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1377_frog_position_after_t_seconds/Solution.java
Time Needed to Inform All Employeeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1376_time_needed_to_inform_all_employees/Solution.java
Number of Times Binary String Is Prefix-Alignedhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1375_number_of_times_binary_string_is_prefix_aligned/Solution.java
Generate a String With Characters That Have Odd Countshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1374_generate_a_string_with_characters_that_have_odd_counts/Solution.java
Maximum Sum BST in Binary Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1373_maximum_sum_bst_in_binary_tree/Solution.java
Longest ZigZag Path in a Binary Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1372_longest_zigzag_path_in_a_binary_tree/Solution.java
Find the Longest Substring Containing Vowels in Even Countshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1371_find_the_longest_substring_containing_vowels_in_even_counts/Solution.java
Increasing Decreasing Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1370_increasing_decreasing_string/Solution.java
Minimum Cost to Make at Least One Valid Path in a Gridhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1368_minimum_cost_to_make_at_least_one_valid_path_in_a_grid/Solution.java
Linked List in Binary Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1367_linked_list_in_binary_tree/Solution.java
Rank Teams by Voteshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1366_rank_teams_by_votes/Solution.java
How Many Numbers Are Smaller Than the Current Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1365_how_many_numbers_are_smaller_than_the_current_number/Solution.java
Largest Multiple of Threehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1363_largest_multiple_of_three/Solution.java
Closest Divisorshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1362_closest_divisors/Solution.java
Validate Binary Tree Nodeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1361_validate_binary_tree_nodes/Solution.java
Number of Days Between Two Dateshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1360_number_of_days_between_two_dates/Solution.java
Count All Valid Pickup and Delivery Optionshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1359_count_all_valid_pickup_and_delivery_options/Solution.java
Number of Substrings Containing All Three Charactershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1358_number_of_substrings_containing_all_three_characters/Solution.java
Apply Discount Every n Ordershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1357_apply_discount_every_n_orders/Cashier.java
Sort Integers by The Number of 1 Bitshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1356_sort_integers_by_the_number_of_1_bits/Solution.java
Construct Target Array With Multiple Sumshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1354_construct_target_array_with_multiple_sums/Solution.java
Maximum Number of Events That Can Be Attendedhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1353_maximum_number_of_events_that_can_be_attended/Solution.java
Product of the Last K Numbershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1352_product_of_the_last_k_numbers/ProductOfNumbers.java
Count Negative Numbers in a Sorted Matrixhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1351_count_negative_numbers_in_a_sorted_matrix/Solution.java
Maximum Students Taking Examhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1349_maximum_students_taking_exam/Solution.java
Tweet Counts Per Frequencyhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1348_tweet_counts_per_frequency/TweetCounts.java
Minimum Number of Steps to Make Two Strings Anagramhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1347_minimum_number_of_steps_to_make_two_strings_anagram/Solution.java
Check If N and Its Double Existhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1346_check_if_n_and_its_double_exist/Solution.java
Jump Game IVhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1345_jump_game_iv/Solution.java
Angle Between Hands of a Clockhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1344_angle_between_hands_of_a_clock/Solution.java
Number of Sub-arrays of Size K and Average Greater than or Equal to Thresholdhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1343_number_of_sub_arrays_of_size_k_and_average_greater_than_or_equal_to_threshold/Solution.java
Number of Steps to Reduce a Number to Zerohttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1342_number_of_steps_to_reduce_a_number_to_zero/Solution.java
Jump Game Vhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1340_jump_game_v/Solution.java
Maximum Product of Splitted Binary Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1339_maximum_product_of_splitted_binary_tree/Solution.java
Reduce Array Size to The Halfhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1338_reduce_array_size_to_the_half/Solution.java
The K Weakest Rows in a Matrixhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1337_the_k_weakest_rows_in_a_matrix/Solution.java
Minimum Difficulty of a Job Schedulehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1335_minimum_difficulty_of_a_job_schedule/Solution.java
Find the City With the Smallest Number of Neighbors at a Threshold Distancehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1334_find_the_city_with_the_smallest_number_of_neighbors_at_a_threshold_distance/Solution.java
Filter Restaurants by Vegan-Friendly, Price and Distancehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1333_filter_restaurants_by_vegan_friendly_price_and_distance/Solution.java
Remove Palindromic Subsequenceshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1332_remove_palindromic_subsequences/Solution.java
Rank Transform of an Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1331_rank_transform_of_an_array/Solution.java
Reverse Subarray To Maximize Array Valuehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1330_reverse_subarray_to_maximize_array_value/Solution.java
Sort the Matrix Diagonallyhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1329_sort_the_matrix_diagonally/Solution.java
Break a Palindromehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1328_break_a_palindrome/Solution.java
Minimum Number of Taps to Open to Water a Gardenhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1326_minimum_number_of_taps_to_open_to_water_a_garden/Solution.java
Delete Leaves With a Given Valuehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1325_delete_leaves_with_a_given_value/Solution.java
Print Words Verticallyhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1324_print_words_vertically/Solution.java
Maximum 69 Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1323_maximum_69_number/Solution.java
Minimum Distance to Type a Word Using Two Fingershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1320_minimum_distance_to_type_a_word_using_two_fingers/Solution.java
Number of Operations to Make Network Connectedhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1319_number_of_operations_to_make_network_connected/Solution.java
Minimum Flips to Make a OR b Equal to chttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1318_minimum_flips_to_make_a_or_b_equal_to_c/Solution.java
Convert Integer to the Sum of Two No-Zero Integershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1317_convert_integer_to_the_sum_of_two_no_zero_integers/Solution.java
Distinct Echo Substringshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1316_distinct_echo_substrings/Solution.java
Sum of Nodes with Even-Valued Grandparenthttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1315_sum_of_nodes_with_even_valued_grandparent/Solution.java
Matrix Block Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1314_matrix_block_sum/Solution.java
Decompress Run-Length Encoded Listhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1313_decompress_run_length_encoded_list/Solution.java
Minimum Insertion Steps to Make a String Palindromehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1312_minimum_insertion_steps_to_make_a_string_palindrome/Solution.java
Get Watched Videos by Your Friendshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1311_get_watched_videos_by_your_friends/Solution.java
XOR Queries of a Subarrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1310_xor_queries_of_a_subarray/Solution.java
Decrypt String from Alphabet to Integer Mappinghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1309_decrypt_string_from_alphabet_to_integer_mapping/Solution.java
Verbal Arithmetic Puzzlehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1307_verbal_arithmetic_puzzle/Solution.java
Jump Game IIIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1306_jump_game_iii/Solution.java
All Elements in Two Binary Search Treeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1305_all_elements_in_two_binary_search_trees/Solution.java
Find N Unique Integers Sum up to Zerohttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1304_find_n_unique_integers_sum_up_to_zero/Solution.java
Deepest Leaves Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1302_deepest_leaves_sum/Solution.java
Number of Paths with Max Scorehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1301_1400/s1301_number_of_paths_with_max_score/Solution.java
Sum of Mutated Array Closest to Targethttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1300_sum_of_mutated_array_closest_to_target/Solution.java
Replace Elements with Greatest Element on Right Sidehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1299_replace_elements_with_greatest_element_on_right_side/Solution.java
Maximum Candies You Can Get from Boxeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1298_maximum_candies_you_can_get_from_boxes/Solution.java
Maximum Number of Occurrences of a Substringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1297_maximum_number_of_occurrences_of_a_substring/Solution.java
Divide Array in Sets of K Consecutive Numbershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1296_divide_array_in_sets_of_k_consecutive_numbers/Solution.java
Find Numbers with Even Number of Digitshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1295_find_numbers_with_even_number_of_digits/Solution.java
Shortest Path in a Grid with Obstacles Eliminationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1293_shortest_path_in_a_grid_with_obstacles_elimination/Solution.java
Maximum Side Length of a Square with Sum Less than or Equal to Thresholdhttps://patch-diff.githubusercontent.com/pekumar7/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
Sequential Digitshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1291_sequential_digits/Solution.java
Convert Binary Number in a Linked List to Integerhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1290_convert_binary_number_in_a_linked_list_to_integer/Solution.java
Minimum Falling Path Sum IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1289_minimum_falling_path_sum_ii/Solution.java
Remove Covered Intervalshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1288_remove_covered_intervals/Solution.java
Element Appearing More Than 25% In Sorted Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1287_element_appearing_more_than_25_in_sorted_array/Solution.java
Iterator for Combinationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1286_iterator_for_combination/CombinationIterator.java
Minimum Number of Flips to Convert Binary Matrix to Zero Matrixhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1284_minimum_number_of_flips_to_convert_binary_matrix_to_zero_matrix/Solution.java
Find the Smallest Divisor Given a Thresholdhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1283_find_the_smallest_divisor_given_a_threshold/Solution.java
Group the People Given the Group Size They Belong Tohttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1282_group_the_people_given_the_group_size_they_belong_to/Solution.java
Subtract the Product and Sum of Digits of an Integerhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1281_subtract_the_product_and_sum_of_digits_of_an_integer/Solution.java
Palindrome Partitioning IIIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1278_palindrome_partitioning_iii/Solution.java
Count Square Submatrices with All Oneshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1277_count_square_submatrices_with_all_ones/Solution.java
Number of Burgers with No Waste of Ingredientshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1276_number_of_burgers_with_no_waste_of_ingredients/Solution.java
Find Winner on a Tic Tac Toe Gamehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1275_find_winner_on_a_tic_tac_toe_game/Solution.java
Number of Ways to Stay in the Same Place After Some Stepshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1269_number_of_ways_to_stay_in_the_same_place_after_some_steps/Solution.java
Search Suggestions Systemhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1268_search_suggestions_system/Solution.java
Count Servers that Communicatehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1267_count_servers_that_communicate/Solution.java
Minimum Time Visiting All Pointshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1266_minimum_time_visiting_all_points/Solution.java
Minimum Moves to Move a Box to Their Target Locationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1263_minimum_moves_to_move_a_box_to_their_target_location/Solution.java
Greatest Sum Divisible by Threehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1262_greatest_sum_divisible_by_three/Solution.java
Find Elements in a Contaminated Binary Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1261_find_elements_in_a_contaminated_binary_tree/FindElements.java
Shift 2D Gridhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1260_shift_2d_grid/Solution.java
Maximum Score Words Formed by Lettershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1255_maximum_score_words_formed_by_letters/Solution.java
Number of Closed Islandshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1254_number_of_closed_islands/Solution.java
Reconstruct a 2-Row Binary Matrixhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1253_reconstruct_a_2_row_binary_matrix/Solution.java
Cells with Odd Values in a Matrixhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1252_cells_with_odd_values_in_a_matrix/Solution.java
Check If It Is a Good Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1250_check_if_it_is_a_good_array/Solution.java
Minimum Remove to Make Valid Parentheseshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1249_minimum_remove_to_make_valid_parentheses/Solution.java
Count Number of Nice Subarrayshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1248_count_number_of_nice_subarrays/Solution.java
Minimum Swaps to Make Strings Equalhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1247_minimum_swaps_to_make_strings_equal/Solution.java
Tiling a Rectangle with the Fewest Squareshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1240_tiling_a_rectangle_with_the_fewest_squares/Solution.java
Maximum Length of a Concatenated String with Unique Charactershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1239_maximum_length_of_a_concatenated_string_with_unique_characters/Solution.java
Circular Permutation in Binary Representationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1238_circular_permutation_in_binary_representation/Solution.java
Find Positive Integer Solution for a Given Equationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1237_find_positive_integer_solution_for_a_given_equation/Solution.java
Maximum Profit in Job Schedulinghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1235_maximum_profit_in_job_scheduling/Solution.java
Replace the Substring for Balanced Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1234_replace_the_substring_for_balanced_string/Solution.java
Remove Sub-Folders from the Filesystemhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1233_remove_sub_folders_from_the_filesystem/Solution.java
Check If It Is a Straight Linehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1232_check_if_it_is_a_straight_line/Solution.java
Airplane Seat Assignment Probabilityhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1227_airplane_seat_assignment_probability/Solution.java
The Dining Philosophershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1226_the_dining_philosophers/DiningPhilosophers.java
Maximum Equal Frequencyhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1224_maximum_equal_frequency/Solution.java
Dice Roll Simulationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1223_dice_roll_simulation/Solution.java
Queens That Can Attack the Kinghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1222_queens_that_can_attack_the_king/Solution.java
Split a String in Balanced Stringshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1221_split_a_string_in_balanced_strings/Solution.java
Count Vowels Permutationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1220_count_vowels_permutation/Solution.java
Path with Maximum Goldhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1219_path_with_maximum_gold/Solution.java
Longest Arithmetic Subsequence of Given Differencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1218_longest_arithmetic_subsequence_of_given_difference/Solution.java
Minimum Cost to Move Chips to The Same Positionhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1217_minimum_cost_to_move_chips_to_the_same_position/Solution.java
Minimum Moves to Reach Target with Rotationshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1210_minimum_moves_to_reach_target_with_rotations/Solution.java
Remove All Adjacent Duplicates in String IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1209_remove_all_adjacent_duplicates_in_string_ii/Solution.java
Get Equal Substrings Within Budgethttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1208_get_equal_substrings_within_budget/Solution.java
Unique Number of Occurrenceshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1207_unique_number_of_occurrences/Solution.java
Design Skiplisthttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1206_design_skiplist/Skiplist.java
Sort Items by Groups Respecting Dependencieshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1203_sort_items_by_groups_respecting_dependencies/Solution.java
Smallest String With Swapshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1202_smallest_string_with_swaps/Solution.java
Ugly Number IIIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1201_1300/s1201_ugly_number_iii/Solution.java
Minimum Absolute Differencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1200_minimum_absolute_difference/Solution.java
Fizz Buzz Multithreadedhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1195_fizz_buzz_multithreaded/FizzBuzz.java
Critical Connections in a Networkhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1192_critical_connections_in_a_network/Solution.java
K-Concatenation Maximum Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1191_k_concatenation_maximum_sum/Solution.java
Reverse Substrings Between Each Pair of Parentheseshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1190_reverse_substrings_between_each_pair_of_parentheses/Solution.java
Maximum Number of Balloonshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1189_maximum_number_of_balloons/Solution.java
Make Array Strictly Increasinghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1187_make_array_strictly_increasing/Solution.java
Maximum Subarray Sum with One Deletionhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1186_maximum_subarray_sum_with_one_deletion/Solution.java
Day of the Weekhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1185_day_of_the_week/Solution.java
Distance Between Bus Stopshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1184_distance_between_bus_stops/Solution.java
Reformat Department Tablehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1179_reformat_department_table/script.sql
Number of Valid Words for Each Puzzlehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1178_number_of_valid_words_for_each_puzzle/Solution.java
Can Make Palindrome from Substringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1177_can_make_palindrome_from_substring/Solution.java
Prime Arrangementshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1175_prime_arrangements/Solution.java
Dinner Plate Stackshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1172_dinner_plate_stacks/DinnerPlates.java
Remove Zero Sum Consecutive Nodes from Linked Listhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1171_remove_zero_sum_consecutive_nodes_from_linked_list/Solution.java
Compare Strings by Frequency of the Smallest Characterhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1170_compare_strings_by_frequency_of_the_smallest_character/Solution.java
Invalid Transactionshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1169_invalid_transactions/Solution.java
Last Substring in Lexicographical Orderhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1163_last_substring_in_lexicographical_order/Solution.java
As Far from Land as Possiblehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1162_as_far_from_land_as_possible/Solution.java
Maximum Level Sum of a Binary Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1161_maximum_level_sum_of_a_binary_tree/Solution.java
Find Words That Can Be Formed by Charactershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1160_find_words_that_can_be_formed_by_characters/Solution.java
Market Analysis Ihttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1158_market_analysis_i/script.sql
Online Majority Element In Subarrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1157_online_majority_element_in_subarray/MajorityChecker.java
Swap For Longest Repeated Character Substringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1156_swap_for_longest_repeated_character_substring/Solution.java
Number of Dice Rolls With Target Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1155_number_of_dice_rolls_with_target_sum/Solution.java
Day of the Yearhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1154_day_of_the_year/Solution.java
Article Views Ihttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1148_article_views_i/script.sql
Longest Chunked Palindrome Decompositionhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1147_longest_chunked_palindrome_decomposition/Solution.java
Snapshot Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1146_snapshot_array/SnapshotArray.java
Binary Tree Coloring Gamehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1145_binary_tree_coloring_game/Solution.java
Decrease Elements To Make Array Zigzaghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1144_decrease_elements_to_make_array_zigzag/Solution.java
Longest Common Subsequencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java
User Activity for the Past 30 Days Ihttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1141_user_activity_for_the_past_30_days_i/script.sql
Stone Game IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1140_stone_game_ii/Solution.java
Largest 1-Bordered Squarehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1139_largest_1_bordered_square/Solution.java
Alphabet Board Pathhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1138_alphabet_board_path/Solution.java
N-th Tribonacci Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1137_n_th_tribonacci_number/Solution.java
Maximum of Absolute Value Expressionhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1131_maximum_of_absolute_value_expression/Solution.java
Minimum Cost Tree From Leaf Valueshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1130_minimum_cost_tree_from_leaf_values/Solution.java
Shortest Path with Alternating Colorshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1129_shortest_path_with_alternating_colors/Solution.java
Number of Equivalent Domino Pairshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1128_number_of_equivalent_domino_pairs/Solution.java
Smallest Sufficient Teamhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1125_smallest_sufficient_team/Solution.java
Longest Well-Performing Intervalhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1124_longest_well_performing_interval/Solution.java
Lowest Common Ancestor of Deepest Leaveshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1123_lowest_common_ancestor_of_deepest_leaves/Solution.java
Relative Sort Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1122_relative_sort_array/Solution.java
Building H2Ohttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1117_building_h2o/H2O.java
Print Zero Even Oddhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1116_print_zero_even_odd/ZeroEvenOdd.java
Print FooBar Alternatelyhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1115_print_foobar_alternately/FooBar.java
Print in Orderhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1114_print_in_order/Foo.java
Maximum Nesting Depth of Two Valid Parentheses Stringshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1111_maximum_nesting_depth_of_two_valid_parentheses_strings/Solution.java
Delete Nodes And Return Foresthttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1110_delete_nodes_and_return_forest/Solution.java
Corporate Flight Bookingshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1109_corporate_flight_bookings/Solution.java
Defanging an IP Addresshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1108_defanging_an_ip_address/Solution.java
Parsing A Boolean Expressionhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1106_parsing_a_boolean_expression/Solution.java
Filling Bookcase Shelveshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1105_filling_bookcase_shelves/Solution.java
Path In Zigzag Labelled Binary Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1104_path_in_zigzag_labelled_binary_tree/Solution.java
Distribute Candies to Peoplehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1101_1200/s1103_distribute_candies_to_people/Solution.java
Brace Expansion IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1096_brace_expansion_ii/Solution.java
Find in Mountain Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1095_find_in_mountain_array/Solution.java
Car Poolinghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1094_car_pooling/Solution.java
Statistics from a Large Samplehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1093_statistics_from_a_large_sample/Solution.java
Shortest Common Supersequencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1092_shortest_common_supersequence/Solution.java
Shortest Path in Binary Matrixhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1091_shortest_path_in_binary_matrix/Solution.java
Largest Values From Labelshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1090_largest_values_from_labels/Solution.java
Duplicate Zeroshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1089_duplicate_zeros/Solution.java
Sales Analysis IIIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1084_sales_analysis_iii/script.sql
Smallest Subsequence of Distinct Charactershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1081_smallest_subsequence_of_distinct_characters/Solution.java
Insufficient Nodes in Root to Leaf Pathshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1080_insufficient_nodes_in_root_to_leaf_paths/Solution.java
Letter Tile Possibilitieshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1079_letter_tile_possibilities/Solution.java
Occurrences After Bigramhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1078_occurrences_after_bigram/Solution.java
Number of Submatrices That Sum to Targethttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1074_number_of_submatrices_that_sum_to_target/Solution.java
Adding Two Negabinary Numbershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1073_adding_two_negabinary_numbers/Solution.java
Flip Columns For Maximum Number of Equal Rowshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1072_flip_columns_for_maximum_number_of_equal_rows/Solution.java
Greatest Common Divisor of Stringshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1071_greatest_common_divisor_of_strings/Solution.java
Distant Barcodeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1054_distant_barcodes/Solution.java
Previous Permutation With One Swaphttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1053_previous_permutation_with_one_swap/Solution.java
Grumpy Bookstore Ownerhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1052_grumpy_bookstore_owner/Solution.java
Height Checkerhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1051_height_checker/Solution.java
Actors and Directors Who Cooperated At Least Three Timeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1050_actors_and_directors_who_cooperated_at_least_three_times/script.sql
Last Stone Weight IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1049_last_stone_weight_ii/Solution.java
Longest String Chainhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1048_longest_string_chain/Solution.java
Remove All Adjacent Duplicates In Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1047_remove_all_adjacent_duplicates_in_string/Solution.java
Last Stone Weighthttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1046_last_stone_weight/Solution.java
Longest Duplicate Substringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1044_longest_duplicate_substring/Solution.java
Partition Array for Maximum Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1043_partition_array_for_maximum_sum/Solution.java
Flower Planting With No Adjacenthttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1042_flower_planting_with_no_adjacent/Solution.java
Robot Bounded In Circlehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1041_robot_bounded_in_circle/Solution.java
Moving Stones Until Consecutive IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1040_moving_stones_until_consecutive_ii/Solution.java
Minimum Score Triangulation of Polygonhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1039_minimum_score_triangulation_of_polygon/Solution.java
Binary Search Tree to Greater Sum Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1038_binary_search_tree_to_greater_sum_tree/Solution.java
Valid Boomeranghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1037_valid_boomerang/Solution.java
Escape a Large Mazehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1036_escape_a_large_maze/Solution.java
Uncrossed Lineshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1035_uncrossed_lines/Solution.java
Coloring A Borderhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1034_coloring_a_border/Solution.java
Moving Stones Until Consecutivehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1033_moving_stones_until_consecutive/Solution.java
Stream of Charactershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1032_stream_of_characters/StreamChecker.java
Maximum Sum of Two Non-Overlapping Subarrayshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1031_maximum_sum_of_two_non_overlapping_subarrays/Solution.java
Matrix Cells in Distance Orderhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1030_matrix_cells_in_distance_order/Solution.java
Two City Schedulinghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1029_two_city_scheduling/Solution.java
Recover a Tree From Preorder Traversalhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1028_recover_a_tree_from_preorder_traversal/Solution.java
Longest Arithmetic Subsequencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1027_longest_arithmetic_subsequence/Solution.java
Maximum Difference Between Node and Ancestorhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1026_maximum_difference_between_node_and_ancestor/Solution.java
Divisor Gamehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1025_divisor_game/Solution.java
Video Stitchinghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1024_video_stitching/Solution.java
Camelcase Matchinghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1023_camelcase_matching/Solution.java
Sum of Root To Leaf Binary Numbershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1022_sum_of_root_to_leaf_binary_numbers/Solution.java
Remove Outermost Parentheseshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1021_remove_outermost_parentheses/Solution.java
Number of Enclaveshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1020_number_of_enclaves/Solution.java
Next Greater Node In Linked Listhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1019_next_greater_node_in_linked_list/Solution.java
Binary Prefix Divisible By 5https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1018_binary_prefix_divisible_by_5/Solution.java
Convert to Base -2https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1017_convert_to_base_2/Solution.java
Binary String With Substrings Representing 1 To Nhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1016_binary_string_with_substrings_representing_1_to_n/Solution.java
Smallest Integer Divisible by Khttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1015_smallest_integer_divisible_by_k/Solution.java
Best Sightseeing Pairhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1014_best_sightseeing_pair/Solution.java
Partition Array Into Three Parts With Equal Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1013_partition_array_into_three_parts_with_equal_sum/Solution.java
Numbers With Repeated Digitshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1012_numbers_with_repeated_digits/Solution.java
Capacity To Ship Packages Within D Dayshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1011_capacity_to_ship_packages_within_d_days/Solution.java
Pairs of Songs With Total Durations Divisible by 60https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1010_pairs_of_songs_with_total_durations_divisible_by_60/Solution.java
Complement of Base 10 Integerhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1009_complement_of_base_10_integer/Solution.java
Construct Binary Search Tree from Preorder Traversalhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1008_construct_binary_search_tree_from_preorder_traversal/Solution.java
Minimum Domino Rotations For Equal Rowhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1007_minimum_domino_rotations_for_equal_row/Solution.java
Clumsy Factorialhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1006_clumsy_factorial/Solution.java
Maximize Sum Of Array After K Negationshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1005_maximize_sum_of_array_after_k_negations/Solution.java
Max Consecutive Ones IIIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1004_max_consecutive_ones_iii/Solution.java
Check If Word Is Valid After Substitutionshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1003_check_if_word_is_valid_after_substitutions/Solution.java
Find Common Charactershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1002_find_common_characters/Solution.java
Grid Illuminationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g1001_1100/s1001_grid_illumination/Solution.java
Minimum Cost to Merge Stoneshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s1000_minimum_cost_to_merge_stones/Solution.java
Available Captures for Rookhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0999_available_captures_for_rook/Solution.java
Maximum Binary Tree IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0998_maximum_binary_tree_ii/Solution.java
Find the Town Judgehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0997_find_the_town_judge/Solution.java
Number of Squareful Arrayshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0996_number_of_squareful_arrays/Solution.java
Minimum Number of K Consecutive Bit Flipshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0995_minimum_number_of_k_consecutive_bit_flips/Solution.java
Rotting Orangeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0994_rotting_oranges/Solution.java
Cousins in Binary Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0993_cousins_in_binary_tree/Solution.java
Subarrays with K Different Integershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0992_subarrays_with_k_different_integers/Solution.java
Broken Calculatorhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0991_broken_calculator/Solution.java
Satisfiability of Equality Equationshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0990_satisfiability_of_equality_equations/Solution.java
Add to Array-Form of Integerhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0989_add_to_array_form_of_integer/Solution.java
Smallest String Starting From Leafhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0988_smallest_string_starting_from_leaf/Solution.java
Vertical Order Traversal of a Binary Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0987_vertical_order_traversal_of_a_binary_tree/Solution.java
Interval List Intersectionshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0986_interval_list_intersections/Solution.java
Sum of Even Numbers After Querieshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0985_sum_of_even_numbers_after_queries/Solution.java
String Without AAA or BBBhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0984_string_without_aaa_or_bbb/Solution.java
Minimum Cost For Ticketshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0983_minimum_cost_for_tickets/Solution.java
Triples with Bitwise AND Equal To Zerohttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0982_triples_with_bitwise_and_equal_to_zero/Solution.java
Time Based Key-Value Storehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0981_time_based_key_value_store/TimeMap.java
Unique Paths IIIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0980_unique_paths_iii/Solution.java
Distribute Coins in Binary Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0979_distribute_coins_in_binary_tree/Solution.java
Longest Turbulent Subarrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0978_longest_turbulent_subarray/Solution.java
Squares of a Sorted Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0977_squares_of_a_sorted_array/Solution.java
Largest Perimeter Trianglehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0976_largest_perimeter_triangle/Solution.java
Odd Even Jumphttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0975_odd_even_jump/Solution.java
Subarray Sums Divisible by Khttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0974_subarray_sums_divisible_by_k/Solution.java
K Closest Points to Originhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0973_k_closest_points_to_origin/Solution.java
Equal Rational Numbershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0972_equal_rational_numbers/Solution.java
Flip Binary Tree To Match Preorder Traversalhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0971_flip_binary_tree_to_match_preorder_traversal/Solution.java
Powerful Integershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0970_powerful_integers/Solution.java
Pancake Sortinghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0969_pancake_sorting/Solution.java
Binary Tree Camerashttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0968_binary_tree_cameras/Solution.java
Numbers With Same Consecutive Differenceshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0967_numbers_with_same_consecutive_differences/Solution.java
Vowel Spellcheckerhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0966_vowel_spellchecker/Solution.java
Univalued Binary Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0965_univalued_binary_tree/Solution.java
Least Operators to Express Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0964_least_operators_to_express_number/Solution.java
Minimum Area Rectangle IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0963_minimum_area_rectangle_ii/Solution.java
Maximum Width Ramphttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0962_maximum_width_ramp/Solution.java
N-Repeated Element in Size 2N Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0961_n_repeated_element_in_size_2n_array/Solution.java
Delete Columns to Make Sorted IIIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0960_delete_columns_to_make_sorted_iii/Solution.java
Regions Cut By Slasheshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0959_regions_cut_by_slashes/Solution.java
Check Completeness of a Binary Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0958_check_completeness_of_a_binary_tree/Solution.java
Prison Cells After N Dayshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0957_prison_cells_after_n_days/Solution.java
Tallest Billboardhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0956_tallest_billboard/Solution.java
Delete Columns to Make Sorted IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0955_delete_columns_to_make_sorted_ii/Solution.java
Array of Doubled Pairshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0954_array_of_doubled_pairs/Solution.java
Verifying an Alien Dictionaryhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0953_verifying_an_alien_dictionary/Solution.java
Largest Component Size by Common Factorhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0952_largest_component_size_by_common_factor/Solution.java
Flip Equivalent Binary Treeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0951_flip_equivalent_binary_trees/Solution.java
Reveal Cards In Increasing Orderhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0950_reveal_cards_in_increasing_order/Solution.java
Largest Time for Given Digitshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0949_largest_time_for_given_digits/Solution.java
Bag of Tokenshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0948_bag_of_tokens/Solution.java
Most Stones Removed with Same Row or Columnhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0947_most_stones_removed_with_same_row_or_column/Solution.java
Validate Stack Sequenceshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0946_validate_stack_sequences/Solution.java
Minimum Increment to Make Array Uniquehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0945_minimum_increment_to_make_array_unique/Solution.java
Delete Columns to Make Sortedhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0944_delete_columns_to_make_sorted/Solution.java
Find the Shortest Superstringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0943_find_the_shortest_superstring/Solution.java
DI String Matchhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0942_di_string_match/Solution.java
Valid Mountain Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0941_valid_mountain_array/Solution.java
Distinct Subsequences IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0940_distinct_subsequences_ii/Solution.java
Minimum Area Rectanglehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0939_minimum_area_rectangle/Solution.java
Range Sum of BSThttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0938_range_sum_of_bst/Solution.java
Reorder Data in Log Fileshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0937_reorder_data_in_log_files/Solution.java
Stamping The Sequencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0936_stamping_the_sequence/Solution.java
Knight Dialerhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0935_knight_dialer/Solution.java
Shortest Bridgehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0934_shortest_bridge/Solution.java
Number of Recent Callshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0933_number_of_recent_calls/RecentCounter.java
Beautiful Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0932_beautiful_array/Solution.java
Minimum Falling Path Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0931_minimum_falling_path_sum/Solution.java
Binary Subarrays With Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0930_binary_subarrays_with_sum/Solution.java
Unique Email Addresseshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0929_unique_email_addresses/Solution.java
Minimize Malware Spread IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0928_minimize_malware_spread_ii/Solution.java
Three Equal Partshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0927_three_equal_parts/Solution.java
Flip String to Monotone Increasinghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0926_flip_string_to_monotone_increasing/Solution.java
Long Pressed Namehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0925_long_pressed_name/Solution.java
Minimize Malware Spreadhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0924_minimize_malware_spread/Solution.java
3Sum With Multiplicityhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0923_3sum_with_multiplicity/Solution.java
Sort Array By Parity IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0922_sort_array_by_parity_ii/Solution.java
Minimum Add to Make Parentheses Validhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0921_minimum_add_to_make_parentheses_valid/Solution.java
Number of Music Playlistshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0920_number_of_music_playlists/Solution.java
Complete Binary Tree Inserterhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0919_complete_binary_tree_inserter/CBTInserter.java
Maximum Sum Circular Subarrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0918_maximum_sum_circular_subarray/Solution.java
Reverse Only Lettershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0917_reverse_only_letters/Solution.java
Word Subsetshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0916_word_subsets/Solution.java
Partition Array into Disjoint Intervalshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0915_partition_array_into_disjoint_intervals/Solution.java
X of a Kind in a Deck of Cardshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0914_x_of_a_kind_in_a_deck_of_cards/Solution.java
Cat and Mousehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0913_cat_and_mouse/Solution.java
Sort an Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0912_sort_an_array/Solution.java
Online Electionhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0911_online_election/TopVotedCandidate.java
Smallest Range IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0910_smallest_range_ii/Solution.java
Snakes and Laddershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0909_snakes_and_ladders/Solution.java
Smallest Range Ihttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0908_smallest_range_i/Solution.java
Sum of Subarray Minimumshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0907_sum_of_subarray_minimums/Solution.java
Super Palindromeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0906_super_palindromes/Solution.java
Sort Array By Parityhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0905_sort_array_by_parity/Solution.java
Fruit Into Basketshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0904_fruit_into_baskets/Solution.java
Valid Permutations for DI Sequencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0903_valid_permutations_for_di_sequence/Solution.java
Numbers At Most N Given Digit Sethttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0902_numbers_at_most_n_given_digit_set/Solution.java
Online Stock Spanhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0901_1000/s0901_online_stock_span/StockSpanner.java
RLE Iteratorhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0900_rle_iterator/RLEIterator.java
Orderly Queuehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0899_orderly_queue/Solution.java
Bitwise ORs of Subarrayshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0898_bitwise_ors_of_subarrays/Solution.java
Increasing Order Search Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0897_increasing_order_search_tree/Solution.java
Monotonic Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0896_monotonic_array/Solution.java
Maximum Frequency Stackhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0895_maximum_frequency_stack/FreqStack.java
All Possible Full Binary Treeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0894_all_possible_full_binary_trees/Solution.java
Groups of Special-Equivalent Stringshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0893_groups_of_special_equivalent_strings/Solution.java
Surface Area of 3D Shapeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0892_surface_area_of_3d_shapes/Solution.java
Sum of Subsequence Widthshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0891_sum_of_subsequence_widths/Solution.java
Find and Replace Patternhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0890_find_and_replace_pattern/Solution.java
Construct Binary Tree from Preorder and Postorder Traversalhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0889_construct_binary_tree_from_preorder_and_postorder_traversal/Solution.java
Fair Candy Swaphttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0888_fair_candy_swap/Solution.java
Super Egg Drophttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0887_super_egg_drop/Solution.java
Possible Bipartitionhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0886_possible_bipartition/Solution.java
Spiral Matrix IIIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0885_spiral_matrix_iii/Solution.java
Uncommon Words from Two Sentenceshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0884_uncommon_words_from_two_sentences/Solution.java
Projection Area of 3D Shapeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0883_projection_area_of_3d_shapes/Solution.java
Reachable Nodes In Subdivided Graphhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0882_reachable_nodes_in_subdivided_graph/Solution.java
Boats to Save Peoplehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0881_boats_to_save_people/Solution.java
Decoded String at Indexhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0880_decoded_string_at_index/Solution.java
Profitable Schemeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0879_profitable_schemes/Solution.java
Nth Magical Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0878_nth_magical_number/Solution.java
Stone Gamehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0877_stone_game/Solution.java
Middle of the Linked Listhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0876_middle_of_the_linked_list/Solution.java
Koko Eating Bananashttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0875_koko_eating_bananas/Solution.java
Walking Robot Simulationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0874_walking_robot_simulation/Solution.java
Length of Longest Fibonacci Subsequencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0873_length_of_longest_fibonacci_subsequence/Solution.java
Leaf-Similar Treeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0872_leaf_similar_trees/Solution.java
Minimum Number of Refueling Stopshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0871_minimum_number_of_refueling_stops/Solution.java
Advantage Shufflehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0870_advantage_shuffle/Solution.java
Reordered Power of 2https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0869_reordered_power_of_2/Solution.java
Binary Gaphttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0868_binary_gap/Solution.java
Transpose Matrixhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0867_transpose_matrix/Solution.java
Prime Palindromehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0866_prime_palindrome/Solution.java
Smallest Subtree with all the Deepest Nodeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0865_smallest_subtree_with_all_the_deepest_nodes/Solution.java
Shortest Path to Get All Keyshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0864_shortest_path_to_get_all_keys/Solution.java
All Nodes Distance K in Binary Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0863_all_nodes_distance_k_in_binary_tree/Solution.java
Shortest Subarray with Sum at Least Khttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0862_shortest_subarray_with_sum_at_least_k/Solution.java
Score After Flipping Matrixhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0861_score_after_flipping_matrix/Solution.java
Lemonade Changehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0860_lemonade_change/Solution.java
Buddy Stringshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0859_buddy_strings/Solution.java
Mirror Reflectionhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0858_mirror_reflection/Solution.java
Minimum Cost to Hire K Workershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0857_minimum_cost_to_hire_k_workers/Solution.java
Score of Parentheseshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0856_score_of_parentheses/Solution.java
Exam Roomhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0855_exam_room/ExamRoom.java
K-Similar Stringshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0854_k_similar_strings/Solution.java
Car Fleethttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0853_car_fleet/Solution.java
Peak Index in a Mountain Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0852_peak_index_in_a_mountain_array/Solution.java
Loud and Richhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0851_loud_and_rich/Solution.java
Rectangle Area IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0850_rectangle_area_ii/Solution.java
Maximize Distance to Closest Personhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0849_maximize_distance_to_closest_person/Solution.java
Shifting Lettershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0848_shifting_letters/Solution.java
Shortest Path Visiting All Nodeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0847_shortest_path_visiting_all_nodes/Solution.java
Hand of Straightshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0846_hand_of_straights/Solution.java
Longest Mountain in Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0845_longest_mountain_in_array/Solution.java
Backspace String Comparehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0844_backspace_string_compare/Solution.java
Guess the Wordhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0843_guess_the_word/Solution.java
Split Array into Fibonacci Sequencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0842_split_array_into_fibonacci_sequence/Solution.java
Keys and Roomshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0841_keys_and_rooms/Solution.java
Magic Squares In Gridhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0840_magic_squares_in_grid/Solution.java
Similar String Groupshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0839_similar_string_groups/Solution.java
Push Dominoeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0838_push_dominoes/Solution.java
New 21 Gamehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0837_new_21_game/Solution.java
Rectangle Overlaphttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0836_rectangle_overlap/Solution.java
Image Overlaphttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0835_image_overlap/Solution.java
Sum of Distances in Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0834_sum_of_distances_in_tree/Solution.java
Find And Replace in Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0833_find_and_replace_in_string/Solution.java
Flipping an Imagehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0832_flipping_an_image/Solution.java
Masking Personal Informationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0831_masking_personal_information/Solution.java
Positions of Large Groupshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0830_positions_of_large_groups/Solution.java
Consecutive Numbers Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0829_consecutive_numbers_sum/Solution.java
Count Unique Characters of All Substrings of a Given Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0828_count_unique_characters_of_all_substrings_of_a_given_string/Solution.java
Making A Large Islandhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0827_making_a_large_island/Solution.java
Most Profit Assigning Workhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0826_most_profit_assigning_work/Solution.java
Friends Of Appropriate Ageshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0825_friends_of_appropriate_ages/Solution.java
Goat Latinhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0824_goat_latin/Solution.java
Binary Trees With Factorshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0823_binary_trees_with_factors/Solution.java
Card Flipping Gamehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0822_card_flipping_game/Solution.java
Shortest Distance to a Characterhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0821_shortest_distance_to_a_character/Solution.java
Short Encoding of Wordshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0820_short_encoding_of_words/Solution.java
Most Common Wordhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0819_most_common_word/Solution.java
Race Carhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0818_race_car/Solution.java
Linked List Componentshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0817_linked_list_components/Solution.java
Ambiguous Coordinateshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0816_ambiguous_coordinates/Solution.java
Bus Routeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0815_bus_routes/Solution.java
Binary Tree Pruninghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0814_binary_tree_pruning/Solution.java
Largest Sum of Averageshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0813_largest_sum_of_averages/Solution.java
Largest Triangle Areahttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0812_largest_triangle_area/Solution.java
Subdomain Visit Counthttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0811_subdomain_visit_count/Solution.java
Chalkboard XOR Gamehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0810_chalkboard_xor_game/Solution.java
Expressive Wordshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0809_expressive_words/Solution.java
Soup Servingshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0808_soup_servings/Solution.java
Max Increase to Keep City Skylinehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0807_max_increase_to_keep_city_skyline/Solution.java
Number of Lines To Write Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0806_number_of_lines_to_write_string/Solution.java
Split Array With Same Averagehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0805_split_array_with_same_average/Solution.java
Unique Morse Code Wordshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0804_unique_morse_code_words/Solution.java
Bricks Falling When Hithttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0803_bricks_falling_when_hit/Solution.java
Find Eventual Safe Stateshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0802_find_eventual_safe_states/Solution.java
Minimum Swaps To Make Sequences Increasinghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0801_0900/s0801_minimum_swaps_to_make_sequences_increasing/Solution.java
Champagne Towerhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0799_champagne_tower/Solution.java
Smallest Rotation with Highest Scorehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0798_smallest_rotation_with_highest_score/Solution.java
All Paths From Source to Targethttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0797_all_paths_from_source_to_target/Solution.java
Rotate Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0796_rotate_string/Solution.java
Number of Subarrays with Bounded Maximumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0795_number_of_subarrays_with_bounded_maximum/Solution.java
Valid Tic-Tac-Toe Statehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0794_valid_tic_tac_toe_state/Solution.java
Preimage Size of Factorial Zeroes Functionhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0793_preimage_size_of_factorial_zeroes_function/Solution.java
Number of Matching Subsequenceshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0792_number_of_matching_subsequences/Solution.java
Custom Sort Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0791_custom_sort_string/Solution.java
Domino and Tromino Tilinghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0790_domino_and_tromino_tiling/Solution.java
Escape The Ghostshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0789_escape_the_ghosts/Solution.java
Rotated Digitshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0788_rotated_digits/Solution.java
Cheapest Flights Within K Stopshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0787_cheapest_flights_within_k_stops/Solution.java
K-th Smallest Prime Fractionhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0786_k_th_smallest_prime_fraction/Solution.java
Is Graph Bipartite?https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0785_is_graph_bipartite/Solution.java
Letter Case Permutationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0784_letter_case_permutation/Solution.java
Minimum Distance Between BST Nodeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0783_minimum_distance_between_bst_nodes/Solution.java
Transform to Chessboardhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0782_transform_to_chessboard/Solution.java
Rabbits in Foresthttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0781_rabbits_in_forest/Solution.java
Reaching Pointshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0780_reaching_points/Solution.java
K-th Symbol in Grammarhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0779_k_th_symbol_in_grammar/Solution.java
Swim in Rising Waterhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0778_swim_in_rising_water/Solution.java
Swap Adjacent in LR Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0777_swap_adjacent_in_lr_string/Solution.java
Global and Local Inversionshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0775_global_and_local_inversions/Solution.java
Sliding Puzzlehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0773_sliding_puzzle/Solution.java
Jewels and Stoneshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0771_jewels_and_stones/Solution.java
Basic Calculator IVhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0770_basic_calculator_iv/Solution.java
Max Chunks To Make Sortedhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0769_max_chunks_to_make_sorted/Solution.java
Max Chunks To Make Sorted IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0768_max_chunks_to_make_sorted_ii/Solution.java
Reorganize Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0767_reorganize_string/Solution.java
Toeplitz Matrixhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0766_toeplitz_matrix/Solution.java
Couples Holding Handshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0765_couples_holding_hands/Solution.java
Largest Plus Signhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0764_largest_plus_sign/Solution.java
Partition Labelshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0763_partition_labels/Solution.java
Prime Number of Set Bits in Binary Representationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0762_prime_number_of_set_bits_in_binary_representation/Solution.java
Special Binary Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0761_special_binary_string/Solution.java
Set Intersection Size At Least Twohttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0757_set_intersection_size_at_least_two/Solution.java
Pyramid Transition Matrixhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0756_pyramid_transition_matrix/Solution.java
Reach a Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0754_reach_a_number/Solution.java
Cracking the Safehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0753_cracking_the_safe/Solution.java
Open the Lockhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0752_open_the_lock/Solution.java
Contain Virushttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0749_contain_virus/Solution.java
Shortest Completing Wordhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0748_shortest_completing_word/Solution.java
Largest Number At Least Twice of Othershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0747_largest_number_at_least_twice_of_others/Solution.java
Min Cost Climbing Stairshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0746_min_cost_climbing_stairs/Solution.java
Prefix and Suffix Searchhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0745_prefix_and_suffix_search/WordFilter.java
Find Smallest Letter Greater Than Targethttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0744_find_smallest_letter_greater_than_target/Solution.java
Network Delay Timehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0743_network_delay_time/Solution.java
Cherry Pickuphttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0741_cherry_pickup/Solution.java
Delete and Earnhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0740_delete_and_earn/Solution.java
Daily Temperatureshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0739_daily_temperatures/Solution.java
Monotone Increasing Digitshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0738_monotone_increasing_digits/Solution.java
Parse Lisp Expressionhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0736_parse_lisp_expression/Solution.java
Asteroid Collisionhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0735_asteroid_collision/Solution.java
Flood Fillhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0733_flood_fill/Solution.java
My Calendar IIIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0732_my_calendar_iii/MyCalendarThree.java
My Calendar IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0731_my_calendar_ii/MyCalendarTwo.java
Count Different Palindromic Subsequenceshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0730_count_different_palindromic_subsequences/Solution.java
My Calendar Ihttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0729_my_calendar_i/MyCalendar.java
Self Dividing Numbershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0728_self_dividing_numbers/Solution.java
Number of Atomshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0726_number_of_atoms/Solution.java
Split Linked List in Partshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0725_split_linked_list_in_parts/Solution.java
Find Pivot Indexhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0724_find_pivot_index/Solution.java
Remove Commentshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0722_remove_comments/Solution.java
Accounts Mergehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0721_accounts_merge/Solution.java
Longest Word in Dictionaryhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0720_longest_word_in_dictionary/Solution.java
Find K-th Smallest Pair Distancehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0719_find_k_th_smallest_pair_distance/Solution.java
Maximum Length of Repeated Subarrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0718_maximum_length_of_repeated_subarray/Solution.java
1-bit and 2-bit Charactershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0717_1_bit_and_2_bit_characters/Solution.java
Range Modulehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0715_range_module/RangeModule.java
Best Time to Buy and Sell Stock with Transaction Feehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0714_best_time_to_buy_and_sell_stock_with_transaction_fee/Solution.java
Subarray Product Less Than Khttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0713_subarray_product_less_than_k/Solution.java
Minimum ASCII Delete Sum for Two Stringshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0712_minimum_ascii_delete_sum_for_two_strings/Solution.java
Random Pick with Blacklisthttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0710_random_pick_with_blacklist/Solution.java
To Lower Casehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0709_to_lower_case/Solution.java
Design Linked Listhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0707_design_linked_list/MyLinkedList.java
Design HashMaphttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0706_design_hashmap/MyHashMap.java
Design HashSethttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0705_design_hashset/MyHashSet.java
Binary Searchhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0704_binary_search/Solution.java
Kth Largest Element in a Streamhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0703_kth_largest_element_in_a_stream/KthLargest.java
Insert into a Binary Search Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0701_0800/s0701_insert_into_a_binary_search_tree/Solution.java
Search in a Binary Search Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0700_search_in_a_binary_search_tree/Solution.java
Falling Squareshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0699_falling_squares/Solution.java
Partition to K Equal Sum Subsetshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0698_partition_to_k_equal_sum_subsets/Solution.java
Degree of an Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0697_degree_of_an_array/Solution.java
Count Binary Substringshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0696_count_binary_substrings/Solution.java
Max Area of Islandhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0695_max_area_of_island/Solution.java
Binary Number with Alternating Bitshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0693_binary_number_with_alternating_bits/Solution.java
Top K Frequent Wordshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0692_top_k_frequent_words/Solution.java
Stickers to Spell Wordhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0691_stickers_to_spell_word/Solution.java
Employee Importancehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0690_employee_importance/Solution.java
Maximum Sum of 3 Non-Overlapping Subarrayshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0689_maximum_sum_of_3_non_overlapping_subarrays/Solution.java
Knight Probability in Chessboardhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0688_knight_probability_in_chessboard/Solution.java
Longest Univalue Pathhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0687_longest_univalue_path/Solution.java
Repeated String Matchhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0686_repeated_string_match/Solution.java
Redundant Connection IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0685_redundant_connection_ii/Solution.java
Redundant Connectionhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0684_redundant_connection/Solution.java
Baseball Gamehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0682_baseball_game/Solution.java
Valid Palindrome IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0680_valid_palindrome_ii/Solution.java
24 Gamehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0679_24_game/Solution.java
Valid Parenthesis Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0678_valid_parenthesis_string/Solution.java
Map Sum Pairshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0677_map_sum_pairs/MapSum.java
Implement Magic Dictionaryhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0676_implement_magic_dictionary/MagicDictionary.java
Cut Off Trees for Golf Eventhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0675_cut_off_trees_for_golf_event/Solution.java
Longest Continuous Increasing Subsequencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0674_longest_continuous_increasing_subsequence/Solution.java
Number of Longest Increasing Subsequencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0673_number_of_longest_increasing_subsequence/Solution.java
Bulb Switcher IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0672_bulb_switcher_ii/Solution.java
Second Minimum Node In a Binary Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0671_second_minimum_node_in_a_binary_tree/Solution.java
Maximum Swaphttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0670_maximum_swap/Solution.java
Trim a Binary Search Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0669_trim_a_binary_search_tree/Solution.java
Kth Smallest Number in Multiplication Tablehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0668_kth_smallest_number_in_multiplication_table/Solution.java
Beautiful Arrangement IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0667_beautiful_arrangement_ii/Solution.java
Non-decreasing Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0665_non_decreasing_array/Solution.java
Strange Printerhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0664_strange_printer/Solution.java
Maximum Width of Binary Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0662_maximum_width_of_binary_tree/Solution.java
Image Smootherhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0661_image_smoother/Solution.java
Split Array into Consecutive Subsequenceshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0659_split_array_into_consecutive_subsequences/Solution.java
Find K Closest Elementshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0658_find_k_closest_elements/Solution.java
Robot Return to Originhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0657_robot_return_to_origin/Solution.java
Print Binary Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0655_print_binary_tree/Solution.java
Maximum Binary Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0654_maximum_binary_tree/Solution.java
Two Sum IV - Input is a BSThttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0653_two_sum_iv_input_is_a_bst/Solution.java
Find Duplicate Subtreeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0652_find_duplicate_subtrees/Solution.java
2 Keys Keyboardhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0650_2_keys_keyboard/Solution.java
Dota2 Senatehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0649_dota2_senate/Solution.java
Replace Wordshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0648_replace_words/Solution.java
Palindromic Substringshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0647_palindromic_substrings/Solution.java
Maximum Length of Pair Chainhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0646_maximum_length_of_pair_chain/Solution.java
Set Mismatchhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0645_set_mismatch/Solution.java
Maximum Average Subarray Ihttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0643_maximum_average_subarray_i/Solution.java
Design Circular Dequehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0641_design_circular_deque/MyCircularDeque.java
Solve the Equationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0640_solve_the_equation/Solution.java
Decode Ways IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0639_decode_ways_ii/Solution.java
Shopping Offershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0638_shopping_offers/Solution.java
Average of Levels in Binary Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0637_average_of_levels_in_binary_tree/Solution.java
Exclusive Time of Functionshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0636_exclusive_time_of_functions/Solution.java
Sum of Square Numbershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0633_sum_of_square_numbers/Solution.java
Smallest Range Covering Elements from K Listshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0632_smallest_range_covering_elements_from_k_lists/Solution.java
Course Schedule IIIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0630_course_schedule_iii/Solution.java
K Inverse Pairs Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0629_k_inverse_pairs_array/Solution.java
Maximum Product of Three Numbershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0628_maximum_product_of_three_numbers/Solution.java
Swap Salaryhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0627_swap_salary/script.sql
Exchange Seatshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0626_exchange_seats/script.sql
Add One Row to Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0623_add_one_row_to_tree/Solution.java
Design Circular Queuehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0622_design_circular_queue/MyCircularQueue.java
Task Schedulerhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0621_task_scheduler/Solution.java
Not Boring Movieshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0620_not_boring_movies/script.sql
Merge Two Binary Treeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0617_merge_two_binary_trees/Solution.java
Valid Triangle Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0611_valid_triangle_number/Solution.java
Find Duplicate File in Systemhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0609_find_duplicate_file_in_system/Solution.java
Tree Nodehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0608_tree_node/script.sql
Sales Personhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0607_sales_person/script.sql
Construct String from Binary Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0606_construct_string_from_binary_tree/Solution.java
Can Place Flowershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0605_can_place_flowers/Solution.java
Human Traffic of Stadiumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0601_0700/s0601_human_traffic_of_stadium/script.sql
Non-negative Integers without Consecutive Oneshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0600_non_negative_integers_without_consecutive_ones/Solution.java
Minimum Index Sum of Two Listshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0599_minimum_index_sum_of_two_lists/Solution.java
Range Addition IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0598_range_addition_ii/Solution.java
Classes More Than 5 Studentshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0596_classes_more_than_5_students/script.sql
Big Countrieshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0595_big_countries/script.sql
Longest Harmonious Subsequencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0594_longest_harmonious_subsequence/Solution.java
Valid Squarehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0593_valid_square/Solution.java
Fraction Addition and Subtractionhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0592_fraction_addition_and_subtraction/Solution.java
Tag Validatorhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0591_tag_validator/Solution.java
N-ary Tree Postorder Traversalhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0590_n_ary_tree_postorder_traversal/Solution.java
N-ary Tree Preorder Traversalhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0589_n_ary_tree_preorder_traversal/Solution.java
Erect the Fencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0587_erect_the_fence/Solution.java
Customer Placing the Largest Number of Ordershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0586_customer_placing_the_largest_number_of_orders/script.sql
Find Customer Refereehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0584_find_customer_referee/script.sql
Delete Operation for Two Stringshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0583_delete_operation_for_two_strings/Solution.java
Shortest Unsorted Continuous Subarrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0581_shortest_unsorted_continuous_subarray/Solution.java
Out of Boundary Pathshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0576_out_of_boundary_paths/Solution.java
Distribute Candieshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0575_distribute_candies/Solution.java
Subtree of Another Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0572_subtree_of_another_tree/Solution.java
Permutation in Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0567_permutation_in_string/Solution.java
Reshape the Matrixhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0566_reshape_the_matrix/Solution.java
Array Nestinghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0565_array_nesting/Solution.java
Find the Closest Palindromehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0564_find_the_closest_palindrome/Solution.java
Binary Tree Tilthttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0563_binary_tree_tilt/Solution.java
Array Partition Ihttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0561_array_partition_i/Solution.java
Subarray Sum Equals Khttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0560_subarray_sum_equals_k/Solution.java
Maximum Depth of N-ary Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0559_maximum_depth_of_n_ary_tree/Solution.java
Logical OR of Two Binary Grids Represented as Quad-Treeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0558_logical_or_of_two_binary_grids_represented_as_quad_trees/Solution.java
Reverse Words in a String IIIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0557_reverse_words_in_a_string_iii/Solution.java
Next Greater Element IIIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0556_next_greater_element_iii/Solution.java
Brick Wallhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0554_brick_wall/Solution.java
Optimal Divisionhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0553_optimal_division/Solution.java
Student Attendance Record IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0552_student_attendance_record_ii/Solution.java
Student Attendance Record Ihttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0551_student_attendance_record_i/Solution.java
Number of Provinceshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0547_number_of_provinces/Solution.java
Remove Boxeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0546_remove_boxes/Solution.java
Diameter of Binary Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0543_diameter_of_binary_tree/Solution.java
01 Matrixhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0542_01_matrix/Solution.java
Reverse String IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0541_reverse_string_ii/Solution.java
Single Element in a Sorted Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0540_single_element_in_a_sorted_array/Solution.java
Minimum Time Differencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0539_minimum_time_difference/Solution.java
Convert BST to Greater Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0538_convert_bst_to_greater_tree/Solution.java
Complex Number Multiplicationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0537_complex_number_multiplication/Solution.java
Encode and Decode TinyURLhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0535_encode_and_decode_tinyurl/Codec.java
K-diff Pairs in an Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0532_k_diff_pairs_in_an_array/Solution.java
Minimum Absolute Difference in BSThttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0530_minimum_absolute_difference_in_bst/Solution.java
Minesweeperhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0529_minesweeper/Solution.java
Random Pick with Weighthttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0528_random_pick_with_weight/Solution.java
Beautiful Arrangementhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0526_beautiful_arrangement/Solution.java
Contiguous Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0525_contiguous_array/Solution.java
Longest Word in Dictionary through Deletinghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0524_longest_word_in_dictionary_through_deleting/Solution.java
Continuous Subarray Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0523_continuous_subarray_sum/Solution.java
Longest Uncommon Subsequence IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0522_longest_uncommon_subsequence_ii/Solution.java
Longest Uncommon Subsequence Ihttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0521_longest_uncommon_subsequence_i/Solution.java
Detect Capitalhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0520_detect_capital/Solution.java
Random Flip Matrixhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0519_random_flip_matrix/Solution.java
Coin Change 2https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0518_coin_change_2/Solution.java
Super Washing Machineshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0517_super_washing_machines/Solution.java
Longest Palindromic Subsequencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0516_longest_palindromic_subsequence/Solution.java
Find Largest Value in Each Tree Rowhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0515_find_largest_value_in_each_tree_row/Solution.java
Freedom Trailhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0514_freedom_trail/Solution.java
Find Bottom Left Tree Valuehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0513_find_bottom_left_tree_value/Solution.java
Game Play Analysis Ihttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0511_game_play_analysis_i/script.sql
Fibonacci Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0509_fibonacci_number/Solution.java
Most Frequent Subtree Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0508_most_frequent_subtree_sum/Solution.java
Perfect Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0507_perfect_number/Solution.java
Relative Rankshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0506_relative_ranks/Solution.java
Base 7https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0504_base_7/Solution.java
Next Greater Element IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0503_next_greater_element_ii/Solution.java
IPOhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0502_ipo/Solution.java
Find Mode in Binary Search Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0501_0600/s0501_find_mode_in_binary_search_tree/Solution.java
Keyboard Rowhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0500_keyboard_row/Solution.java
Diagonal Traversehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0498_diagonal_traverse/Solution.java
Random Point in Non-overlapping Rectangleshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0497_random_point_in_non_overlapping_rectangles/Solution.java
Next Greater Element Ihttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0496_next_greater_element_i/Solution.java
Teemo Attackinghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0495_teemo_attacking/Solution.java
Target Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0494_target_sum/Solution.java
Reverse Pairshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0493_reverse_pairs/Solution.java
Construct the Rectanglehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0492_construct_the_rectangle/Solution.java
Increasing Subsequenceshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0491_increasing_subsequences/Solution.java
Zuma Gamehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0488_zuma_game/Solution.java
Predict the Winnerhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0486_predict_the_winner/Solution.java
Max Consecutive Oneshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0485_max_consecutive_ones/Solution.java
Smallest Good Basehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0483_smallest_good_base/Solution.java
License Key Formattinghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0482_license_key_formatting/Solution.java
Magical Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0481_magical_string/Solution.java
Sliding Window Medianhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0480_sliding_window_median/Solution.java
Largest Palindrome Producthttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0479_largest_palindrome_product/Solution.java
Generate Random Point in a Circlehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0478_generate_random_point_in_a_circle/Solution.java
Total Hamming Distancehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0477_total_hamming_distance/Solution.java
Number Complementhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0476_number_complement/Solution.java
Heatershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0475_heaters/Solution.java
Ones and Zeroeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0474_ones_and_zeroes/Solution.java
Matchsticks to Squarehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0473_matchsticks_to_square/Solution.java
Concatenated Wordshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0472_concatenated_words/Solution.java
Implement Rand10() Using Rand7()https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0470_implement_rand10_using_rand7/Solution.java
Validate IP Addresshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0468_validate_ip_address/Solution.java
Unique Substrings in Wraparound Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0467_unique_substrings_in_wraparound_string/Solution.java
Count The Repetitionshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0466_count_the_repetitions/Solution.java
Can I Winhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0464_can_i_win/Solution.java
Island Perimeterhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0463_island_perimeter/Solution.java
Minimum Moves to Equal Array Elements IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0462_minimum_moves_to_equal_array_elements_ii/Solution.java
Hamming Distancehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0461_hamming_distance/Solution.java
LFU Cachehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0460_lfu_cache/LFUCache.java
Repeated Substring Patternhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0459_repeated_substring_pattern/Solution.java
Poor Pigshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0458_poor_pigs/Solution.java
Circular Array Loophttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0457_circular_array_loop/Solution.java
132 Patternhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0456_132_pattern/Solution.java
Assign Cookieshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0455_assign_cookies/Solution.java
4Sum IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0454_4sum_ii/Solution.java
Minimum Moves to Equal Array Elementshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0453_minimum_moves_to_equal_array_elements/Solution.java
Minimum Number of Arrows to Burst Balloonshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0452_minimum_number_of_arrows_to_burst_balloons/Solution.java
Sort Characters By Frequencyhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0451_sort_characters_by_frequency/Solution.java
Delete Node in a BSThttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0450_delete_node_in_a_bst/Solution.java
Serialize and Deserialize BSThttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0449_serialize_and_deserialize_bst/Codec.java
Find All Numbers Disappeared in an Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0448_find_all_numbers_disappeared_in_an_array/Solution.java
Number of Boomerangshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0447_number_of_boomerangs/Solution.java
Arithmetic Slices II - Subsequencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0446_arithmetic_slices_ii_subsequence/Solution.java
Add Two Numbers IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0445_add_two_numbers_ii/Solution.java
String Compressionhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0443_string_compression/Solution.java
Find All Duplicates in an Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0442_find_all_duplicates_in_an_array/Solution.java
Arranging Coinshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0441_arranging_coins/Solution.java
K-th Smallest in Lexicographical Orderhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0440_k_th_smallest_in_lexicographical_order/Solution.java
Find All Anagrams in a Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.java
Path Sum IIIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0437_path_sum_iii/Solution.java
Find Right Intervalhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0436_find_right_interval/Solution.java
Non-overlapping Intervalshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0435_non_overlapping_intervals/Solution.java
Number of Segments in a Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0434_number_of_segments_in_a_string/Solution.java
Minimum Genetic Mutationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0433_minimum_genetic_mutation/Solution.java
All O`one Data Structurehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0432_all_oone_data_structure/AllOne.java
Flatten a Multilevel Doubly Linked Listhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0430_flatten_a_multilevel_doubly_linked_list/Solution.java
N-ary Tree Level Order Traversalhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0429_n_ary_tree_level_order_traversal/Solution.java
Construct Quad Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0427_construct_quad_tree/Solution.java
Longest Repeating Character Replacementhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0424_longest_repeating_character_replacement/Solution.java
Reconstruct Original Digits from Englishhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0423_reconstruct_original_digits_from_english/Solution.java
Maximum XOR of Two Numbers in an Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0421_maximum_xor_of_two_numbers_in_an_array/Solution.java
Strong Password Checkerhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0420_strong_password_checker/Solution.java
Battleships in a Boardhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0419_battleships_in_a_board/Solution.java
Pacific Atlantic Water Flowhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0417_pacific_atlantic_water_flow/Solution.java
Partition Equal Subset Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0416_partition_equal_subset_sum/Solution.java
Add Stringshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0415_add_strings/Solution.java
Third Maximum Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0414_third_maximum_number/Solution.java
Arithmetic Sliceshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0413_arithmetic_slices/Solution.java
Fizz Buzzhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0412_fizz_buzz/Solution.java
Split Array Largest Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0410_split_array_largest_sum/Solution.java
Longest Palindromehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0409_longest_palindrome/Solution.java
Trapping Rain Water IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0407_trapping_rain_water_ii/Solution.java
Queue Reconstruction by Heighthttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0406_queue_reconstruction_by_height/Solution.java
Convert a Number to Hexadecimalhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0405_convert_a_number_to_hexadecimal/Solution.java
Sum of Left Leaveshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0404_sum_of_left_leaves/Solution.java
Frog Jumphttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0403_frog_jump/Solution.java
Remove K Digitshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0402_remove_k_digits/Solution.java
Binary Watchhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0401_0500/s0401_binary_watch/Solution.java
Nth Digithttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0400_nth_digit/Solution.java
Evaluate Divisionhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0399_evaluate_division/Solution.java
Random Pick Indexhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0398_random_pick_index/Solution.java
Integer Replacementhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0397_integer_replacement/Solution.java
Rotate Functionhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0396_rotate_function/Solution.java
Longest Substring with At Least K Repeating Charactershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0395_longest_substring_with_at_least_k_repeating_characters/Solution.java
Decode Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0394_decode_string/Solution.java
UTF-8 Validationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0393_utf_8_validation/Solution.java
Is Subsequencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0392_is_subsequence/Solution.java
Perfect Rectanglehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0391_perfect_rectangle/Solution.java
Elimination Gamehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0390_elimination_game/Solution.java
Find the Differencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0389_find_the_difference/Solution.java
Longest Absolute File Pathhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0388_longest_absolute_file_path/Solution.java
First Unique Character in a Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0387_first_unique_character_in_a_string/Solution.java
Lexicographical Numbershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0386_lexicographical_numbers/Solution.java
Mini Parserhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0385_mini_parser/Solution.java
Shuffle an Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0384_shuffle_an_array/Solution.java
Ransom Notehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0383_ransom_note/Solution.java
Linked List Random Nodehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0382_linked_list_random_node/Solution.java
Insert Delete GetRandom O(1) - Duplicates allowedhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0381_insert_delete_getrandom_o1_duplicates_allowed/RandomizedCollection.java
Insert Delete GetRandom O(1)https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0380_insert_delete_getrandom_o1/RandomizedSet.java
Kth Smallest Element in a Sorted Matrixhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0378_kth_smallest_element_in_a_sorted_matrix/Solution.java
Combination Sum IVhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0377_combination_sum_iv/Solution.java
Wiggle Subsequencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0376_wiggle_subsequence/Solution.java
Guess Number Higher or Lower IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0375_guess_number_higher_or_lower_ii/Solution.java
Guess Number Higher or Lowerhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0374_guess_number_higher_or_lower/Solution.java
Find K Pairs with Smallest Sumshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0373_find_k_pairs_with_smallest_sums/Solution.java
Super Powhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0372_super_pow/Solution.java
Sum of Two Integershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0371_sum_of_two_integers/Solution.java
Largest Divisible Subsethttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0368_largest_divisible_subset/Solution.java
Valid Perfect Squarehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0367_valid_perfect_square/Solution.java
Water and Jug Problemhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0365_water_and_jug_problem/Solution.java
Max Sum of Rectangle No Larger Than Khttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0363_max_sum_of_rectangle_no_larger_than_k/Solution.java
Count Numbers with Unique Digitshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0357_count_numbers_with_unique_digits/Solution.java
Design Twitterhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0355_design_twitter/Twitter.java
Russian Doll Envelopeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0354_russian_doll_envelopes/Solution.java
Data Stream as Disjoint Intervalshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0352_data_stream_as_disjoint_intervals/SummaryRanges.java
Intersection of Two Arrays IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0350_intersection_of_two_arrays_ii/Solution.java
Intersection of Two Arrayshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0349_intersection_of_two_arrays/Solution.java
Top K Frequent Elementshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0347_top_k_frequent_elements/Solution.java
Reverse Vowels of a Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0345_reverse_vowels_of_a_string/Solution.java
Reverse Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0344_reverse_string/Solution.java
Integer Breakhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0343_integer_break/Solution.java
Power of Fourhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0342_power_of_four/Solution.java
Flatten Nested List Iteratorhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0341_flatten_nested_list_iterator/NestedIterator.java
Counting Bitshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0338_counting_bits/Solution.java
House Robber IIIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0337_house_robber_iii/Solution.java
Palindrome Pairshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0336_palindrome_pairs/Solution.java
Self Crossinghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0335_self_crossing/Solution.java
Increasing Triplet Subsequencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0334_increasing_triplet_subsequence/Solution.java
Reconstruct Itineraryhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0332_reconstruct_itinerary/Solution.java
Verify Preorder Serialization of a Binary Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0331_verify_preorder_serialization_of_a_binary_tree/Solution.java
Patching Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0330_patching_array/Solution.java
Longest Increasing Path in a Matrixhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0329_longest_increasing_path_in_a_matrix/Solution.java
Odd Even Linked Listhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0328_odd_even_linked_list/Solution.java
Count of Range Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0327_count_of_range_sum/Solution.java
Power of Threehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0326_power_of_three/Solution.java
Wiggle Sort IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0324_wiggle_sort_ii/Solution.java
Coin Changehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0322_coin_change/Solution.java
Create Maximum Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0321_create_maximum_number/Solution.java
Bulb Switcherhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0319_bulb_switcher/Solution.java
Maximum Product of Word Lengthshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0318_maximum_product_of_word_lengths/Solution.java
Remove Duplicate Lettershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0316_remove_duplicate_letters/Solution.java
Count of Smaller Numbers After Selfhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0315_count_of_smaller_numbers_after_self/Solution.java
Super Ugly Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0313_super_ugly_number/Solution.java
Burst Balloonshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0312_burst_balloons/Solution.java
Minimum Height Treeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0310_minimum_height_trees/Solution.java
Best Time to Buy and Sell Stock with Cooldownhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0309_best_time_to_buy_and_sell_stock_with_cooldown/Solution.java
Range Sum Query - Mutablehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0307_range_sum_query_mutable/NumArray.java
Additive Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0306_additive_number/Solution.java
Range Sum Query 2D - Immutablehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0304_range_sum_query_2d_immutable/NumMatrix.java
Range Sum Query - Immutablehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0303_range_sum_query_immutable/NumArray.java
Remove Invalid Parentheseshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0301_0400/s0301_remove_invalid_parentheses/Solution.java
Longest Increasing Subsequencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0300_longest_increasing_subsequence/Solution.java
Bulls and Cowshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0299_bulls_and_cows/Solution.java
Serialize and Deserialize Binary Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0297_serialize_and_deserialize_binary_tree/Codec.java
Find Median from Data Streamhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.java
Nim Gamehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0292_nim_game/Solution.java
Word Patternhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0290_word_pattern/Solution.java
Game of Lifehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0289_game_of_life/Solution.java
Find the Duplicate Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0287_find_the_duplicate_number/Solution.java
Peeking Iteratorhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0284_peeking_iterator/PeekingIterator.java
Move Zeroeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0283_move_zeroes/Solution.java
Expression Add Operatorshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0282_expression_add_operators/Solution.java
Perfect Squareshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0279_perfect_squares/Solution.java
First Bad Versionhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0278_first_bad_version/Solution.java
H-Index IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0275_h_index_ii/Solution.java
H-Indexhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0274_h_index/Solution.java
Integer to English Wordshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0273_integer_to_english_words/Solution.java
Missing Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0268_missing_number/Solution.java
Ugly Number IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0264_ugly_number_ii/Solution.java
Ugly Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0263_ugly_number/Solution.java
Trips and Usershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0262_trips_and_users/script.sql
Single Number IIIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0260_single_number_iii/Solution.java
Add Digitshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0258_add_digits/Solution.java
Binary Tree Pathshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0257_binary_tree_paths/Solution.java
Valid Anagramhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0242_valid_anagram/Solution.java
Different Ways to Add Parentheseshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0241_different_ways_to_add_parentheses/Solution.java
Search a 2D Matrix IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.java
Sliding Window Maximumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0239_sliding_window_maximum/Solution.java
Product of Array Except Selfhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0238_product_of_array_except_self/Solution.java
Delete Node in a Linked Listhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0237_delete_node_in_a_linked_list/Solution.java
Lowest Common Ancestor of a Binary Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.java
Lowest Common Ancestor of a Binary Search Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0235_lowest_common_ancestor_of_a_binary_search_tree/Solution.java
Palindrome Linked Listhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0234_palindrome_linked_list/Solution.java
Number of Digit Onehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0233_number_of_digit_one/Solution.java
Implement Queue using Stackshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0232_implement_queue_using_stacks/MyQueue.java
Power of Twohttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0231_power_of_two/Solution.java
Kth Smallest Element in a BSThttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.java
Majority Element IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0229_majority_element_ii/Solution.java
Summary Rangeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0228_summary_ranges/Solution.java
Basic Calculator IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0227_basic_calculator_ii/Solution.java
Invert Binary Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0226_invert_binary_tree/Solution.java
Implement Stack using Queueshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0225_implement_stack_using_queues/MyStack.java
Basic Calculatorhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0224_basic_calculator/Solution.java
Rectangle Areahttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0223_rectangle_area/Solution.java
Count Complete Tree Nodeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0222_count_complete_tree_nodes/Solution.java
Maximal Squarehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0221_maximal_square/Solution.java
Contains Duplicate IIIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0220_contains_duplicate_iii/Solution.java
Contains Duplicate IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0219_contains_duplicate_ii/Solution.java
The Skyline Problemhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0218_the_skyline_problem/Solution.java
Contains Duplicatehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0217_contains_duplicate/Solution.java
Combination Sum IIIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0216_combination_sum_iii/Solution.java
Kth Largest Element in an Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.java
Shortest Palindromehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0214_shortest_palindrome/Solution.java
House Robber IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0213_house_robber_ii/Solution.java
Word Search IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0212_word_search_ii/Solution.java
Design Add and Search Words Data Structurehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0211_design_add_and_search_words_data_structure/WordDictionary.java
Course Schedule IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0210_course_schedule_ii/Solution.java
Minimum Size Subarray Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0209_minimum_size_subarray_sum/Solution.java
Implement Trie (Prefix Tree)https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0208_implement_trie_prefix_tree/Trie.java
Course Schedulehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0207_course_schedule/Solution.java
Reverse Linked Listhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0206_reverse_linked_list/Solution.java
Isomorphic Stringshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0205_isomorphic_strings/Solution.java
Count Primeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0204_count_primes/Solution.java
Remove Linked List Elementshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0203_remove_linked_list_elements/Solution.java
Happy Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0202_happy_number/Solution.java
Bitwise AND of Numbers Rangehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0201_0300/s0201_bitwise_and_of_numbers_range/Solution.java
Number of Islandshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0200_number_of_islands/Solution.java
Binary Tree Right Side Viewhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0199_binary_tree_right_side_view/Solution.java
House Robberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0198_house_robber/Solution.java
Rising Temperaturehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0197_rising_temperature/script.sql
Delete Duplicate Emailshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0196_delete_duplicate_emails/script.sql
Tenth Linehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0195_tenth_line/script.sh
Transpose Filehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0194_transpose_file/script.sh
Valid Phone Numbershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0193_valid_phone_numbers/script.sh
Word Frequencyhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0192_word_frequency/script.sh
Number of 1 Bitshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0191_number_of_1_bits/Solution.java
Reverse Bitshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0190_reverse_bits/Solution.java
Rotate Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0189_rotate_array/Solution.java
Best Time to Buy and Sell Stock IVhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0188_best_time_to_buy_and_sell_stock_iv/Solution.java
Repeated DNA Sequenceshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0187_repeated_dna_sequences/Solution.java
Department Top Three Salarieshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0185_department_top_three_salaries/script.sql
Department Highest Salaryhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0184_department_highest_salary/script.sql
Customers Who Never Orderhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0183_customers_who_never_order/script.sql
Duplicate Emailshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0182_duplicate_emails/script.sql
Employees Earning More Than Their Managershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0181_employees_earning_more_than_their_managers/script.sql
Consecutive Numbershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0180_consecutive_numbers/script.sql
Largest Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0179_largest_number/Solution.java
Rank Scoreshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0178_rank_scores/script.sql
Nth Highest Salaryhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0177_nth_highest_salary/script.sql
Second Highest Salaryhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0176_second_highest_salary/script.sql
Combine Two Tableshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0175_combine_two_tables/script.sql
Dungeon Gamehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0174_dungeon_game/Solution.java
Binary Search Tree Iteratorhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0173_binary_search_tree_iterator/BSTIterator.java
Factorial Trailing Zeroeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0172_factorial_trailing_zeroes/Solution.java
Excel Sheet Column Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0171_excel_sheet_column_number/Solution.java
Majority Elementhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0169_majority_element/Solution.java
Excel Sheet Column Titlehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0168_excel_sheet_column_title/Solution.java
Two Sum II - Input Array Is Sortedhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0167_two_sum_ii_input_array_is_sorted/Solution.java
Fraction to Recurring Decimalhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0166_fraction_to_recurring_decimal/Solution.java
Compare Version Numbershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0165_compare_version_numbers/Solution.java
Maximum Gaphttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0164_maximum_gap/Solution.java
Find Peak Elementhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0162_find_peak_element/Solution.java
Intersection of Two Linked Listshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0160_intersection_of_two_linked_lists/Solution.java
Min Stackhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0155_min_stack/MinStack.java
Find Minimum in Rotated Sorted Array IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0154_find_minimum_in_rotated_sorted_array_ii/Solution.java
Find Minimum in Rotated Sorted Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.java
Maximum Product Subarrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0152_maximum_product_subarray/Solution.java
Reverse Words in a Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0151_reverse_words_in_a_string/Solution.java
Evaluate Reverse Polish Notationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0150_evaluate_reverse_polish_notation/Solution.java
Max Points on a Linehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0149_max_points_on_a_line/Solution.java
Sort Listhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0148_sort_list/Solution.java
Insertion Sort Listhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0147_insertion_sort_list/Solution.java
LRU Cachehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0146_lru_cache/LRUCache.java
Binary Tree Postorder Traversalhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0145_binary_tree_postorder_traversal/Solution.java
Binary Tree Preorder Traversalhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0144_binary_tree_preorder_traversal/Solution.java
Reorder Listhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0143_reorder_list/Solution.java
Linked List Cycle IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0142_linked_list_cycle_ii/Solution.java
Linked List Cyclehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0141_linked_list_cycle/Solution.java
Word Break IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0140_word_break_ii/Solution.java
Word Breakhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0139_word_break/Solution.java
Copy List with Random Pointerhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0138_copy_list_with_random_pointer/Solution.java
Single Number IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0137_single_number_ii/Solution.java
Single Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0136_single_number/Solution.java
Candyhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0135_candy/Solution.java
Gas Stationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0134_gas_station/Solution.java
Clone Graphhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0133_clone_graph/Solution.java
Palindrome Partitioning IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0132_palindrome_partitioning_ii/Solution.java
Palindrome Partitioninghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0131_palindrome_partitioning/Solution.java
Surrounded Regionshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0130_surrounded_regions/Solution.java
Sum Root to Leaf Numbershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0129_sum_root_to_leaf_numbers/Solution.java
Longest Consecutive Sequencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0128_longest_consecutive_sequence/Solution.java
Word Ladderhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0127_word_ladder/Solution.java
Word Ladder IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0126_word_ladder_ii/Solution.java
Valid Palindromehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0125_valid_palindrome/Solution.java
Binary Tree Maximum Path Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.java
Best Time to Buy and Sell Stock IIIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0123_best_time_to_buy_and_sell_stock_iii/Solution.java
Best Time to Buy and Sell Stock IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0122_best_time_to_buy_and_sell_stock_ii/Solution.java
Best Time to Buy and Sell Stockhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.java
Trianglehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0120_triangle/Solution.java
Pascal's Triangle IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0119_pascals_triangle_ii/Solution.java
Pascal's Trianglehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0118_pascals_triangle/Solution.java
Populating Next Right Pointers in Each Node IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0117_populating_next_right_pointers_in_each_node_ii/Solution.java
Populating Next Right Pointers in Each Nodehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0116_populating_next_right_pointers_in_each_node/Solution.java
Distinct Subsequenceshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0115_distinct_subsequences/Solution.java
Flatten Binary Tree to Linked Listhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.java
Path Sum IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0113_path_sum_ii/Solution.java
Path Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0112_path_sum/Solution.java
Minimum Depth of Binary Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0111_minimum_depth_of_binary_tree/Solution.java
Balanced Binary Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0110_balanced_binary_tree/Solution.java
Convert Sorted List to Binary Search Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0109_convert_sorted_list_to_binary_search_tree/Solution.java
Convert Sorted Array to Binary Search Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0108_convert_sorted_array_to_binary_search_tree/Solution.java
Binary Tree Level Order Traversal IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0107_binary_tree_level_order_traversal_ii/Solution.java
Construct Binary Tree from Inorder and Postorder Traversalhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0106_construct_binary_tree_from_inorder_and_postorder_traversal/Solution.java
Construct Binary Tree from Preorder and Inorder Traversalhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.java
Maximum Depth of Binary Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.java
Binary Tree Zigzag Level Order Traversalhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0103_binary_tree_zigzag_level_order_traversal/Solution.java
Binary Tree Level Order Traversalhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.java
Symmetric Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0101_0200/s0101_symmetric_tree/Solution.java
Same Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0100_same_tree/Solution.java
Recover Binary Search Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0099_recover_binary_search_tree/Solution.java
Validate Binary Search Treehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0098_validate_binary_search_tree/Solution.java
Interleaving Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0097_interleaving_string/Solution.java
Unique Binary Search Treeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0096_unique_binary_search_trees/Solution.java
Unique Binary Search Trees IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0095_unique_binary_search_trees_ii/Solution.java
Binary Tree Inorder Traversalhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0094_binary_tree_inorder_traversal/Solution.java
Restore IP Addresseshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0093_restore_ip_addresses/Solution.java
Reverse Linked List IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0092_reverse_linked_list_ii/Solution.java
Decode Wayshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0091_decode_ways/Solution.java
Subsets IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0090_subsets_ii/Solution.java
Gray Codehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0089_gray_code/Solution.java
Merge Sorted Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0088_merge_sorted_array/Solution.java
Scramble Stringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0087_scramble_string/Solution.java
Partition Listhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0086_partition_list/Solution.java
Maximal Rectanglehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0085_maximal_rectangle/Solution.java
Largest Rectangle in Histogramhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0084_largest_rectangle_in_histogram/Solution.java
Remove Duplicates from Sorted Listhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0083_remove_duplicates_from_sorted_list/Solution.java
Remove Duplicates from Sorted List IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0082_remove_duplicates_from_sorted_list_ii/Solution.java
Search in Rotated Sorted Array IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0081_search_in_rotated_sorted_array_ii/Solution.java
Remove Duplicates from Sorted Array IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0080_remove_duplicates_from_sorted_array_ii/Solution.java
Word Searchhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0079_word_search/Solution.java
Subsetshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0078_subsets/Solution.java
Combinationshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0077_combinations/Solution.java
Minimum Window Substringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0076_minimum_window_substring/Solution.java
Sort Colorshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0075_sort_colors/Solution.java
Search a 2D Matrixhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0074_search_a_2d_matrix/Solution.java
Set Matrix Zeroeshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0073_set_matrix_zeroes/Solution.java
Edit Distancehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0072_edit_distance/Solution.java
Simplify Pathhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0071_simplify_path/Solution.java
Climbing Stairshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0070_climbing_stairs/Solution.java
Sqrt(x)https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0069_sqrtx/Solution.java
Text Justificationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0068_text_justification/Solution.java
Add Binaryhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0067_add_binary/Solution.java
Plus Onehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0066_plus_one/Solution.java
Valid Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0065_valid_number/Solution.java
Minimum Path Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0064_minimum_path_sum/Solution.java
Unique Paths IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0063_unique_paths_ii/Solution.java
Unique Pathshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0062_unique_paths/Solution.java
Rotate Listhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0061_rotate_list/Solution.java
Permutation Sequencehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0060_permutation_sequence/Solution.java
Spiral Matrix IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0059_spiral_matrix_ii/Solution.java
Length of Last Wordhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0058_length_of_last_word/Solution.java
Insert Intervalhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0057_insert_interval/Solution.java
Merge Intervalshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0056_merge_intervals/Solution.java
Jump Gamehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0055_jump_game/Solution.java
Spiral Matrixhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0054_spiral_matrix/Solution.java
Maximum Subarrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0053_maximum_subarray/Solution.java
N-Queens IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0052_n_queens_ii/Solution.java
N-Queenshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0051_n_queens/Solution.java
Pow(x, n)https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0050_powx_n/Solution.java
Group Anagramshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0049_group_anagrams/Solution.java
Rotate Imagehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0048_rotate_image/Solution.java
Permutations IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0047_permutations_ii/Solution.java
Permutationshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0046_permutations/Solution.java
Jump Game IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0045_jump_game_ii/Solution.java
Wildcard Matchinghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0044_wildcard_matching/Solution.java
Multiply Stringshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0043_multiply_strings/Solution.java
Trapping Rain Waterhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0042_trapping_rain_water/Solution.java
First Missing Positivehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0041_first_missing_positive/Solution.java
Combination Sum IIhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0040_combination_sum_ii/Solution.java
Combination Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0039_combination_sum/Solution.java
Count and Sayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0038_count_and_say/Solution.java
Sudoku Solverhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0037_sudoku_solver/Solution.java
Valid Sudokuhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0036_valid_sudoku/Solution.java
Search Insert Positionhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0035_search_insert_position/Solution.java
Find First and Last Position of Element in Sorted Arrayhttps://patch-diff.githubusercontent.com/pekumar7/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/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.java
Longest Valid Parentheseshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0032_longest_valid_parentheses/Solution.java
Next Permutationhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0031_next_permutation/Solution.java
Substring with Concatenation of All Wordshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0030_substring_with_concatenation_of_all_words/Solution.java
Divide Two Integershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0029_divide_two_integers/Solution.java
Implement strStr()https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0028_implement_strstr/Solution.java
Remove Elementhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0027_remove_element/Solution.java
Remove Duplicates from Sorted Arrayhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0026_remove_duplicates_from_sorted_array/Solution.java
Reverse Nodes in k-Grouphttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.java
Swap Nodes in Pairshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0024_swap_nodes_in_pairs/Solution.java
Merge k Sorted Listshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0023_merge_k_sorted_lists/Solution.java
Generate Parentheseshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0022_generate_parentheses/Solution.java
Merge Two Sorted Listshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0021_merge_two_sorted_lists/Solution.java
Valid Parentheseshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0020_valid_parentheses/Solution.java
Remove Nth Node From End of Listhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.java
4Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0018_4sum/Solution.java
Letter Combinations of a Phone Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.java
3Sum Closesthttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0016_3sum_closest/Solution.java
3Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0015_3sum/Solution.java
Longest Common Prefixhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0014_longest_common_prefix/Solution.java
Roman to Integerhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0013_roman_to_integer/Solution.java
Integer to Romanhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0012_integer_to_roman/Solution.java
Container With Most Waterhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0011_container_with_most_water/Solution.java
Regular Expression Matchinghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0010_regular_expression_matching/Solution.java
Palindrome Numberhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0009_palindrome_number/Solution.java
String to Integer (atoi)https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0008_string_to_integer_atoi/Solution.java
Reverse Integerhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0007_reverse_integer/Solution.java
Zigzag Conversionhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0006_zigzag_conversion/Solution.java
Longest Palindromic Substringhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0005_longest_palindromic_substring/Solution.java
Median of Two Sorted Arrayshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.java
Longest Substring Without Repeating Charactershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.java
Add Two Numbershttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0002_add_two_numbers/Solution.java
Two Sumhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/blob/main/src/main/java/g0001_0100/s0001_two_sum/Solution.java
https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#contributing
leetcode-in-java.github.iohttps://leetcode-in-java.github.io
Readme https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#readme-ov-file
MIT license https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#MIT-1-ov-file
Security policy https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java#security-ov-file
Please reload this pagehttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java
Activityhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/activity
1 starhttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/stargazers
0 watchinghttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/watchers
0 forkshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/forks
Report repository https://patch-diff.githubusercontent.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2Fpekumar7%2FLeetCode-in-Java&report=pekumar7+%28user%29
Releaseshttps://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/releases
12 tags https://patch-diff.githubusercontent.com/pekumar7/LeetCode-in-Java/tags
Packages 0https://patch-diff.githubusercontent.com/users/pekumar7/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.