René's URL Explorer Experiment


Title: GitHub - Nishant763/LeetCode: This repository contains the solutions and explanations to the algorithm problems on LeetCode. Only medium or above are included. All are written in C++/Python and implemented by myself. The problems attempted multiple times are labelled with hyperlinks.

Open Graph Title: GitHub - Nishant763/LeetCode: This repository contains the solutions and explanations to the algorithm problems on LeetCode. Only medium or above are included. All are written in C++/Python and implemented by myself. The problems attempted multiple times are labelled with hyperlinks.

X Title: GitHub - Nishant763/LeetCode: This repository contains the solutions and explanations to the algorithm problems on LeetCode. Only medium or above are included. All are written in C++/Python and implemented by myself. The problems attempted multiple times are labelled with hyperlinks.

Description: This repository contains the solutions and explanations to the algorithm problems on LeetCode. Only medium or above are included. All are written in C++/Python and implemented by myself. The problems attempted multiple times are labelled with hyperlinks. - Nishant763/LeetCode

Open Graph Description: This repository contains the solutions and explanations to the algorithm problems on LeetCode. Only medium or above are included. All are written in C++/Python and implemented by myself. The proble...

X Description: This repository contains the solutions and explanations to the algorithm problems on LeetCode. Only medium or above are included. All are written in C++/Python and implemented by myself. The proble...

Mail addresses
guan.huifeng@gmail.com

Opengraph URL: https://github.com/Nishant763/LeetCode

X: @github

direct link

Domain: patch-diff.githubusercontent.com

route-pattern/:user_id/:repository
route-controllerfiles
route-actiondisambiguate
fetch-noncev2:04b10994-33e1-f29c-e93d-4d63046dcbfc
current-catalog-service-hashf3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb
request-id8484:2C98AB:65CB56F:8A8586F:69785A19
html-safe-nonce175309716097c887df293856f94f49422d577145526a63acb2dd9502f51d12bc
visitor-payloadeyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiI4NDg0OjJDOThBQjo2NUNCNTZGOjhBODU4NkY6Njk3ODVBMTkiLCJ2aXNpdG9yX2lkIjoiMzQ4MzAyMjQ4MjI4NzkwOTQwMSIsInJlZ2lvbl9lZGdlIjoiaWFkIiwicmVnaW9uX3JlbmRlciI6ImlhZCJ9
visitor-hmac96fb8b678ee149fac65da8353a863b4f7c1958b17dd3aa474a551bab72fdabdc
hovercard-subject-tagrepository:469572501
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/Nishant763/LeetCode
twitter:imagehttps://opengraph.githubassets.com/43f1a38b47b3aef210b496b238e4f6e269e0bec1b6e3a76613d510d8076a9cb2/Nishant763/LeetCode
twitter:cardsummary_large_image
og:imagehttps://opengraph.githubassets.com/43f1a38b47b3aef210b496b238e4f6e269e0bec1b6e3a76613d510d8076a9cb2/Nishant763/LeetCode
og:image:altThis repository contains the solutions and explanations to the algorithm problems on LeetCode. Only medium or above are included. All are written in C++/Python and implemented by myself. The proble...
og:image:width1200
og:image:height600
og:site_nameGitHub
og:typeobject
hostnamegithub.com
expected-hostnamegithub.com
None2981c597c945c1d90ac6fa355ce7929b2f413dfe7872ca5c435ee53a24a1de50
turbo-cache-controlno-preview
go-importgithub.com/Nishant763/LeetCode git https://github.com/Nishant763/LeetCode.git
octolytics-dimension-user_id49840658
octolytics-dimension-user_loginNishant763
octolytics-dimension-repository_id469572501
octolytics-dimension-repository_nwoNishant763/LeetCode
octolytics-dimension-repository_publictrue
octolytics-dimension-repository_is_forktrue
octolytics-dimension-repository_parent_id83542585
octolytics-dimension-repository_parent_nwowisdompeak/LeetCode
octolytics-dimension-repository_network_root_id83542585
octolytics-dimension-repository_network_root_nwowisdompeak/LeetCode
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
release520b65a872113b919c1bbdb03834a50af15859fd
ui-targetfull
theme-color#1e2327
color-schemelight dark

Links:

Skip to contenthttps://patch-diff.githubusercontent.com/Nishant763/LeetCode#start-of-content
https://patch-diff.githubusercontent.com/
Sign in https://patch-diff.githubusercontent.com/login?return_to=https%3A%2F%2Fgithub.com%2FNishant763%2FLeetCode
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%2FNishant763%2FLeetCode
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=Nishant763%2FLeetCode
Reloadhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode
Reloadhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode
Reloadhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode
Nishant763 https://patch-diff.githubusercontent.com/Nishant763
LeetCodehttps://patch-diff.githubusercontent.com/Nishant763/LeetCode
wisdompeak/LeetCodehttps://patch-diff.githubusercontent.com/wisdompeak/LeetCode
Notifications https://patch-diff.githubusercontent.com/login?return_to=%2FNishant763%2FLeetCode
Fork 0 https://patch-diff.githubusercontent.com/login?return_to=%2FNishant763%2FLeetCode
Star 0 https://patch-diff.githubusercontent.com/login?return_to=%2FNishant763%2FLeetCode
0 stars https://patch-diff.githubusercontent.com/Nishant763/LeetCode/stargazers
1.3k forks https://patch-diff.githubusercontent.com/Nishant763/LeetCode/forks
Branches https://patch-diff.githubusercontent.com/Nishant763/LeetCode/branches
Tags https://patch-diff.githubusercontent.com/Nishant763/LeetCode/tags
Activity https://patch-diff.githubusercontent.com/Nishant763/LeetCode/activity
Star https://patch-diff.githubusercontent.com/login?return_to=%2FNishant763%2FLeetCode
Notifications https://patch-diff.githubusercontent.com/login?return_to=%2FNishant763%2FLeetCode
Code https://patch-diff.githubusercontent.com/Nishant763/LeetCode
Pull requests 0 https://patch-diff.githubusercontent.com/Nishant763/LeetCode/pulls
Actions https://patch-diff.githubusercontent.com/Nishant763/LeetCode/actions
Projects 0 https://patch-diff.githubusercontent.com/Nishant763/LeetCode/projects
Security 0 https://patch-diff.githubusercontent.com/Nishant763/LeetCode/security
Insights https://patch-diff.githubusercontent.com/Nishant763/LeetCode/pulse
Code https://patch-diff.githubusercontent.com/Nishant763/LeetCode
Pull requests https://patch-diff.githubusercontent.com/Nishant763/LeetCode/pulls
Actions https://patch-diff.githubusercontent.com/Nishant763/LeetCode/actions
Projects https://patch-diff.githubusercontent.com/Nishant763/LeetCode/projects
Security https://patch-diff.githubusercontent.com/Nishant763/LeetCode/security
Insights https://patch-diff.githubusercontent.com/Nishant763/LeetCode/pulse
Brancheshttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/branches
Tagshttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tags
https://patch-diff.githubusercontent.com/Nishant763/LeetCode/branches
https://patch-diff.githubusercontent.com/Nishant763/LeetCode/tags
6,628 Commitshttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/commits/master/
https://patch-diff.githubusercontent.com/Nishant763/LeetCode/commits/master/
BFShttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/BFS
BFShttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/BFS
Binary_Searchhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Binary_Search
Binary_Searchhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Binary_Search
Bit_Manipulationhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Bit_Manipulation
Bit_Manipulationhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Bit_Manipulation
DFShttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/DFS
DFShttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/DFS
Dequehttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Deque
Dequehttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Deque
Designhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Design
Designhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Design
Divide_Conquerhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Divide_Conquer
Divide_Conquerhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Divide_Conquer
Dynamic_Programminghttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Dynamic_Programming
Dynamic_Programminghttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Dynamic_Programming
Graphhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Graph
Graphhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Graph
Greedyhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Greedy
Greedyhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Greedy
Hashhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Hash
Hashhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Hash
Heaphttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Heap
Heaphttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Heap
LCCUPhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/LCCUP
LCCUPhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/LCCUP
Linked_Listhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Linked_List
Linked_Listhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Linked_List
Mathhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Math
Mathhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Math
Othershttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Others
Othershttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Others
Priority_Queuehttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Priority_Queue
Priority_Queuehttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Priority_Queue
Recursionhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Recursion
Recursionhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Recursion
Segment_Treehttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Segment_Tree
Segment_Treehttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Segment_Tree
Simulationhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Simulation
Simulationhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Simulation
Stackhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Stack
Stackhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Stack
Stringhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/String
Stringhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/String
Templatehttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Template
Templatehttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Template
Treehttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Tree
Treehttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Tree
Triehttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Trie
Triehttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Trie
Two_Pointershttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Two_Pointers
Two_Pointershttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Two_Pointers
Union_Findhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Union_Find
Union_Findhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/Union_Find
testshttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/tests
testshttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/tree/master/tests
.gitignorehttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/blob/master/.gitignore
.gitignorehttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/blob/master/.gitignore
CMakeLists.txthttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/blob/master/CMakeLists.txt
CMakeLists.txthttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/blob/master/CMakeLists.txt
Readme.mdhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/blob/master/Readme.md
Readme.mdhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/blob/master/Readme.md
READMEhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode
LeetCode Daily Live Coding and Interpretationhttps://docs.google.com/spreadsheets/d/1kBGyRsSdbGDu7DzjQcC-UkZjZERdrP8-_QyVGXHSrB8/edit#gid=0
https://patch-diff.githubusercontent.com/Nishant763/LeetCode#my-youtube-channel-leetcode-daily-live-coding-and-interpretation
See rules and score board herehttps://wisdompeak.github.io/lc-score-board/
https://patch-diff.githubusercontent.com/Nishant763/LeetCode#my-leetcode-daily-problem--contest-group-see-rules-and-score-board-here
https://patch-diff.githubusercontent.com/Nishant763/LeetCode#leetcode难题代码和算法要点分析
https://patch-diff.githubusercontent.com/Nishant763/LeetCode#目前分类目录
Two Pointershttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers
https://patch-diff.githubusercontent.com/Nishant763/LeetCode#two-pointers
011.Container-With-Most-Waterhttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/011.Container-With-Most-Water
015.3Sumhttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/015.3Sum
016.3Sum-Closethttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/016.3Sum-Closest
018.4Sumhttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/018.4Sum
259.3Sum-Smallerhttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/259.3Sum-Smaller
030.Substring-with-Concatenation-of-All-Wordshttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/030.Substring-with-Concatenation-of-All-Words
075.Sort-Colorshttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/075.Sort-Colors
026.Remove Duplicates from Sorted Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/026.Remove-Duplicates-from-Sorted-Array
080.Remove Duplicates from Sorted Array IIhttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/080.Remove-Duplicates-from-Sorted-Array-II
209.Minimum-Size-Subarray-Sumhttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/209.Minimum-Size-Subarray-Sum
088.Merge Sorted Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/088.Merge-Sorted-Array
283.Move-Zeroeshttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/283.Move-Zeroes
141.Linked-List-Cyclehttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/141.Linked-List-Cycle
142.Linked-List-Cycle-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Linked_List/142.Linked-List-Cycle-II
360.Sort-Transformed-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/360.Sort-Transformed-Array
713.Subarray-Product-Less-Than-Khttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/713.Subarray-Product-Less-Than-K
923.3Sum-With-Multiplicityhttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/923.3Sum-With-Multiplicity
1234.Replace-the-Substring-for-Balanced-Stringhttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/1234.Replace-the-Substring-for-Balanced-String
1498.Number-of-Subsequences-That-Satisfy-the-Given-Sum-Conditionhttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/1498.Number-of-Subsequences-That-Satisfy-the-Given-Sum-Condition
1574.Shortest-Subarray-to-be-Removed-to-Make-Array-Sortedhttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/1574.Shortest-Subarray-to-be-Removed-to-Make-Array-Sorted
1580.Put-Boxes-Into-the-Warehouse-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/1580.Put-Boxes-Into-the-Warehouse-II
1687.Delivering-Boxes-from-Storage-to-Portshttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/1687.Delivering-Boxes-from-Storage-to-Ports
1793.Maximum-Score-of-a-Good-Subarrayhttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/1793.Maximum-Score-of-a-Good-Subarray
1798.Maximum-Number-of-Consecutive-Values-You-Can-Make/Readme.mdhttps://github.com/wisdompeak/LeetCode/blob/master/Greedy/1798.Maximum-Number-of-Consecutive-Values-You-Can-Make
1989.Maximum-Number-of-People-That-Can-Be-Caught-in-Taghttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/1989.Maximum-Number-of-People-That-Can-Be-Caught-in-Tag
532.K-diff-Pairs-in-an-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/532.K-diff-Pairs-in-an-Array
611.Valid-Triangle-Numberhttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/611.Valid-Triangle-Number
1004.Max-Consecutive-Ones-IIIhttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/1004.Max-Consecutive-Ones-III
1052.Grumpy-Bookstore-Ownerhttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/1052.Grumpy-Bookstore-Owner
1838.Frequency-of-the-Most-Frequent-Elementhttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/1838.Frequency-of-the-Most-Frequent-Element
395.Longest-Substring-with-At-Least-K-Repeating-Charactershttps://github.com/wisdompeak/LeetCode/tree/master/Recursion/395.Longest-Substring-with-At-Least-K-Repeating-Characters
1763.Longest-Nice-Substringhttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/1763.Longest-Nice-Substring
2009.Minimum-Number-of-Operations-to-Make-Array-Continuoushttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/2009.Minimum-Number-of-Operations-to-Make-Array-Continuous
2024.Maximize-the-Confusion-of-an-Examhttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/2024.Maximize-the-Confusion-of-an-Exam
424.Longest-Repeating-Character-Replacementhttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/424.Longest-Repeating-Character-Replacement
2106.Maximum-Fruits-Harvested-After-at-Most-K-Stepshttps://github.com/wisdompeak/LeetCode/blob/master/Two_Pointers/2106.Maximum-Fruits-Harvested-After-at-Most-K-Steps
076.Minimum-Window-Substringhttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/076.Minimum-Window-Substring
003.Longest-Substring-Without-Repeating-Characterhttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/003.Longest%20Substring%20Without%20Repeating%20Characters
159.Longest-Substring-with-At-Most-Two-Distinct-Charactershttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/159.Longest-Substring-with-At-Most-Two-Distinct-Characters
340.Longest-Substring-with-At-Most-K-Distinct-Charactershttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/340.Longest-Substring-with-At-Most-K-Distinct-Characters
992.Subarrays-with-K-Different-Integershttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/992.Subarrays-with-K-Different-Integers
986.Interval-List-Intersectionshttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/986.Interval-List-Intersections
1229.Meeting-Schedulerhttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/1229.Meeting-Scheduler
1537.Get-the-Maximum-Scorehttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/1537.Get-the-Maximum-Score
1577.Number-of-Ways-Where-Square-of-Number-Is-Equal-to-Product-of-Two-Numbershttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/1577.Number-of-Ways-Where-Square-of-Number-Is-Equal-to-Product-of-Two-Numbers
1775.Equal-Sum-Arrays-With-Minimum-Number-of-Operationshttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/1775.Equal-Sum-Arrays-With-Minimum-Number-of-Operations
1868.Product-of-Two-Run-Length-Encoded-Arrayshttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/1868.Product-of-Two-Run-Length-Encoded-Arrays
2098.Subsequence-of-Size-K-With-the-Largest-Even-Sumhttps://github.com/wisdompeak/LeetCode/tree/master/Two_Pointers/2098.Subsequence-of-Size-K-With-the-Largest-Even-Sum
Binary Searchhttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search
https://patch-diff.githubusercontent.com/Nishant763/LeetCode#binary-search
004.Median-of-Two-Sorted-Arrayshttps://github.com/wisdompeak/LeetCode/tree/master/Priority_Queue/004.Median-of-Two-Sorted-Arrays
153.Find-Minimum-in-Rotated-Sorted-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/153.Find-Minimum-in-Rotated-Sorted-Array
154.Find-Minimum-in-Rotated-Sorted-Array-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/154.Find-Minimum-in-Rotated-Sorted-Array-II
033.Search-in-Rotated-Sorted-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/033.Search-in-Rotated-Sorted-Array
081.Search-in-Rotated-Sorted-Array-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/081.Search-in-Rotated-Sorted-Array-II
034.Search-for-a-Rangehttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/034.Search-for-a-Range
162.Find-Peak-Elementhttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/162.Find-Peak-Element
222.Count-Complete-Tree-Nodeshttps://github.com/wisdompeak/LeetCode/tree/master/Tree/222.Count-Complete-Tree-Nodes
275.H-index IIhttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/275.H-Index-II
302.Smallest-Rectangle-Enclosing-Black-Pixelshttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/302.Smallest-Rectangle-Enclosing-Black-Pixels
410.Split-Array-Largest-Sumhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/410.Split-Array-Largest-Sum
475.Heatershttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/475.Heaters
483.Smallest-Good-Basehttps://github.com/wisdompeak/LeetCode/blob/master/Binary_Search/483.Smallest-Good-Base
029.Divide-Two-Integershttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/029.Divide-Two-Integers
644.Maximum-Average-Subarray-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/644.Maximum-Average-Subarray-II
658.Find-K-Closest-Elementshttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/658.Find-K-Closest-Elements
1157.Online-Majority-Element-In-Subarrayhttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/1157.Online-Majority-Element-In-Subarray
1533.Find-the-Index-of-the-Large-Integerhttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/1533.Find-the-Index-of-the-Large-Integer
1712.Ways-to-Split-Array-Into-Three-Subarrayshttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/1712.Ways-to-Split-Array-Into-Three-Subarrays
1889.Minimum-Space-Wasted-From-Packaginghttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/1889.Minimum-Space-Wasted-From-Packaging
1901.Find-a-Peak-Element-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/1901.Find-a-Peak-Element-II
2106.Maximum-Fruits-Harvested-After-at-Most-K-Stepshttps://github.com/wisdompeak/LeetCode/blob/master/Two_Pointers/2106.Maximum-Fruits-Harvested-After-at-Most-K-Steps
2141.Maximum-Running-Time-of-N-Computershttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/2141.Maximum-Running-Time-of-N-Computers
1483.Kth-Ancestor-of-a-Tree-Nodehttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/1483.Kth-Ancestor-of-a-Tree-Node
1922.Count-Good-Numbershttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/1922.Count-Good-Numbers
215.Kth-Largest-Element-in-an-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/215.Kth-Largest-Element-in-an-Array
287.Find-the-Duplicate-Numberhttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/287.Find-the-Duplicate-Number
378.Kth-Smallest-Element-in-a-Sorted-Matrixhttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/378.Kth-Smallest-Element-in-a-Sorted-Matrix
373.Find-K-Pairs-with-Smallest-Sumshttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/373.Find-K-Pairs-with-Smallest-Sums
668.Kth-Smallest-Number-in-Multiplication-Tablehttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/668.Kth-Smallest-Number-in-Multiplication-Table
719.Find-Kth-Smallest-Pair-Distancehttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/719.Find-K-th-Smallest-Pair-Distance
1918.Kth-Smallest-Subarray-Sumhttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/1918.Kth-Smallest-Subarray-Sum
2040.Kth-Smallest-Product-of-Two-Sorted-Arrayshttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/2040.Kth-Smallest-Product-of-Two-Sorted-Arrays
1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rowshttps://github.com/wisdompeak/LeetCode/tree/master/Priority_Queue/1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows
774.Minimize-Max-Distance-to-Gas-Stationhttps://github.com/wisdompeak/LeetCode/tree/master/Priority_Queue/774.Minimize-Max-Distance-to-Gas-Station
786.Kth-Smallest-Prime-Fractionhttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/786.K-th%20Smallest-Prime-Fraction
793.Preimage-Size-of-Factorial-Zeroes-Functionhttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/793.Preimage-Size-of-Factorial-Zeroes-Function
1011.Capacity-To-Ship-Packages-Within-D-Dayshttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/1011.Capacity-To-Ship-Packages-Within-D-Days
1060.Missing-Element-in-Sorted-Arrayhttps://github.com/wisdompeak/LeetCode/blob/master/Binary_Search/1060.Missing-Element-in-Sorted-Array
1102.Path-With-Maximum-Minimum-Valuehttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/1102.Path-With-Maximum-Minimum-Value
1539.Kth-Missing-Positive-Numberhttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/1539.Kth-Missing-Positive-Number
1201.Ugly-Number-IIIhttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/1201.Ugly-Number-III
1231.Divide-Chocolatehttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/1231.Divide-Chocolate
1283.Find-the-Smallest-Divisor-Given-a-Thresholdhttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/1283.Find-the-Smallest-Divisor-Given-a-Threshold
1292.Maximum-Side-Length-of-a-Square-with-Sum-Less-than-or-Equal-to-Thresholdhttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/1292.Maximum-Side-Length-of-a-Square-with-Sum-Less-than-or-Equal-to-Threshold
1300.Sum-of-Mutated-Array-Closest-to-Targethttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/1300.Sum-of-Mutated-Array-Closest-to-Target
1482.Minimum-Number-of-Days-to-Make-m-Bouquetshttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/1482.Minimum-Number-of-Days-to-Make-m-Bouquets
1508.Range-Sum-of-Sorted-Subarray-Sumshttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/1508.Range-Sum-of-Sorted-Subarray-Sums
1552.Magnetic-Force-Between-Two-Ballshttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/1552.Magnetic-Force-Between-Two-Balls
1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-Xhttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X
1648.Sell-Diminishing-Valued-Colored-Ballshttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/1648.Sell-Diminishing-Valued-Colored-Balls
1802.Maximum-Value-at-a-Given-Index-in-a-Bounded-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/1802.Maximum-Value-at-a-Given-Index-in-a-Bounded-Array
1870.Minimum-Speed-to-Arrive-on-Timehttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/1870.Minimum-Speed-to-Arrive-on-Time
1898.Maximum-Number-of-Removable-Charactershttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/1898.Maximum-Number-of-Removable-Characters
1891.Cutting-Ribbonshttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/1891.Cutting-Ribbons
2064.Minimized-Maximum-of-Products-Distributed-to-Any-Storehttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/2064.Minimized-Maximum-of-Products-Distributed-to-Any-Store
2071.Maximum-Number-of-Tasks-You-Can-Assignhttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/2071.Maximum-Number-of-Tasks-You-Can-Assign
2102.Sequentially-Ordinal-Rank-Trackerhttps://github.com/wisdompeak/LeetCode/tree/master/Heap/2102.Sequentially-Ordinal-Rank-Tracker
2137.Pour-Water-Between-Buckets-to-Make-Water-Levels-Equalhttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/2137.Pour-Water-Between-Buckets-to-Make-Water-Levels-Equal
Hash Tablehttps://github.com/wisdompeak/LeetCode/tree/master/Hash
https://patch-diff.githubusercontent.com/Nishant763/LeetCode#hash-table
049.Group-Anagramshttps://github.com/wisdompeak/LeetCode/tree/master/Hash/049.Group-Anagrams
149.Max-Points-on-a-Linehttps://github.com/wisdompeak/LeetCode/tree/master/Hash/149.Max-Points-on-a-Line
166.Fraction-to-Recurring-Decimalhttps://github.com/wisdompeak/LeetCode/tree/master/Hash/166.Fraction-to-Recurring-Decimal
170.Two-Sum-III-Data-structure-designhttps://github.com/wisdompeak/LeetCode/tree/master/Hash/170.Two-Sum-III-Data-structure-design
392.Is-Subsequencehttps://github.com/wisdompeak/LeetCode/tree/master/Hash/392.Is-Subsequence
204.Count Primeshttps://github.com/wisdompeak/LeetCode/tree/master/Hash/204.Count-Primes
274.H-Indexhttps://github.com/wisdompeak/LeetCode/tree/master/Hash/274.H-Index
325.Maximum-Size-Subarray-Sum-Equals-khttps://github.com/wisdompeak/LeetCode/tree/master/Hash/325.Maximum-Size-Subarray-Sum-Equals-k
409.Longest-Palindromehttps://github.com/wisdompeak/LeetCode/tree/master/Hash/409.Longest-Palindrome
447.Number-of-Boomerangshttps://github.com/wisdompeak/LeetCode/tree/master/Hash/447.Number-of-Boomerangs
438.Find-All-Anagrams-in-a-Stringhttps://github.com/wisdompeak/LeetCode/tree/master/Hash/438.Find-All-Anagrams-in-a-String
356.Line-Reflectionhttps://github.com/wisdompeak/LeetCode/tree/master/Hash/356.Line-Reflection
594.Longest-Harmonious-Subsequencehttps://github.com/wisdompeak/LeetCode/tree/master/Hash/594.Longest-Harmonious-Subsequence
532.K-diff-Pairs-in-an-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Hash/532.K-diff-Pairs-in-an-Array
446.Arithmetic-Slices-II-Subsequencehttps://github.com/wisdompeak/LeetCode/tree/master/Hash/446.Arithmetic-Slices-II-Subsequence
128.Longest-Consecutive-Sequencehttps://github.com/wisdompeak/LeetCode/tree/master/Union_Find/128.Longest-Consecutive-Sequence
753.Cracking-the-Safehttps://github.com/wisdompeak/LeetCode/tree/master/Hash/753.Cracking-the-Safe
890.Find-and-Replace-Patternhttps://github.com/wisdompeak/LeetCode/tree/master/Hash/890.Find-and-Replace-Pattern
939.Minimum-Area-Rectanglehttps://github.com/wisdompeak/LeetCode/tree/master/Hash/939.Minimum-Area-Rectangle
1074.Number-of-Submatrices-That-Sum-to-Targethttps://github.com/wisdompeak/LeetCode/tree/master/Hash/1074.Number-of-Submatrices-That-Sum-to-Target
1487.Making-File-Names-Uniquehttps://github.com/wisdompeak/LeetCode/tree/master/Hash/1487.Making-File-Names-Unique
1573.Number-of-Ways-to-Split-a-Stringhttps://github.com/wisdompeak/LeetCode/tree/master/Hash/1573.Number-of-Ways-to-Split-a-String
2131.Longest-Palindrome-by-Concatenating-Two-Letter-Wordshttps://github.com/wisdompeak/LeetCode/tree/master/Hash/2131.Longest-Palindrome-by-Concatenating-Two-Letter-Words
525.Contiguous-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Hash/525.Contiguous-Array
930.Binary-Subarrays-With-Sumhttps://github.com/wisdompeak/LeetCode/tree/master/Hash/930.Binary-Subarrays-With-Sum
1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XORhttps://github.com/wisdompeak/LeetCode/tree/master/Bit_Manipulation/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR
1524.Number-of-Sub-arrays-With-Odd-Sum https://github.com/wisdompeak/LeetCode/tree/master/Hash/1524.Number-of-Sub-arrays-With-Odd-Sum
974.Subarray-Sums-Divisible-by-Khttps://github.com/wisdompeak/LeetCode/tree/master/Hash/974.Subarray-Sums-Divisible-by-K
1590.Make-Sum-Divisible-by-Phttps://github.com/wisdompeak/LeetCode/tree/master/Hash/1590.Make-Sum-Divisible-by-P
1658.Minimum-Operations-to-Reduce-X-to-Zerohttps://github.com/wisdompeak/LeetCode/tree/master/Hash/1658.Minimum-Operations-to-Reduce-X-to-Zero
1371.Find-the-Longest-Substring-Containing-Vowels-in-Even-Countshttps://github.com/wisdompeak/LeetCode/tree/master/Hash/1371.Find-the-Longest-Substring-Containing-Vowels-in-Even-Counts
1542.Find-Longest-Awesome-Substringhttps://github.com/wisdompeak/LeetCode/tree/master/Hash/1542.Find-Longest-Awesome-Substring
1915.Number-of-Wonderful-Substringshttps://github.com/wisdompeak/LeetCode/tree/master/Hash/1915.Number-of-Wonderful-Substrings
1983.Widest-Pair-of-Indices-With-Equal-Range-Sumhttps://github.com/wisdompeak/LeetCode/tree/master/Hash/1983.Widest-Pair-of-Indices-With-Equal-Range-Sum
2025.Maximum-Number-of-Ways-to-Partition-an-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Hash/2025.Maximum-Number-of-Ways-to-Partition-an-Array
Heaphttps://github.com/wisdompeak/LeetCode/tree/master/Heap
https://patch-diff.githubusercontent.com/Nishant763/LeetCode#heap
220.Contains-Duplicate-IIIhttps://github.com/wisdompeak/LeetCode/tree/master/Heap/220.Contains-Duplicate-III
295.Find-Median-from-Data-Streamhttps://github.com/wisdompeak/LeetCode/tree/master/Heap/295.Find-Median-from-Data-Stream
363.Max-Sum-of-Rectangle-No-Larger-Than-Khttps://github.com/wisdompeak/LeetCode/tree/master/Heap/363.Max-Sum-of-Rectangle-No-Larger-Than-K
352.Data-Stream-as-Disjoint-Intervalshttps://github.com/wisdompeak/LeetCode/tree/master/Heap/352.Data-Stream-as-Disjoint-Intervals
480.Sliding-Window-Medianhttps://github.com/wisdompeak/LeetCode/blob/master/Heap/480.Sliding-Window-Median
218.The-Skyline-Problemhttps://github.com/wisdompeak/LeetCode/blob/master/Segment_Tree/218.The-Skyline-Problem
699.Falling-Squareshttps://github.com/wisdompeak/LeetCode/tree/master/Segment_Tree/699.Falling-Squares
715.Range-Modulehttps://github.com/wisdompeak/LeetCode/tree/master/Segment_Tree/715.Range-Module
729.My-Calendar-Ihttps://github.com/wisdompeak/LeetCode/tree/master/Heap/729.My-Calendar-I
975.Odd-Even-Jumphttps://github.com/wisdompeak/LeetCode/tree/master/Heap/975.Odd-Even-Jump
632.Smallest-Range-Covering-Elements-from-K-Listshttps://github.com/wisdompeak/LeetCode/tree/master/Heap/632.Smallest-Range-Covering-Elements-from-K-Lists
1675.Minimize-Deviation-in-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Heap/1675.Minimize-Deviation-in-Array
1296.Divide-Array-in-Sets-of-K-Consecutive-Numbershttps://github.com/wisdompeak/LeetCode/tree/master/Heap/1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers
1606.Find-Servers-That-Handled-Most-Number-of-Requestshttps://github.com/wisdompeak/LeetCode/tree/master/Heap/1606.Find-Servers-That-Handled-Most-Number-of-Requests
1825.Finding-MK-Averagehttps://github.com/wisdompeak/LeetCode/tree/master/Heap/1825.Finding-MK-Average
1847.Closest-Roomhttps://github.com/wisdompeak/LeetCode/tree/master/Heap/1847.Closest-Room
1912.Design-Movie-Rental-Systemhttps://github.com/wisdompeak/LeetCode/tree/master/Heap/1912.Design-Movie-Rental-System
2071.Maximum-Number-of-Tasks-You-Can-Assignhttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/2071.Maximum-Number-of-Tasks-You-Can-Assign
Treehttps://github.com/wisdompeak/LeetCode/tree/master/Tree
https://patch-diff.githubusercontent.com/Nishant763/LeetCode#tree
144.Binary-Tree-Preorder-Traversalhttps://github.com/wisdompeak/LeetCode/tree/master/Tree/144.Binary-Tree-Preorder-Traversal
145.Binary-Tree-Postorder-Traversalhttps://github.com/wisdompeak/LeetCode/tree/master/Tree/145.Binary-Tree-Postorder-Traversal
270.Closest-Binary-Search-Tree-Valuehttps://github.com/wisdompeak/LeetCode/tree/master/Tree/270.Closest-Binary-Search-Tree-Value
095.Unique-Binary-Search-Trees-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Tree/095.Unique-Binary-Search-Trees-II
094.Binary Tree Inorder Traversalhttps://github.com/wisdompeak/LeetCode/tree/master/Tree/094.Binary-Tree-Inorder-Traversal
110.Balanced-Binary-Treehttps://github.com/wisdompeak/LeetCode/tree/master/Tree/110.Balanced-Binary-Tree
222.Count-Complete-Tree-Nodeshttps://github.com/wisdompeak/LeetCode/tree/master/Tree/222.Count-Complete-Tree-Nodes
099.Recover-Binary-Search-Treehttps://github.com/wisdompeak/LeetCode/tree/master/Tree/099.Recover-Binary-Search-Tree
114.Flatten-Binary-Tree-to-Linked-Listhttps://github.com/wisdompeak/LeetCode/tree/master/Tree/114.Flatten-Binary-Tree-to-Linked-List
098.Validate-Binary-Search-Treehttps://github.com/wisdompeak/LeetCode/tree/master/Tree/098.Validate-Binary-Search-Tree
117.Populating Next Right Pointers in Each Node IIhttps://github.com/wisdompeak/LeetCode/tree/master/Tree/117.Populating-Next-Right-Pointers-in-Each-Node-II
156.Binary-Tree-Upside-Downhttps://github.com/wisdompeak/LeetCode/blob/master/Tree/156.Binary-Tree-Upside-Down
285.Inorder-Successor-in-BSThttps://github.com/wisdompeak/LeetCode/blob/master/Tree/285.Inorder-Successor-in-BST
298.Binary-Tree-Longest-Consecutive Sequencehttps://github.com/wisdompeak/LeetCode/tree/master/Tree/298.Binary-Tree-Longest-Consecutive-Sequence
450.Delete-Node-in-a-BSThttps://github.com/wisdompeak/LeetCode/tree/master/Tree/450.Delete-Node-in-a-BST
437.Path-Sum-IIIhttps://github.com/wisdompeak/LeetCode/tree/master/Tree/437.Path-Sum-III
333.Largest-BST-Subtreehttps://github.com/wisdompeak/LeetCode/blob/master/Tree/333.Largest-BST-Subtree
572.Subtree-of-Another-Treehttps://github.com/wisdompeak/LeetCode/tree/master/Tree/572.Subtree-of-Another-Tree
549.Binary-Tree-Longest-Consecutive-Sequence-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Tree/549.Binary-Tree-Longest-Consecutive-Sequence-II
173.Binary-Search-Tree-Iteratorhttps://github.com/wisdompeak/LeetCode/tree/master/Stack/173.Binary-Search-Tree-Iterator
545.Boundary-of-Binary-Treehttps://github.com/wisdompeak/LeetCode/tree/master/Tree/545.Boundary-of-Binary-Tree
272.Closest-Binary-Search-Tree-Value-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Tree/272.Closest-Binary-Search-Tree-Value-II
226.Invert-Binary-Treehttps://github.com/wisdompeak/LeetCode/tree/master/Tree/226.Invert-Binary-Tree
655.Print-Binary-Treehttps://github.com/wisdompeak/LeetCode/tree/master/Tree/655.Print-Binary-Tree
897.Increasing-Order-Search-Treehttps://github.com/wisdompeak/LeetCode/tree/master/Tree/897.Increasing-Order-Search-Tree
662.Maximum-Width-of-Binary-Treehttps://github.com/wisdompeak/LeetCode/tree/master/Tree/662.Maximum-Width-of-Binary-Tree
863.All-Nodes-Distance-K-in-Binary-Treehttps://github.com/wisdompeak/LeetCode/tree/master/Tree/863.All-Nodes-Distance-K-in-Binary-Tree
958.Check-Completeness-of-a-Binary-Treehttps://github.com/wisdompeak/LeetCode/blob/master/Tree/954.Check-Completeness-of-a-Binary-Tree/
1104.Path-In-Zigzag-Labelled-Binary-Treehttps://github.com/wisdompeak/LeetCode/tree/master/Tree/1104.Path-In-Zigzag-Labelled-Binary-Tree
1660.Correct-a-Binary-Treehttps://github.com/wisdompeak/LeetCode/tree/master/Tree/1660.Correct-a-Binary-Tree
1666.Change-the-Root-of-a-Binary-Treehttps://github.com/wisdompeak/LeetCode/tree/master/Tree/1666.Change-the-Root-of-a-Binary-Tree
1932.Merge-BSTs-to-Create-Single-BSThttps://github.com/wisdompeak/LeetCode/tree/master/Tree/1932.Merge-BSTs-to-Create-Single-BST
2003.Smallest-Missing-Genetic-Value-in-Each-Subtreehttps://github.com/wisdompeak/LeetCode/tree/master/Tree/2003.Smallest-Missing-Genetic-Value-in-Each-Subtree
543.Diameter-of-Binary-Treehttps://github.com/wisdompeak/LeetCode/tree/master/Tree/543.Diameter-of-Binary-Tree
124.Binary-Tree-Maximum-Path-Sumhttps://github.com/wisdompeak/LeetCode/tree/master/Tree/124.Binary-Tree-Maximum-Path-Sum
687.Longest-Univalue-Pathhttps://github.com/wisdompeak/LeetCode/tree/master/Tree/687.Longest-Univalue-Path
2049.Count-Nodes-With-the-Highest-Scorehttps://github.com/wisdompeak/LeetCode/tree/master/Tree/2049.Count-Nodes-With-the-Highest-Score
297.Serialize-and-Deserialize-Binary-Treehttps://github.com/wisdompeak/LeetCode/tree/master/Tree/297.Serialize-and-Deserialize-Binary-Tree
652.Find-Duplicate-Subtreeshttps://github.com/wisdompeak/LeetCode/tree/master/Tree/652.Find-Duplicate-Subtrees
1948.Delete-Duplicate-Folders-in-Systemhttps://github.com/wisdompeak/LeetCode/tree/master/Tree/1948.Delete-Duplicate-Folders-in-System
105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversalhttps://github.com/wisdompeak/LeetCode/tree/master/Tree/105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal
106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversalhttps://github.com/wisdompeak/LeetCode/tree/master/Tree/106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal
331.Verify-Preorder-Serialization-of-a-Binary-Treehttps://github.com/wisdompeak/LeetCode/tree/master/Tree/331.Verify-Preorder-Serialization-of-a-Binary-Tree
449.Serialize-and-Deserialize-BSThttps://github.com/wisdompeak/LeetCode/tree/master/Tree/449.Serialize-and-Deserialize-BST
654.Maximum-Binary-Treehttps://github.com/wisdompeak/LeetCode/tree/master/Stack/654.Maximum-Binary-Tree
971.Flip-Binary-Tree-To-Match-Preorder-Traversalhttps://github.com/wisdompeak/LeetCode/tree/master/Tree/971.Flip-Binary-Tree-To-Match-Preorder-Traversal
1028.Recover-a-Tree-From-Preorder-Traversalhttps://github.com/wisdompeak/LeetCode/tree/master/Tree/1028.Recover-a-Tree-From-Preorder-Traversal
1569.Number-of-Ways-to-Reorder-Array-to-Get-Same-BSThttps://github.com/wisdompeak/LeetCode/tree/master/Tree/1569.Number-of-Ways-to-Reorder-Array-to-Get-Same-BST
1597.Build-Binary-Expression-Tree-From-Infix-Expressionhttps://github.com/wisdompeak/LeetCode/tree/master/Tree/1597.Build-Binary-Expression-Tree-From-Infix-Expression
1902.Depth-of-BST-Given-Insertion-Orderhttps://github.com/wisdompeak/LeetCode/tree/master/Tree/1902.Depth-of-BST-Given-Insertion-Order
1123.Lowest-Common-Ancestor-of-Deepest-Leaveshttps://github.com/wisdompeak/LeetCode/tree/master/Tree/1123.Lowest-Common-Ancestor-of-Deepest-Leaves
235.Lowest-Common-Ancestor-of-a-Binary-Search-Treehttps://github.com/wisdompeak/LeetCode/tree/master/Tree/236.Lowest-Common-Ancestor-of-a-Binary-Tree
236.Lowest-Common-Ancestor-of-a-Binary-Treehttps://github.com/wisdompeak/LeetCode/tree/master/Tree/236.Lowest-Common-Ancestor-of-a-Binary-Tree
1644.Lowest-Common-Ancestor-of-a-Binary-Tree-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Tree/1644.Lowest-Common-Ancestor-of-a-Binary-Tree-II
1676.Lowest-Common-Ancestor-of-a-Binary-Tree-IVhttps://github.com/wisdompeak/LeetCode/tree/master/Tree/1676.Lowest-Common-Ancestor-of-a-Binary-Tree-IV
1650.Lowest-Common-Ancestor-of-a-Binary-Tree-IIIhttps://github.com/wisdompeak/LeetCode/tree/master/Tree/1650.Lowest-Common-Ancestor-of-a-Binary-Tree-III
1740.Find-Distance-in-a-Binary-Treehttps://github.com/wisdompeak/LeetCode/tree/master/Tree/1740.Find-Distance-in-a-Binary-Tree
2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Anotherhttps://github.com/wisdompeak/LeetCode/tree/master/Tree/2096.Step-By-Step-Directions-From-a-Binary-Tree-Node-to-Another
428.Serialize-and-Deserialize-N-ary-Treehttps://github.com/wisdompeak/LeetCode/tree/master/Tree/428.Serialize-and-Deserialize-N-ary-Tree
431.Encode-N-ary-Tree-to-Binary-Treehttps://github.com/wisdompeak/LeetCode/tree/master/Tree/431.Encode-N-ary-Tree-to-Binary-Tree
1516.Move-Sub-Tree-of-N-Ary-Treehttps://github.com/wisdompeak/LeetCode/tree/master/Tree/1516.Move-Sub-Tree-of-N-Ary-Tree
823https://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/823.Binary-Trees-With-Factors
1902https://github.com/wisdompeak/LeetCode/tree/master/Tree/1902.Depth-of-BST-Given-Insertion-Order
Segment Treehttps://github.com/wisdompeak/LeetCode/blob/master/Segment_Tree/
https://patch-diff.githubusercontent.com/Nishant763/LeetCode#segment-tree
307.Range-Sum-Query-Mutablehttps://github.com/wisdompeak/LeetCode/blob/master/Segment_Tree/307.Range-Sum-Query-Mutable/
1526.Minimum-Number-of-Increments-on-Subarrays-to-Form-a-Target-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1526.Minimum-Number-of-Increments-on-Subarrays-to-Form-a-Target-Array
1649.Create-Sorted-Array-through-Instructionshttps://github.com/wisdompeak/LeetCode/tree/master/Divide_Conquer/1649.Create-Sorted-Array-through-Instructions
1157.Online-Majority-Element-In-Subarrayhttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/1157.Online-Majority-Element-In-Subarray
370.Range-Additionhttps://github.com/wisdompeak/LeetCode/tree/master/Segment_Tree/370.Range-Addition
218.The-Skyline-Problemhttps://github.com/wisdompeak/LeetCode/blob/master/Segment_Tree/218.The-Skyline-Problem
699.Falling-Squareshttps://github.com/wisdompeak/LeetCode/tree/master/Segment_Tree/699.Falling-Squares
715.Range-Modulehttps://github.com/wisdompeak/LeetCode/tree/master/Segment_Tree/715.Range-Module
https://patch-diff.githubusercontent.com/Nishant763/LeetCode#binary-index-tree
307.Range-Sum-Query-Mutablehttps://github.com/wisdompeak/LeetCode/blob/master/Segment_Tree/307.Range-Sum-Query-Mutable/
1649.Create-Sorted-Array-through-Instructionshttps://github.com/wisdompeak/LeetCode/tree/master/Divide_Conquer/1649.Create-Sorted-Array-through-Instructions
2031.Count-Subarrays-With-More-Ones-Than-Zeroshttps://github.com/wisdompeak/LeetCode/tree/master/Segment_Tree/2031.Count-Subarrays-With-More-Ones-Than-Zeros
2179.Count-Good-Triplets-in-an-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Segment_Tree/2179.Count-Good-Triplets-in-an-Array
Designhttps://github.com/wisdompeak/LeetCode/tree/master/Design
https://patch-diff.githubusercontent.com/Nishant763/LeetCode#design
146.LRU-Cachehttps://github.com/wisdompeak/LeetCode/tree/master/Design/146.LRU-Cache
460.LFU Cachehttps://github.com/wisdompeak/LeetCode/tree/master/Design/460.LFU-Cache
432.All-O-one-Data-Structurehttps://github.com/wisdompeak/LeetCode/tree/master/Design/432.All-O-one-Data-Structure
380.Insert-Delete-GetRandom-O(1)https://github.com/wisdompeak/LeetCode/tree/master/Design/380.Insert-Delete-GetRandom-O-1/
381.Insert-Delete-GetRandom-O1-Duplicates-allowedhttps://github.com/wisdompeak/LeetCode/tree/master/Design/381.Insert-Delete-GetRandom-O1-Duplicates-allowed
716.Max-Stackhttps://github.com/wisdompeak/LeetCode/tree/master/Design/716.Max-Stack
355.Design-Twitterhttps://github.com/wisdompeak/LeetCode/tree/master/Design/355.Design-Twitter
535.Encode-and-Decode-TinyURLhttps://github.com/wisdompeak/LeetCode/tree/master/Design/535.Encode-and-Decode-TinyURL
631.Design-Excel-Sum-Formulahttps://github.com/wisdompeak/LeetCode/tree/master/Design/631.Design-Excel-Sum-Formula
642.Design-Search-Autocomplete-Systemhttps://github.com/wisdompeak/LeetCode/tree/master/Design/642.Design-Search-Autocomplete-System
895.Maximum-Frequency-Stackhttps://github.com/wisdompeak/LeetCode/tree/master/Design/895.Maximum-Frequency-Stack
1146.Snapshot-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Design/1146.Snapshot-Array
1172.Dinner-Plate-Stackshttps://github.com/wisdompeak/LeetCode/tree/master/Design/1172.Dinner-Plate-Stacks
1381.Design-a-Stack-With-Increment-Operationhttps://github.com/wisdompeak/LeetCode/tree/master/Design/1381.Design-a-Stack-With-Increment-Operation
1352.Product-of-the-Last-K-Numbershttps://github.com/wisdompeak/LeetCode/tree/master/Design/1352.Product-of-the-Last-K-Numbers
1418.Display-Table-of-Food-Orders-in-a-Restauranthttps://github.com/wisdompeak/LeetCode/tree/master/Design/1418.Display-Table-of-Food-Orders-in-a-Restaurant
1622.Fancy-Sequencehttps://github.com/wisdompeak/LeetCode/tree/master/Design/1622.Fancy-Sequence
1801.Number-of-Orders-in-the-Backloghttps://github.com/wisdompeak/LeetCode/tree/master/Design/1801.Number-of-Orders-in-the-Backlog
2166.Design-Bitsethttps://github.com/wisdompeak/LeetCode/tree/master/Design/2166.Design-Bitset
Stackhttps://github.com/wisdompeak/LeetCode/tree/master/Stack
https://patch-diff.githubusercontent.com/Nishant763/LeetCode#stack
032.Longest-Valid-Parentheseshttps://github.com/wisdompeak/LeetCode/tree/master/Stack/032.Longest-Valid-Parentheses
155.Min-Stackhttps://github.com/wisdompeak/LeetCode/tree/master/Stack/155.Min-Stack
225.Implement Stack using Queueshttps://github.com/wisdompeak/LeetCode/tree/master/Stack/225.Implement-Stack-using-Queues
232.Implement-Queue-using-Stackshttps://github.com/wisdompeak/LeetCode/tree/master/Stack/232.Implement-Queue-using-Stacks
341.Flatten-Nested-List-Iteratorhttps://github.com/wisdompeak/LeetCode/blob/master/Stack/341.Flatten-Nested-List-Iterator/Readme.md
173.Binary-Search-Tree-Iteratorhttps://github.com/wisdompeak/LeetCode/tree/master/Stack/173.Binary-Search-Tree-Iterator
536.Construct-Binary-Tree-from-Stringhttps://github.com/wisdompeak/LeetCode/tree/master/Stack/536.Construct-Binary-Tree-from-String
456.132-Patternhttps://github.com/wisdompeak/LeetCode/tree/master/Stack/456.132-Pattern
636.Exclusive-Time-of-Functionshttps://github.com/wisdompeak/LeetCode/tree/master/Stack/636.Exclusive-Time-of-Functions
856.Score-of-Parentheseshttps://github.com/wisdompeak/LeetCode/tree/master/Stack/856.Score-of-Parentheses
946.Validate-Stack-Sequenceshttps://github.com/wisdompeak/LeetCode/tree/master/Stack/946.Validate-Stack-Sequences
1190.Reverse-Substrings-Between-Each-Pair-of-Parentheseshttps://github.com/wisdompeak/LeetCode/tree/master/Stack/1190.Reverse-Substrings-Between-Each-Pair-of-Parentheses
1209.Remove-All-Adjacent-Duplicates-in-String-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Stack/1209.Remove-All-Adjacent-Duplicates-in-String-II
1586.Binary-Search-Tree-Iterator-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Stack/1586.Binary-Search-Tree-Iterator-II
2197.Replace-Non-Coprime-Numbers-in-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Stack/2197.Replace-Non-Coprime-Numbers-in-Array
042.Trapping-Rain-Waterhttps://github.com/wisdompeak/LeetCode/tree/master/Others/042.Trapping-Rain-Water
084.Largest-Rectangle-in-Histogramhttps://github.com/wisdompeak/LeetCode/tree/master/Stack/084.Largest-Rectangle-in-Histogram
085.Maximal-Rectanglehttps://github.com/wisdompeak/LeetCode/tree/master/Stack/085.Maximal-Rectangle
255.Verify-Preorder-Sequence-in-Binary-Search-Treehttps://github.com/wisdompeak/LeetCode/tree/master/Tree/255.Verify-Preorder-Sequence-in-Binary-Search-Tree
496.Next-Greater-Element-Ihttps://github.com/wisdompeak/LeetCode/tree/master/Stack/496.Next-Greater-Element-I
503.Next-Greater-Element-IIhttps://github.com/wisdompeak/LeetCode/blob/master/Stack/503.Next-Greater-Element-II
221.Maximal-Squarehttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/221.Maximal-Square
654.Maximum-Binary-Treehttps://github.com/wisdompeak/LeetCode/tree/master/Stack/654.Maximum-Binary-Tree
739.Daily-Temperatureshttps://github.com/wisdompeak/LeetCode/tree/master/Stack/739.Daily-Temperatures
768.Max-Chunks-To-Make-Sorted-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Stack/768.Max-Chunks-To-Make-Sorted-II
901.Online-Stock-Spanhttps://github.com/wisdompeak/LeetCode/tree/master/Stack/901.Online-Stock-Span
907.Sum-of-Subarray-Minimumshttps://github.com/wisdompeak/LeetCode/tree/master/Stack/907.Sum-of-Subarray-Minimums
1856.Maximum-Subarray-Min-Producthttps://github.com/wisdompeak/LeetCode/tree/master/Stack/1856.Maximum-Subarray-Min-Product
2104.Sum-of-Subarray-Rangeshttps://github.com/wisdompeak/LeetCode/tree/master/Stack/2104.Sum-of-Subarray-Ranges
962.Maximum-Width-Ramphttps://github.com/wisdompeak/LeetCode/tree/master/Stack/962.Maximum-Width-Ramp
1019.Next-Greater-Node-In-Linked-Listhttps://github.com/wisdompeak/LeetCode/tree/master/Stack/1019.Next-Greater-Node-In-Linked-List
1063.Number-of-Valid-Subarrayshttps://github.com/wisdompeak/LeetCode/tree/master/Stack/1063.Number-of-Valid-Subarrays
1124.Longest-Well-Performing-Intervalhttps://github.com/wisdompeak/LeetCode/tree/master/Stack/1124.Longest-Well-Performing-Interval
1130.Minimum-Cost-Tree-From-Leaf-Valueshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1130.Minimum-Cost-Tree-From-Leaf-Values
1944.Number-of-Visible-People-in-a-Queuehttps://github.com/wisdompeak/LeetCode/tree/master/Stack/1944.Number-of-Visible-People-in-a-Queue
1950.Maximum-of-Minimum-Values-in-All-Subarrayshttps://github.com/wisdompeak/LeetCode/tree/master/Stack/1950.Maximum-of-Minimum-Values-in-All-Subarrays
1966.Binary-Searchable-Numbers-in-an-Unsorted-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Stack/1966.Binary-Searchable-Numbers-in-an-Unsorted-Array
402.Remove-K-Digitshttps://github.com/wisdompeak/LeetCode/tree/master/Stack/402.Remove-K-Digits
1673.Find-the-Most-Competitive-Subsequencehttps://github.com/wisdompeak/LeetCode/tree/master/Stack/1673.Find-the-Most-Competitive-Subsequence
2030.Smallest-K-Length-Subsequence-With-Occurrences-of-a-Letterhttps://github.com/wisdompeak/LeetCode/tree/master/Stack/2030.Smallest-K-Length-Subsequence-With-Occurrences-of-a-Letter
316.Remove-Duplicate-Lettershttps://github.com/wisdompeak/LeetCode/tree/master/Stack/316.Remove-Duplicate-Letters
1081.Smallest-Subsequence-of-Distinct-Charactershttps://github.com/wisdompeak/LeetCode/tree/master/Stack/1081.Smallest-Subsequence-of-Distinct-Characters
321.Create-Maximum-Numberhttps://github.com/wisdompeak/LeetCode/tree/master/Stack/321.Create-Maximum-Number
071.Simplify-Pathhttps://github.com/wisdompeak/LeetCode/tree/master/Stack/071.Simplify-Path
224.Basic-Calculatorhttps://github.com/wisdompeak/LeetCode/tree/master/Stack/224.Basic-Calculator
227.Basic-Calculator-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Stack/227.Basic-Calculator-II
772.Basic-Calculator-IIIhttps://github.com/wisdompeak/LeetCode/tree/master/Stack/772.Basic-Calculator-III
385.Mini-Parserhttps://github.com/wisdompeak/LeetCode/tree/master/Stack/385.Mini-Parser
439.Ternary-Expression-Parserhttps://github.com/wisdompeak/LeetCode/tree/master/Stack/439.Ternary-Expression-Parser
591.Tag-Validatorhttps://github.com/wisdompeak/LeetCode/blob/master/Stack/591.Tag-Validator/
726.Number-of-Atomshttps://github.com/wisdompeak/LeetCode/tree/master/Stack/726.Number-of-Atoms
1087.Brace-Expansionhttps://github.com/wisdompeak/LeetCode/tree/master/Stack/1087.Brace-Expansion
1096.Brace-Expansion-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Stack/1096.Brace-Expansion-II
1106.Parsing-A-Boolean-Expressionhttps://github.com/wisdompeak/LeetCode/tree/master/Stack/1106.Parsing-A-Boolean-Expression
1896.Minimum-Cost-to-Change-the-Final-Value-of-Expressionhttps://github.com/wisdompeak/LeetCode/tree/master/Stack/1896.Minimum-Cost-to-Change-the-Final-Value-of-Expression
Dequehttps://github.com/wisdompeak/LeetCode/tree/master/Deque
https://patch-diff.githubusercontent.com/Nishant763/LeetCode#deque
239.Sliding-Window-Maximumhttps://github.com/wisdompeak/LeetCode/tree/master/Deque/239.Sliding-Window-Maximum
862.Shortest-Subarray-with-Sum-at-Least-Khttps://github.com/wisdompeak/LeetCode/tree/master/Deque/862.Shortest-Subarray-with-Sum-at-Least-K
1425.Constrained-Subsequence-Sumhttps://github.com/wisdompeak/LeetCode/tree/master/Deque/1425.Constrained-Subsequence-Sum
1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limithttps://github.com/wisdompeak/LeetCode/tree/master/Deque/1438.Longest-Continuous-Subarray-With-Absolute-Diff-Less-Than-or-Equal-to-Limit
1499.Max-Value-of-Equationhttps://github.com/wisdompeak/LeetCode/tree/master/Deque/1499.Max-Value-of-Equation
1562.Find-Latest-Group-of-Size-Mhttps://github.com/wisdompeak/LeetCode/tree/master/Deque/1562.Find-Latest-Group-of-Size-M
1696.Jump-Game-VIhttps://github.com/wisdompeak/LeetCode/tree/master/Deque/1696.Jump-Game-VI
1776.Car-Fleet-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Deque/1776.Car-Fleet-II
Priority Queuehttps://github.com/wisdompeak/LeetCode/tree/master/Priority_Queue
https://patch-diff.githubusercontent.com/Nishant763/LeetCode#priority-queue
004.Median-of-Two-Sorted-Arrayshttps://github.com/wisdompeak/LeetCode/tree/master/Priority_Queue/004.Median-of-Two-Sorted-Arrays
642.Design-Search-Autocomplete-Systemhttps://github.com/wisdompeak/LeetCode/tree/master/Design/642.Design-Search-Autocomplete-System
774.Minimize-Max-Distance-to-Gas-Stationhttps://github.com/wisdompeak/LeetCode/tree/master/Priority_Queue/774.Minimize-Max-Distance-to-Gas-Station
871.Minimum-Number-of-Refueling-Stopshttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/871.Minimum-Number-of-Refueling-Stops
1057.Campus-Bikeshttps://github.com/wisdompeak/LeetCode/tree/master/Priority_Queue/1057.Campus-Bikes
1167.Minimum-Cost-to-Connect-Stickshttps://github.com/wisdompeak/LeetCode/tree/master/Priority_Queue/1167.Minimum-Cost-to-Connect-Sticks
1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rowshttps://github.com/wisdompeak/LeetCode/tree/master/Priority_Queue/1439.Find-the-Kth-Smallest-Sum-of-a-Matrix-With-Sorted-Rows
1642.Furthest-Building-You-Can-Reachhttps://github.com/wisdompeak/LeetCode/tree/master/Priority_Queue/1642.Furthest-Building-You-Can-Reach
1705.Maximum-Number-of-Eaten-Appleshttps://github.com/wisdompeak/LeetCode/tree/master/Priority_Queue/1705.Maximum-Number-of-Eaten-Apples
1792.Maximum-Average-Pass-Ratiohttps://github.com/wisdompeak/LeetCode/tree/master/Priority_Queue/1792.Maximum-Average-Pass-Ratio
1801.Number-of-Orders-in-the-Backloghttps://github.com/wisdompeak/LeetCode/tree/master/Priority_Queue/1801.Number-of-Orders-in-the-Backlog
1882.Process-Tasks-Using-Servershttps://github.com/wisdompeak/LeetCode/tree/master/Priority_Queue/1882.Process-Tasks-Using-Servers
1942.The-Number-of-the-Smallest-Unoccupied-Chairhttps://github.com/wisdompeak/LeetCode/tree/master/Priority_Queue/1942.The-Number-of-the-Smallest-Unoccupied-Chair
2102.Sequentially-Ordinal-Rank-Trackerhttps://github.com/wisdompeak/LeetCode/tree/master/Heap/2102.Sequentially-Ordinal-Rank-Tracker
502.IPOhttps://github.com/wisdompeak/LeetCode/blob/master/Priority_Queue/502.IPO/
630.Course-Schedule-IIIhttps://github.com/wisdompeak/LeetCode/tree/master/Priority_Queue/630.Course-Schedule-III
857.Minimum-Cost-to-Hire-K-Workershttps://github.com/wisdompeak/LeetCode/tree/master/Priority_Queue/857.Minimum-Cost-to-Hire-K-Workers
1353.Maximum-Number-of-Events-That-Can-Be-Attendedhttps://github.com/wisdompeak/LeetCode/tree/master/Priority_Queue/1353.Maximum-Number-of-Events-That-Can-Be-Attended
1383.Maximum-Performance-of-a-Teamhttps://github.com/wisdompeak/LeetCode/tree/master/Priority_Queue/1383.Maximum-Performance-of-a-Team
1834.Single-Threaded-CPUhttps://github.com/wisdompeak/LeetCode/tree/master/Priority_Queue/1834.Single-Threaded-CPU
1851.Minimum-Interval-to-Include-Each-Queryhttps://github.com/wisdompeak/LeetCode/tree/master/Priority_Queue/1851.Minimum-Interval-to-Include-Each-Query
767.Reorganize-Stringhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/767.Reorganize-String
1054.Distant-Barcodeshttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1054.Distant-Barcodes
358.Rearrange-String-k-Distance-Aparthttps://github.com/wisdompeak/LeetCode/tree/master/Priority_Queue/358.Rearrange-String-k-Distance-Apart
621.Task-Schedulerhttps://github.com/wisdompeak/LeetCode/tree/master/Priority_Queue/621.Task-Scheduler
984.String-Without-AAA-or-BBBhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/984.String-Without-AAA-or-BBB
1405.Longest-Happy-Stringhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1405.Longest-Happy-String
1953.Maximum-Number-of-Weeks-for-Which-You-Can-Workhttps://github.com/wisdompeak/LeetCode/tree/master/Priority_Queue/1953.Maximum-Number-of-Weeks-for-Which-You-Can-Work
DFShttps://github.com/wisdompeak/LeetCode/tree/master/DFS
https://patch-diff.githubusercontent.com/Nishant763/LeetCode#dfs
037.Sudoku-Solverhttps://github.com/wisdompeak/LeetCode/tree/master/DFS/037.Sudoku-Solver
040.Combination-Sum-IIhttps://github.com/wisdompeak/LeetCode/tree/master/DFS/040.Combination-Sum-II
051.N-Queenshttps://github.com/wisdompeak/LeetCode/tree/master/DFS/051.N-Queens
131.Palindrome-Partitioninghttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/131.Palindrome-Partitioning
291.Word-Pattern-IIhttps://github.com/wisdompeak/LeetCode/tree/master/DFS/291.Word-Pattern-II
417.Pacific-Atlantic-Water-Flowhttps://github.com/wisdompeak/LeetCode/tree/master/DFS/417.Pacific-Atlantic-Water-Flow
200.Number-of-Islandshttps://github.com/wisdompeak/LeetCode/tree/master/DFS/200.Number-of-Islands
282.Expression-Add-Operatorshttps://github.com/wisdompeak/LeetCode/tree/master/DFS/282.Expression-Add-Operators
312.Burst-Balloonshttps://github.com/wisdompeak/LeetCode/tree/master/DFS/312.Burst-Balloons
351.Android-Unlock-Patternshttps://github.com/wisdompeak/LeetCode/tree/master/DFS/351.Android-Unlock-Patterns
399.Evaluate-Divisionhttps://github.com/wisdompeak/LeetCode/tree/master/DFS/399.Evaluate-Division
488.Zuma-Gamehttps://github.com/wisdompeak/LeetCode/tree/master/DFS/488.Zuma-Game
425.Word-Squareshttps://github.com/wisdompeak/LeetCode/tree/master/DFS/425.Word-Squares
959.Regions-Cut-By-Slasheshttps://github.com/wisdompeak/LeetCode/tree/master/DFS/959.Regions-Cut-By-Slashes
1306.Jump-Game-IIIhttps://github.com/wisdompeak/LeetCode/tree/master/DFS/1306.Jump-Game-III
1718.Construct-the-Lexicographically-Largest-Valid-Sequencehttps://github.com/wisdompeak/LeetCode/tree/master/DFS/1718.Construct-the-Lexicographically-Largest-Valid-Sequence
1723.Find-Minimum-Time-to-Finish-All-Jobshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1723.Find-Minimum-Time-to-Finish-All-Jobs
1766.Tree-of-Coprimeshttps://github.com/wisdompeak/LeetCode/tree/master/DFS/1766.Tree-of-Coprimes
1778.Shortest-Path-in-a-Hidden-Gridhttps://github.com/wisdompeak/LeetCode/tree/master/DFS/1778.Shortest-Path-in-a-Hidden-Grid
2014.Longest-Subsequence-Repeated-k-Timeshttps://github.com/wisdompeak/LeetCode/tree/master/DFS/2014.Longest-Subsequence-Repeated-k-Times
2056.Number-of-Valid-Move-Combinations-On-Chessboardhttps://github.com/wisdompeak/LeetCode/tree/master/DFS/2056.Number-of-Valid-Move-Combinations-On-Chessboard
2065.Maximum-Path-Quality-of-a-Graphhttps://github.com/wisdompeak/LeetCode/tree/master/DFS/2065.Maximum-Path-Quality-of-a-Graph
090.Subsets-IIhttps://github.com/wisdompeak/LeetCode/tree/master/DFS/090.Subsets-II
301.Remove-Invalid-Parentheseshttps://github.com/wisdompeak/LeetCode/tree/master/DFS/301.Remove-Invalid-Parentheses
473.Matchsticks-to-Squarehttps://github.com/wisdompeak/LeetCode/tree/master/DFS/473.Matchsticks-to-Square
491.Increasing-Subsequenceshttps://github.com/wisdompeak/LeetCode/tree/master/DFS/491.Increasing-Subsequences
698.Partition-to-K-Equal-Sum-Subsetshttps://github.com/wisdompeak/LeetCode/tree/master/DFS/698.Partition-to-K-Equal-Sum-Subsets
996.Number-of-Squareful-Arrayshttps://github.com/wisdompeak/LeetCode/tree/master/DFS/996.Number-of-Squareful-Arrays
1307.Verbal-Arithmetic-Puzzlehttps://github.com/wisdompeak/LeetCode/tree/master/DFS/1307.Verbal-Arithmetic-Puzzle
1593.Split-a-String-Into-the-Max-Number-of-Unique-Substringshttps://github.com/wisdompeak/LeetCode/tree/master/DFS/1593.Split-a-String-Into-the-Max-Number-of-Unique-Substrings
1681.Minimum-Incompatibilityhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1681.Minimum-Incompatibility
329.Longest-Increasing-Path-in-a-Matrixhttps://github.com/wisdompeak/LeetCode/tree/master/DFS/329.Longest-Increasing-Path-in-a-Matrix
638.Shopping-Offershttps://github.com/wisdompeak/LeetCode/tree/master/DFS/638.Shopping-Offers
403.Frog-Jumphttps://github.com/wisdompeak/LeetCode/tree/master/DFS/403.Frog-Jump
489.Robot-Room-Cleanerhttps://github.com/wisdompeak/LeetCode/blob/master/DFS/489.Robot-Room-Cleaner
546.Remove-Boxeshttps://github.com/wisdompeak/LeetCode/tree/master/DFS/546.Remove-Boxes
1340.Jump-Game-Vhttps://github.com/wisdompeak/LeetCode/tree/master/DFS/1340.Jump-Game-V
1815.Maximum-Number-of-Groups-Getting-Fresh-Donutshttps://github.com/wisdompeak/LeetCode/tree/master/DFS/1815.Maximum-Number-of-Groups-Getting-Fresh-Donuts
BFShttps://github.com/wisdompeak/LeetCode/tree/master/BFS
https://patch-diff.githubusercontent.com/Nishant763/LeetCode#bfs
127.Word-Ladderhttps://github.com/wisdompeak/LeetCode/tree/master/BFS/127.Word-Ladder
126.Word-Ladder-IIhttps://github.com/wisdompeak/LeetCode/tree/master/BFS/126.Word-Ladder-II
130.Surrounded-Regionshttps://github.com/wisdompeak/LeetCode/tree/master/Union_Find/130.Surrounded-Regions
200.Number-of-Islandshttps://github.com/wisdompeak/LeetCode/tree/master/DFS/200.Number-of-Islands
529.Minesweeperhttps://github.com/wisdompeak/LeetCode/tree/master/BFS/529.Minesweeper
637.Average-of-Levels-in-Binary-Treehttps://github.com/wisdompeak/LeetCode/tree/master/BFS/637.Average-of-Levels-in-Binary-Tree
675.Cut-Off-Trees-for-Golf-Eventhttps://github.com/wisdompeak/LeetCode/tree/master/BFS/675.Cut-Off-Trees-for-Golf-Event
785.Is-Graph-Bipartitehttps://github.com/wisdompeak/LeetCode/tree/master/BFS/785.Is-Graph-Bipartite
815.Bus-Routeshttps://github.com/wisdompeak/LeetCode/tree/master/BFS/815.Bus-Routes
838.Push-Dominoeshttps://github.com/wisdompeak/LeetCode/tree/master/BFS/838.Push-Dominoes
928.Minimize-Malware-Spread-IIhttps://github.com/wisdompeak/LeetCode/tree/master/BFS/928.Minimize-Malware-Spread-II
1036.Escape-a-Large-Mazehttps://github.com/wisdompeak/LeetCode/tree/master/BFS/1036.Escape-a-Large-Maze
1245.Tree-Diameterhttps://github.com/wisdompeak/LeetCode/tree/master/BFS/1245.Tree-Diameter
1263.Minimum-Moves-to-Move-a-Box-to-Their-Target-Locationhttps://github.com/wisdompeak/LeetCode/tree/master/BFS/1263.Minimum-Moves-to-Move-a-Box-to-Their-Target-Location
1298.Maximum-Candies-You-Can-Get-from-Boxeshttps://github.com/wisdompeak/LeetCode/tree/master/BFS/1298.Maximum-Candies-You-Can-Get-from-Boxes
1311.Get-Watched-Videos-by-Your-Friendshttps://github.com/wisdompeak/LeetCode/tree/master/BFS/1311.Get-Watched-Videos-by-Your-Friends
1345.Jump-Game-IVhttps://github.com/wisdompeak/LeetCode/tree/master/BFS/1345.Jump-Game-IV
1559.Detect-Cycles-in-2D-Gridhttps://github.com/wisdompeak/LeetCode/tree/master/BFS/1559.Detect-Cycles-in-2D-Grid
1568.Minimum-Number-of-Days-to-Disconnect-Islandhttps://github.com/wisdompeak/LeetCode/tree/master/BFS/1568.Minimum-Number-of-Days-to-Disconnect-Island
1617.Count-Subtrees-With-Max-Distance-Between-Citieshttps://github.com/wisdompeak/LeetCode/tree/master/BFS/1617.Count-Subtrees-With-Max-Distance-Between-Cities
1654.Minimum-Jumps-to-Reach-Homehttps://github.com/wisdompeak/LeetCode/tree/master/BFS/1654.Minimum-Jumps-to-Reach-Home
1905.Count-Sub-Islandshttps://github.com/wisdompeak/LeetCode/tree/master/BFS/1905.Count-Sub-Islands
2045.Second-Minimum-Time-to-Reach-Destinationhttps://github.com/wisdompeak/LeetCode/tree/master/BFS/2045.Second-Minimum-Time-to-Reach-Destination
2101.Detonate-the-Maximum-Bombshttps://github.com/wisdompeak/LeetCode/tree/master/BFS/2101.Detonate-the-Maximum-Bombs
847.Shortest-Path-Visiting-All-Nodeshttps://github.com/wisdompeak/LeetCode/tree/master/BFS/847.Shortest-Path-Visiting-All-Nodes
864.Shortest-Path-to-Get-All-Keyshttps://github.com/wisdompeak/LeetCode/tree/master/BFS/864.Shortest-Path-to-Get-All-Keys
913.Cat-and-Mousehttps://github.com/wisdompeak/LeetCode/tree/master/BFS/913.Cat-and-Mouse
1728.Cat-and-Mouse-IIhttps://github.com/wisdompeak/LeetCode/tree/master/BFS/1728.Cat-and-Mouse-II
1293.Shortest-Path-in-a-Grid-with-Obstacles-Eliminationhttps://github.com/wisdompeak/LeetCode/tree/master/BFS/1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination
1928.Minimum-Cost-to-Reach-Destination-in-Timehttps://github.com/wisdompeak/LeetCode/tree/master/BFS/1928.Minimum-Cost-to-Reach-Destination-in-Time
207.Course-Schedulehttps://github.com/wisdompeak/LeetCode/tree/master/BFS/207.Course-Schedule
210.Course-Schedule-IIhttps://github.com/wisdompeak/LeetCode/tree/master/BFS/210.Course-Schedule-II
269.Alien-Dictionaryhttps://github.com/wisdompeak/LeetCode/tree/master/BFS/269.Alien-Dictionary
310.Minimum-Height-Treeshttps://github.com/wisdompeak/LeetCode/tree/master/BFS/310.Minimum-Height-Trees
444.Sequence-Reconstructionhttps://github.com/wisdompeak/LeetCode/tree/master/BFS/444.Sequence-Reconstruction
802.Find-Eventual-Safe-Stateshttps://github.com/wisdompeak/LeetCode/tree/master/BFS/802.Find-Eventual-Safe-States
1136.Parallel-Courseshttps://github.com/wisdompeak/LeetCode/tree/master/BFS/1136.Parallel-Courses
1203.Sort-Items-by-Groups-Respecting-Dependencieshttps://github.com/wisdompeak/LeetCode/tree/master/BFS/1203.Sort-Items-by-Groups-Respecting-Dependencies
1462.Course-Schedule-IVhttps://github.com/wisdompeak/LeetCode/tree/master/BFS/1462.Course-Schedule-IV
1591.Strange-Printer-IIhttps://github.com/wisdompeak/LeetCode/tree/master/BFS/1591.Strange-Printer-II
1857.Largest-Color-Value-in-a-Directed-Graphhttps://github.com/wisdompeak/LeetCode/tree/master/BFS/1857.Largest-Color-Value-in-a-Directed-Graph
2050.Parallel-Courses-IIIhttps://github.com/wisdompeak/LeetCode/tree/master/BFS/2050.Parallel-Courses-III
2115.Find-All-Possible-Recipes-from-Given-Supplieshttps://github.com/wisdompeak/LeetCode/tree/master/BFS/2115.Find-All-Possible-Recipes-from-Given-Supplies
2127.Maximum-Employees-to-Be-Invited-to-a-Meetinghttps://github.com/wisdompeak/LeetCode/tree/master/BFS/2127.Maximum-Employees-to-Be-Invited-to-a-Meeting
743.Network-Delay-Timehttps://github.com/wisdompeak/LeetCode/tree/master/BFS/743.Network-Delay-Time
407.Trapping-Rain-Water-IIhttps://github.com/wisdompeak/LeetCode/tree/master/BFS/407.Trapping-Rain-Water-II
778.Swim-in-Rising-Waterhttps://github.com/wisdompeak/LeetCode/tree/master/BFS/778.Swim-in-Rising-Water
505.The-Maze-IIhttps://github.com/wisdompeak/LeetCode/tree/master/BFS/505.The-Maze-II
787.Cheapest-Flights-Within-K-Stopshttps://github.com/wisdompeak/LeetCode/tree/master/Graph/787.Cheapest-Flights-Within-K-Stops
882.Reachable-Nodes-In-Subdivided-Graphhttps://github.com/wisdompeak/LeetCode/tree/master/BFS/882.Reachable-Nodes-In-Subdivided-Graph
1368.Minimum-Cost-to-Make-at-Least-One-Valid-Path-in-a-Gridhttps://github.com/wisdompeak/LeetCode/tree/master/BFS/1368.Minimum-Cost-to-Make-at-Least-One-Valid-Path-in-a-Grid
1514.Path-with-Maximum-Probabilityhttps://github.com/wisdompeak/LeetCode/tree/master/Graph/1514.Path-with-Maximum-Probability
1786.Number-of-Restricted-Paths-From-First-to-Last-Nodehttps://github.com/wisdompeak/LeetCode/tree/master/BFS/1786.Number-of-Restricted-Paths-From-First-to-Last-Node
1810.Minimum-Path-Cost-in-a-Hidden-Gridhttps://github.com/wisdompeak/LeetCode/tree/master/BFS/1810.Minimum-Path-Cost-in-a-Hidden-Grid
1976.Number-of-Ways-to-Arrive-at-Destinationhttps://github.com/wisdompeak/LeetCode/tree/master/BFS/1976.Number-of-Ways-to-Arrive-at-Destination
2093.Minimum-Cost-to-Reach-City-With-Discountshttps://github.com/wisdompeak/LeetCode/tree/master/BFS/2093.Minimum-Cost-to-Reach-City-With-Discounts
1066.Campus-Bikes-IIhttps://github.com/wisdompeak/LeetCode/tree/master/BFS/1066.Campus-Bikes-II
1879.Minimum-XOR-Sum-of-Two-Arrayshttps://github.com/wisdompeak/LeetCode/tree/master/BFS/1879.Minimum-XOR-Sum-of-Two-Arrays
1947.Maximum-Compatibility-Score-Sumhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1947.Maximum-Compatibility-Score-Sum
Triehttps://github.com/wisdompeak/LeetCode/tree/master/Trie
https://patch-diff.githubusercontent.com/Nishant763/LeetCode#trie
208.Implement-Trie--Prefix-Treehttps://github.com/wisdompeak/LeetCode/tree/master/Trie/208.Implement-Trie--Prefix-Tree
1804.Implement-Trie-II-(Prefix-Tree)https://github.com/wisdompeak/LeetCode/tree/master/Trie/1804.Implement-Trie-II-(Prefix-Tree)
211.Add-and-Search-Wordhttps://github.com/wisdompeak/LeetCode/tree/master/Trie/211.Add-and-Search-Word
472.Concatenated-Wordshttps://github.com/wisdompeak/LeetCode/tree/master/Trie/472.Concatenated-Words
648.Replace-Wordshttps://github.com/wisdompeak/LeetCode/tree/master/Trie/648.Replace-Words
588.Design-In-Memory-File-Systemhttps://github.com/wisdompeak/LeetCode/tree/master/Trie/588.Design-In-Memory-File-System
677.Map-Sum-Pairshttps://github.com/wisdompeak/LeetCode/tree/master/Trie/677.Map-Sum-Pairs
139.Word-Breakhttps://github.com/wisdompeak/LeetCode/tree/master/Trie/139.Word-Break
140.Word-Break-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Trie/140.Word-Break-II
212.Word-Search-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Trie/212.Word-Search-II
745.Prefix-and-Suffix-Searchhttps://github.com/wisdompeak/LeetCode/tree/master/Trie/745.Prefix-and-Suffix-Search
1268.Search-Suggestions-Systemhttps://github.com/wisdompeak/LeetCode/tree/master/Trie/1268.Search-Suggestions-System
1858.Longest-Word-With-All-Prefixeshttps://github.com/wisdompeak/LeetCode/tree/master/Trie/1858.Longest-Word-With-All-Prefixes
421.Maximum-XOR-of-Two-Numbers-in-an-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Trie/421.Maximum-XOR-of-Two-Numbers-in-an-Array
1707.Maximum-XOR-With-an-Element-From-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Trie/1707.Maximum-XOR-With-an-Element-From-Array
1803.Count-Pairs-With-XOR-in-a-Rangehttps://github.com/wisdompeak/LeetCode/tree/master/Trie/1803.Count-Pairs-With-XOR-in-a-Range
1938.Maximum-Genetic-Difference-Queryhttps://github.com/wisdompeak/LeetCode/tree/master/Trie/1938.Maximum-Genetic-Difference-Query
Linked Listhttps://github.com/wisdompeak/LeetCode/tree/master/Linked_List
https://patch-diff.githubusercontent.com/Nishant763/LeetCode#linked-list
061.Rotate-Listhttps://github.com/wisdompeak/LeetCode/tree/master/Linked_List/061.Rotate-List
086.Partition-Listhttps://github.com/wisdompeak/LeetCode/tree/master/Linked_List/086.Partition-List
142.Linked-List-Cycle-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Linked_List/142.Linked-List-Cycle-II
109.Convert-Sorted-List-to-Binary-Search-Treehttps://github.com/wisdompeak/LeetCode/tree/master/Linked_List/109.Convert-Sorted-List-to-Binary-Search-Tree
369.Plus-One-Linked-Listhttps://github.com/wisdompeak/LeetCode/tree/master/Linked_List/369.Plus-One-Linked-List
430.Flatten-a-Multilevel-Doubly-Linked-Listhttps://github.com/wisdompeak/LeetCode/tree/master/Linked_List/430.Flatten-a-Multilevel-Doubly-Linked-List
457.Circular-Array-Loophttps://github.com/wisdompeak/LeetCode/tree/master/Linked_List/457.Circular-Array-Loop
708.Insert-into-a-Cyclic-Sorted-Listhttps://github.com/wisdompeak/LeetCode/tree/master/Linked_List/708.Insert-into-a-Cyclic-Sorted-List
1474.Delete-N-Nodes-After-M-Nodes-of-a-Linked-Listhttps://github.com/wisdompeak/LeetCode/tree/master/Linked_List/1474.Delete-N-Nodes-After-M-Nodes-of-a-Linked-List
1670.Design-Front-Middle-Back-Queuehttps://github.com/wisdompeak/LeetCode/tree/master/Linked_List/1670.Design-Front-Middle-Back-Queue
1756.Design-Most-Recently-Used-Queuehttps://github.com/wisdompeak/LeetCode/tree/master/Linked_List/1756.Design-Most-Recently-Used-Queue
206.Reverse-Linked-Listhttps://github.com/wisdompeak/LeetCode/tree/master/Linked_List/206.Reverse-Linked-List
092.Reverse-Linked-List-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Linked_List/092.Reverse-Linked-List-II
025.Reverse-Nodes-in-k-Grouphttps://github.com/wisdompeak/LeetCode/tree/master/Linked_List/025.Reverse-Nodes-in-k-Group
2074.Reverse-Nodes-in-Even-Length-Groupshttps://github.com/wisdompeak/LeetCode/tree/master/Linked_List/2074.Reverse-Nodes-in-Even-Length-Groups
143.Reorder-Listhttps://github.com/wisdompeak/LeetCode/tree/master/Linked_List/143.Reorder-List
2046.Sort-Linked-List-Already-Sorted-Using-Absolute-Valueshttps://github.com/wisdompeak/LeetCode/tree/master/Linked_List/2046.Sort-Linked-List-Already-Sorted-Using-Absolute-Values
Dynamic Programminghttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming
https://patch-diff.githubusercontent.com/Nishant763/LeetCode#dynamic-programming
264.Ugly-Number-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/264.Ugly-Number-II
313.Super-Ugly-Numberhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/313.Super-Ugly-Number
091.Decode-Wayshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/091.Decode-Ways
639.Decode-Ways-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/639.Decode-Ways-II
634.Find-the-Derangement-of-An-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/634.Find-the-Derangement-of-An-Array
221.Maximal-Squarehttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/221.Maximal-Square
1277.Count-Square-Submatrices-with-All-Oneshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1277.Count-Square-Submatrices-with-All-Ones
600.Non-negative-Integers-without-Consecutive-Oneshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/600.Non-negative-Integers-without-Consecutive-Ones
656.Coin-Pathhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/656.Coin-Path
053.Maximum-Subarrayhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/053.Maximum-Subarray
152.Maximum-Product-Subarrayhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/152.Maximum-Product-Subarray
818.Race-Carhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/818.Race-Car
377.Combination-Sum-IVhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/377.Combination-Sum-IV
837.New-21-Gamehttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/837.New-21-Game
887.Super-Egg-Drophttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/887.Super-Egg-Drop
1884.Egg-Drop-With-2-Eggs-and-N-Floorshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1884.Egg-Drop-With-2-Eggs-and-N-Floors
920.Number-of-Music-Playlistshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/920.Number-of-Music-Playlists
940.Distinct-Subsequences-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/940.Distinct-Subsequences-II
1987.Number-of-Unique-Good-Subsequenceshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1987.Number-of-Unique-Good-Subsequences
446.Arithmetic-Slices-II-Subsequencehttps://github.com/wisdompeak/LeetCode/tree/master/Hash/446.Arithmetic-Slices-II-Subsequence
1027.Longest-Arithmetic-Sequencehttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1027.Longest-Arithmetic-Sequence
1269.Number-of-Ways-to-Stay-in-the-Same-Place-After-Some-Stepshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1269.Number-of-Ways-to-Stay-in-the-Same-Place-After-Some-Steps
1316.Distinct-Echo-Substringshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1316.Distinct-Echo-Substrings
1420.Build-Array-Where-You-Can-Find-The-Maximum-Exactly-K-Comparisonshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1420.Build-Array-Where-You-Can-Find-The-Maximum-Exactly-K-Comparisons
1531.String-Compression-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1531.String-Compression-II
1575.Count-All-Possible-Routeshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1575.Count-All-Possible-Routes
1621.Number-of-Sets-of-K-Non-Overlapping-Line-Segmentshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1621.Number-of-Sets-of-K-Non-Overlapping-Line-Segments
1639.Number-of-Ways-to-Form-a-Target-String-Given-a-Dictionaryhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1639.Number-of-Ways-to-Form-a-Target-String-Given-a-Dictionary
1692.Count-Ways-to-Distribute-Candieshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1692.Count-Ways-to-Distribute-Candies
1787.Make-the-XOR-of-All-Segments-Equal-to-Zerohttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1787.Make-the-XOR-of-All-Segments-Equal-to-Zero
1872.Stone-Game-VIIIhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1872.Stone-Game-VIII
1900.The-Earliest-and-Latest-Rounds-Where-Players-Competehttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1900.The-Earliest-and-Latest-Rounds-Where-Players-Compete
1937.Maximum-Number-of-Points-with-Costhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1937.Maximum-Number-of-Points-with-Cost
1955.Count-Number-of-Special-Subsequenceshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1955.Count-Number-of-Special-Subsequences
2088.Count-Fertile-Pyramids-in-a-Landhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/2088.Count-Fertile-Pyramids-in-a-Land
2140.Solving-Questions-With-Brainpowerhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/2140.Solving-Questions-With-Brainpower
198.House-Robberhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/198.House-Robber
213.House-Robber-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/213.House-Robber-II
1388.Pizza-With-3n-Sliceshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1388.Pizza-With-3n-Slices
276.Paint-Fencehttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/276.Paint-Fence
265.Paint-House-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/265.Paint-House-II
1473.Paint-House-IIIhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1473.Paint-House-III
376.Wiggle-Subsequencehttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/376.Wiggle-Subsequence
123.Best-Time-to-Buy-and-Sell-Stock-IIIhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/123.Best-Time-to-Buy-and-Sell-Stock-III
188.Best-Time-to-Buy-and-Sell-Stock-IVhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/188.Best-Time-to-Buy-and-Sell-Stock-IV
309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldownhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown
714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Feehttps://github.com/wisdompeak/LeetCode/blob/master/Dynamic_Programming/714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee
514.Freedom-Trailhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/514.Freedom-Trail
740.Delete-and-Earnhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/740.Delete-and-Earn
552.Student-Attendance-Record-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/552.Student-Attendance-Record-II
801.Minimum-Swaps-To-Make-Sequences-Increasinghttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/801.Minimum-Swaps-To-Make-Sequences-Increasing
1223.Dice-Roll-Simulationhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1223.Dice-Roll-Simulation
1262.Greatest-Sum-Divisible-by-Threehttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1262.Greatest-Sum-Divisible-by-Three
1363.Largest-Multiple-of-Threehttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1363.Largest-Multiple-of-Three
1419.Minimum-Number-of-Frogs-Croakinghttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1419.Minimum-Number-of-Frogs-Croaking
1548.The-Most-Similar-Path-in-a-Graphhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1548.The-Most-Similar-Path-in-a-Graph
1746.Maximum-Subarray-Sum-After-One-Operationhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1746.Maximum-Subarray-Sum-After-One-Operation
1824.Minimum-Sideway-Jumpshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1824.Minimum-Sideway-Jumps
1839.Longest-Substring-Of-All-Vowels-in-Orderhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1839.Longest-Substring-Of-All-Vowels-in-Order
1883.Minimum-Skips-to-Arrive-at-Meeting-On-Timehttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1883.Minimum-Skips-to-Arrive-at-Meeting-On-Time
2036.Maximum-Alternating-Subarray-Sumhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/2036.Maximum-Alternating-Subarray-Sum
2143.Choose-Numbers-From-Two-Arrays-in-Rangehttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/2143.Choose-Numbers-From-Two-Arrays-in-Range
368.Largest-Divisible-Subsethttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/368.Largest-Divisible-Subset
300.Longest-Increasing-Subsequencehttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/300.Longest-Increasing-Subsequence
673.Number-of-Longest-Increasing-Subsequencehttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/673.Number-of-Longest-Increasing-Subsequence
960.Delete-Columns-to-Make-Sorted-IIIhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/960.Delete-Columns-to-Make-Sorted-III
983.Minimum-Cost-For-Ticketshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/983.Minimum-Cost-For-Tickets
1043.Partition-Array-for-Maximum-Sumhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1043.Partition-Array-for-Maximum-Sum
1105.Filling-Bookcase-Shelveshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1105.Filling-Bookcase-Shelves
1959.minimum-total-space-wasted-with-k-resizing-operationshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1959.minimum-total-space-wasted-with-k-resizing-operations
2052.Minimum-Cost-to-Separate-Sentence-Into-Rowshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/2052.Minimum-Cost-to-Separate-Sentence-Into-Rows
1416.Restore-The-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1416.Restore-The-Array
1546.Maximum-Number-of-Non-Overlapping-Subarrays-With-Sum-Equals-Targethttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1546.Maximum-Number-of-Non-Overlapping-Subarrays-With-Sum-Equals-Target
1626.Best-Team-With-No-Conflictshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1626.Best-Team-With-No-Conflicts
1691.Maximum-Height-by-Stacking-Cuboidshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1691.Maximum-Height-by-Stacking-Cuboids
2188.Minimum-Time-to-Finish-the-Racehttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/2188.Minimum-Time-to-Finish-the-Race
120.Trianglehttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/120.Triangle
174.Dungeon-Gamehttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/174.Dungeon-Game
741.Cherry-Pickuphttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/741.Cherry-Pickup
1463.Cherry-Pickup-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1463.Cherry-Pickup-II
576.Out-of-Boundary-Pathshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/576.Out-of-Boundary-Paths
931.Minimum-Falling-Path-Sumhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/931.Minimum-Falling-Path-Sum
1289.Minimum-Falling-Path-Sum-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1289.Minimum-Falling-Path-Sum-II
1301.Number-of-Paths-with-Max-Scorehttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1301.Number-of-Paths-with-Max-Score
1594.Maximum-Non-Negative-Product-in-a-Matrixhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1594.Maximum-Non-Negative-Product-in-a-Matrix
322.Coin-Changehttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/322.Coin-Change
416.Partition-Equal-Subset-Sumhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/416.Partition-Equal-Subset-Sum
518.Coin-Change-2https://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/518.Coin-Change-2
474.Ones-and-Zeroeshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/474.Ones-and-Zeroes
494.Target-Sumhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/494.Target-Sum
805.Split-Array-With-Same-Averagehttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/805.Split-Array-With-Same-Average
879.Profitable-Schemeshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/879.Profitable-Schemes
956.Tallest-Billboardhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/956.Tallest-Billboard
1049.Last-Stone-Weight-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1049.Last-Stone-Weight-II
1449.Form-Largest-Integer-With-Digits-That-Add-up-to-Targethttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1449.Form-Largest-Integer-With-Digits-That-Add-up-to-Target
1981.Minimize-the-Difference-Between-Target-and-Chosen-Elementshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1981.Minimize-the-Difference-Between-Target-and-Chosen-Elements
650.2-Keys-Keyboardhttps://github.com/wisdompeak/LeetCode/blob/master/Dynamic_Programming/650.2-Keys-Keyboard
651.4-Keys-Keyboardhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/651.4-Keys-Keyboard
935.Knight-Dialerhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/935.Knight-Dialer
1320.Minimum-Distance-to-Type-a-Word-Using-Two-Fingershttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1320.Minimum-Distance-to-Type-a-Word-Using-Two-Fingers
487.Max-Consecutive-Ones-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/487.Max-Consecutive-Ones-II
1186.Maximum-Subarray-Sum-with-One-Deletionhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1186.Maximum-Subarray-Sum-with-One-Deletion
1187.Make-Array-Strictly-Increasinghttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1187.Make-Array-Strictly-Increasing
1909.Remove-One-Element-to-Make-the-Array-Strictly-Increasinghttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1909.Remove-One-Element-to-Make-the-Array-Strictly-Increasing
132.Palindrome-Partitioning-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/132.Palindrome-Partitioning-II
410.Split-Array-Largest-Sumhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/410.Split-Array-Largest-Sum
813.Largest-Sum-of-Averageshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/813.Largest-Sum-of-Averages
1278.Palindrome-Partitioning-IIIhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1278.Palindrome-Partitioning-III
1335.Minimum-Difficulty-of-a-Job-Schedulehttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1335.Minimum-Difficulty-of-a-Job-Schedule
1478.Allocate-Mailboxeshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1478.Allocate-Mailboxes
1977.Number-of-Ways-to-Separate-Numbershttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1977.Number-of-Ways-to-Separate-Numbers
131.Palindrome-Partitioninghttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/131.Palindrome-Partitioning
312.Burst-Balloonshttps://github.com/wisdompeak/LeetCode/tree/master/DFS/312.Burst-Balloons
375.Guess-Number-Higher-or-Lower-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/375.Guess-Number-Higher-or-Lower-II
471.Encode-String-with-Shortest-Lengthhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/471.Encode-String-with-Shortest-Length
516.Longest-Palindromic-Subsequencehttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/516.Longest-Palindromic-Subsequence
546.Remove-Boxeshttps://github.com/wisdompeak/LeetCode/tree/master/DFS/546.Remove-Boxes
664.Strange-Printerhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/664.Strange-Printer
730.Count-Different-Palindromic-Subsequenceshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/730.Count-Different-Palindromic-Subsequences
1000.Minimum-Cost-to-Merge-Stoneshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1000.Minimum-Cost-to-Merge-Stones
1130.Minimum-Cost-Tree-From-Leaf-Valueshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1130.Minimum-Cost-Tree-From-Leaf-Values
1246.Palindrome-Removalhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1246.Palindrome-Removal
1039.Minimum-Score-Triangulation-of-Polygonhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1039.Minimum-Score-Triangulation-of-Polygon
1547.Minimum-Cost-to-Cut-a-Stickhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1547.Minimum-Cost-to-Cut-a-Stick
1682.Longest-Palindromic-Subsequence-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1682.Longest-Palindromic-Subsequence-II
1690.Stone-Game-VIIhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1690.Stone-Game-VII
1745.Palindrome-Partitioning-IVhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1745.Palindrome-Partitioning-IV
1770.Maximum-Score-from-Performing-Multiplication-Operationshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1770.Maximum-Score-from-Performing-Multiplication-Operations
010.Regular-Expression-Matchinghttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/010.Regular-Expression-Matching
044.Wildcard-Matchinghttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/044.Wildcard-Matching
097.Interleaving-Stringhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/097.Interleaving-String
072.Edit-Distancehttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/072.Edit-Distance
115.Distinct-Subsequenceshttps://github.com/wisdompeak/LeetCode/blob/master/Dynamic_Programming/115.Distinct-Subsequences/
583.Delete-Operation-for-Two-Stringshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/583.Delete-Operation-for-Two-Strings
712.Minimum-ASCII-Delete-Sum-for-Two-Stringshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/712.Minimum-ASCII-Delete-Sum-for-Two-Strings
718.Maximum-Length-of-Repeated-Subarrayhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/718.Maximum-Length-of-Repeated-Subarray
727.Minimum-Window-Subsequencehttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/727.Minimum-Window-Subsequence
1035.Uncrossed-Lineshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1035.Uncrossed-Lines
1092.Shortest-Common-Supersequencehttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1092.Shortest-Common-Supersequence
1143.Longest-Common-Subsequencehttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1143.Longest-Common-Subsequence
1216.Valid-Palindrome-IIIhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1216.Valid-Palindrome-III
1312.Minimum-Insertion-Steps-to-Make-a-String-Palindromehttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1312.Minimum-Insertion-Steps-to-Make-a-String-Palindrome
1458.Max-Dot-Product-of-Two-Subsequenceshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1458.Max-Dot-Product-of-Two-Subsequences
1771.Maximize-Palindrome-Length-From-Subsequenceshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1771.Maximize-Palindrome-Length-From-Subsequences
465.Optimal-Account-Balancinghttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/465.Optimal-Account-Balancing
691.Stickers-to-Spell-Wordhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/691.Stickers-to-Spell-Word
943.Find-the-Shortest-Superstringhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/943.Find-the-Shortest-Superstring
1125.Smallest-Sufficient-Teamhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1125.Smallest-Sufficient-Team
1349.Maximum-Students-Taking-Examhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1349.Maximum-Students-Taking-Exam
1411.Number-of-Ways-to-Paint-N×3-Gridhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1411.Number-of-Ways-to-Paint-N%C3%973-Grid
1434.Number-of-Ways-to-Wear-Different-Hats-to-Each-Otherhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1434.Number-of-Ways-to-Wear-Different-Hats-to-Each-Other
1659.Maximize-Grid-Happinesshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1659.Maximize-Grid-Happiness
1681.Minimum-Incompatibilityhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1681.Minimum-Incompatibility
1723.Find-Minimum-Time-to-Finish-All-Jobshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1723.Find-Minimum-Time-to-Finish-All-Jobs
1799.Maximize-Score-After-N-Operationshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1799.Maximize-Score-After-N-Operations
1931.Painting-a-Grid-With-Three-Different-Colorshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1931.Painting-a-Grid-With-Three-Different-Colors
1994.The-Number-of-Good-Subsetshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1994.The-Number-of-Good-Subsets
2184.Number-of-Ways-to-Build-Sturdy-Brick-Wallhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/2184.Number-of-Ways-to-Build-Sturdy-Brick-Wall
1494.Parallel-Courses-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1494.Parallel-Courses-II
1655.Distribute-Repeating-Integershttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1655.Distribute-Repeating-Integers
1986.Minimum-Number-of-Work-Sessions-to-Finish-the-Taskshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1986.Minimum-Number-of-Work-Sessions-to-Finish-the-Tasks
2152.Minimum-Number-of-Lines-to-Cover-Pointshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/2152.Minimum-Number-of-Lines-to-Cover-Points
1066.Campus-Bikes-IIhttps://github.com/wisdompeak/LeetCode/tree/master/BFS/1066.Campus-Bikes-II
1595.Minimum-Cost-to-Connect-Two-Groups-of-Pointshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1595.Minimum-Cost-to-Connect-Two-Groups-of-Points
1879.Minimum-XOR-Sum-of-Two-Arrayshttps://github.com/wisdompeak/LeetCode/tree/master/BFS/1879.Minimum-XOR-Sum-of-Two-Arrays
1947.Maximum-Compatibility-Score-Sumhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1947.Maximum-Compatibility-Score-Sum
2172.Maximum-AND-Sum-of-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/2172.Maximum-AND-Sum-of-Array
096.Unique-Binary-Search-Treeshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/096.Unique-Binary-Search-Trees
1259.Handshakes-That-Don't-Crosshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1259.Handshakes-That-Don't-Cross
629.K-Inverse-Pairs-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/629.K-Inverse-Pairs-Array
903.Valid-Permutations-for-DI-Sequencehttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/903.Valid-Permutations-for-DI-Sequence
1866.Number-of-Ways-to-Rearrange-Sticks-With-K-Sticks-Visiblehttps://github.com/wisdompeak/LeetCode/tree/master/Math/1866.Number-of-Ways-to-Rearrange-Sticks-With-K-Sticks-Visible
2044.Count-Number-of-Maximum-Bitwise-OR-Subsetshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/2044.Count-Number-of-Maximum-Bitwise-OR-Subsets
Bit Manipulationhttps://github.com/wisdompeak/LeetCode/tree/master/Bit_Manipulation
https://patch-diff.githubusercontent.com/Nishant763/LeetCode#bit-manipulation
137.Single-Number-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Bit_Manipulation/137.Single-Number-II
260.Single-Number-IIIhttps://github.com/wisdompeak/LeetCode/tree/master/Bit_Manipulation/260.Single-Number-III
371.Sum-of-Two-Integershttps://github.com/wisdompeak/LeetCode/tree/master/Bit_Manipulation/371.Sum-of-Two-Integers
318.Maximum-Product-of-Word-Lengthshttps://github.com/wisdompeak/LeetCode/tree/master/Bit_Manipulation/318.Maximum-Product-of-Word-Lengths
957.Prison-Cells-After-N-Dayshttps://github.com/wisdompeak/LeetCode/tree/master/Bit_Manipulation/957.Prison-Cells-After-N-Days
1521.Find-a-Value-of-a-Mysterious-Function-Closest-to-Targethttps://github.com/wisdompeak/LeetCode/tree/master/Bit_Manipulation/1521.Find-a-Value-of-a-Mysterious-Function-Closest-to-Target
136.Single-Numberhttps://github.com/wisdompeak/LeetCode/tree/master/Bit_Manipulation/136.Single-Number
268.Missing-Numberhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/268.Missing-Number
1310.XOR-Queries-of-a-Subarrayhttps://github.com/wisdompeak/LeetCode/tree/master/Bit_Manipulation/1310.XOR-Queries-of-a-Subarray
1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XORhttps://github.com/wisdompeak/LeetCode/tree/master/Bit_Manipulation/1442.Count-Triplets-That-Can-Form-Two-Arrays-of-Equal-XOR
1506.Find-Root-of-N-Ary-Treehttps://github.com/wisdompeak/LeetCode/tree/master/Bit_Manipulation/1506.Find-Root-of-N-Ary-Tree
1734.Decode-XORed-Permutationhttps://github.com/wisdompeak/LeetCode/tree/master/Bit_Manipulation/1734.Decode-XORed-Permutation
1738.Find-Kth-Largest-XOR-Coordinate-Valuehttps://github.com/wisdompeak/LeetCode/tree/master/Bit_Manipulation/1738.Find-Kth-Largest-XOR-Coordinate-Value
1835.Find-XOR-Sum-of-All-Pairs-Bitwise-ANDhttps://github.com/wisdompeak/LeetCode/tree/master/Bit_Manipulation/1835.Find-XOR-Sum-of-All-Pairs-Bitwise-AND
1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Charactershttps://github.com/wisdompeak/LeetCode/tree/master/Bit_Manipulation/1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters
1284.Minimum-Number-of-Flips-to-Convert-Binary-Matrix-to-Zero-Matrixhttps://github.com/wisdompeak/LeetCode/tree/master/Bit_Manipulation/1284.Minimum-Number-of-Flips-to-Convert-Binary-Matrix-to-Zero-Matrix
1452.People-Whose-List-of-Favorite-Companies-Is-Not-a-Subset-of-Another-Listhttps://github.com/wisdompeak/LeetCode/tree/master/Bit_Manipulation/1452.People-Whose-List-of-Favorite-Companies-Is-Not-a-Subset-of-Another-List
1601.Maximum-Number-of-Achievable-Transfer-Requestshttps://github.com/wisdompeak/LeetCode/tree/master/Bit_Manipulation/1601.Maximum-Number-of-Achievable-Transfer-Requests
1774.Closest-Dessert-Costhttps://github.com/wisdompeak/LeetCode/tree/master/Bit_Manipulation/1774.Closest-Dessert-Cost
2002.Maximum-Product-of-the-Length-of-Two-Palindromic-Subsequenceshttps://github.com/wisdompeak/LeetCode/tree/master/Bit_Manipulation/2002.Maximum-Product-of-the-Length-of-Two-Palindromic-Subsequences
2151.Maximum-Good-People-Based-on-Statementshttps://github.com/wisdompeak/LeetCode/tree/master/Bit_Manipulation/2151.Maximum-Good-People-Based-on-Statements
1755.Closest-Subsequence-Sumhttps://github.com/wisdompeak/LeetCode/tree/master/Bit_Manipulation/1755.Closest-Subsequence-Sum
2035.Partition-Array-Into-Two-Arrays-to-Minimize-Sum-Differencehttps://github.com/wisdompeak/LeetCode/tree/master/Bit_Manipulation/2035.Partition-Array-Into-Two-Arrays-to-Minimize-Sum-Difference
Divide and Conquerhttps://github.com/wisdompeak/LeetCode/tree/master/Divide_Conquer
https://patch-diff.githubusercontent.com/Nishant763/LeetCode#divide-and-conquer
315.Count-of-Smaller-Numbers-After-Selfhttps://github.com/wisdompeak/LeetCode/tree/master/Divide_Conquer/315.Count-of-Smaller-Numbers-After-Self
327.Count-of-Range-Sumhttps://github.com/wisdompeak/LeetCode/tree/master/Divide_Conquer/327.Count-of-Range-Sum
493.Reverse-Pairshttps://github.com/wisdompeak/LeetCode/tree/master/Divide_Conquer/493.Reverse-Pairs
1649.Create-Sorted-Array-through-Instructionshttps://github.com/wisdompeak/LeetCode/tree/master/Divide_Conquer/1649.Create-Sorted-Array-through-Instructions
Stringhttps://github.com/wisdompeak/LeetCode/tree/master/String
https://patch-diff.githubusercontent.com/Nishant763/LeetCode#string
006.ZigZag-Conversionhttps://github.com/wisdompeak/LeetCode/tree/master/String/006.ZigZag-Conversion
068.Text-Justificationhttps://github.com/wisdompeak/LeetCode/tree/master/String/068.Text-Justification
336.Palindrome-Pairshttps://github.com/wisdompeak/LeetCode/tree/master/String/336.Palindrome-Pairs
388.Longest-Absolute-File-Pathhttps://github.com/wisdompeak/LeetCode/tree/master/String/388.Longest-Absolute-File-Path
418.Sentence-Screen-Fittinghttps://github.com/wisdompeak/LeetCode/tree/master/String/418.Sentence-Screen-Fitting
423.Reconstruct-Original-Digits-from-Englishhttps://github.com/wisdompeak/LeetCode/tree/master/Others/423.Reconstruct-Original-Digits-from-English
527.Word-Abbreviationhttps://github.com/wisdompeak/LeetCode/tree/master/String/527.Word-Abbreviation
556.Next Greater Element IIIhttps://github.com/wisdompeak/LeetCode/tree/master/String/556.Next-Greater-Element-III
467.Unique-Substrings-in-Wraparound-Stringhttps://github.com/wisdompeak/LeetCode/tree/master/String/467.Unique-Substrings-in-Wraparound-String
564.Find-the-Closest-Palindromehttps://github.com/wisdompeak/LeetCode/tree/master/String/564.Find-the-Closest-Palindrome
736.Parse-Lisp-Expressionhttps://github.com/wisdompeak/LeetCode/tree/master/String/736.Parse-Lisp-Expression
816.Ambiguous-Coordinateshttps://github.com/wisdompeak/LeetCode/tree/master/String/816.Ambiguous-Coordinates
844.Backspace-String-Comparehttps://github.com/wisdompeak/LeetCode/tree/master/String/844.Backspace-String-Compare
1616.Split-Two-Strings-to-Make-Palindromehttps://github.com/wisdompeak/LeetCode/tree/master/String/1616.Split-Two-Strings-to-Make-Palindrome
1754.Largest-Merge-Of-Two-Stringshttps://github.com/wisdompeak/LeetCode/tree/master/String/1754.Largest-Merge-Of-Two-Strings
1849.Splitting-a-String-Into-Descending-Consecutive-Valueshttps://github.com/wisdompeak/LeetCode/tree/master/String/1849.Splitting-a-String-Into-Descending-Consecutive-Values
320.Generalized-Abbreviationhttps://github.com/wisdompeak/LeetCode/tree/master/String/320.Generalized-Abbreviation
408.Valid-Word-Abbreviationhttps://github.com/wisdompeak/LeetCode/tree/master/String/408.Valid-Word-Abbreviation
411.Minimum-Unique-Word-Abbreviationhttps://github.com/wisdompeak/LeetCode/tree/master/String/411.Minimum-Unique-Word-Abbreviation
2060.Check-if-an-Original-String-Exists-Given-Two-Encoded-Stringshttps://github.com/wisdompeak/LeetCode/tree/master/Recursion/2060.Check-if-an-Original-String-Exists-Given-Two-Encoded-Strings
1044.Longest-Duplicate-Substringhttps://github.com/wisdompeak/LeetCode/tree/master/String/1044.Longest-Duplicate-Substring
1062.Longest-Repeating-Substringhttps://github.com/wisdompeak/LeetCode/tree/master/String/1062.Longest-Repeating-Substring
1554.Strings-Differ-by-One-Characterhttps://github.com/wisdompeak/LeetCode/tree/master/String/1554.Strings-Differ-by-One-Character
1698.Number-of-Distinct-Substrings-in-a-Stringhttps://github.com/wisdompeak/LeetCode/tree/master/String/1698.Number-of-Distinct-Substrings-in-a-String
1923.Longest-Common-Subpathhttps://github.com/wisdompeak/LeetCode/tree/master/String/1923.Longest-Common-Subpath
2156.Find-Substring-With-Given-Hash-Valuehttps://github.com/wisdompeak/LeetCode/tree/master/String/2156.Find-Substring-With-Given-Hash-Value
2168.Unique-Substrings-With-Equal-Digit-Frequencyhttps://github.com/wisdompeak/LeetCode/tree/master/String/2168.Unique-Substrings-With-Equal-Digit-Frequency
1392.Longest-Happy-Prefixhttps://github.com/wisdompeak/LeetCode/tree/master/String/1392.Longest-Happy-Prefix
028.Implement-strStrhttps://github.com/wisdompeak/LeetCode/tree/master/String/028.Implement-strStr
214.Shortest-Palindromehttps://github.com/wisdompeak/LeetCode/blob/master/String/214.Shortest-Palindrome
459.Repeated-Substring-Patternhttps://github.com/wisdompeak/LeetCode/tree/master/String/459.Repeated-Substring-Pattern
572.Subtree-of-Another-Treehttps://github.com/wisdompeak/LeetCode/tree/master/Tree/572.Subtree-of-Another-Tree
1367.Linked-List-in-Binary-Treehttps://github.com/wisdompeak/LeetCode/tree/master/String/1367.Linked-List-in-Binary-Tree
1764.Form-Array-by-Concatenating-Subarrays-of-Another-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/String/1764.Form-Array-by-Concatenating-Subarrays-of-Another-Array
005.Longest-Palindromic-Substringhttps://github.com/wisdompeak/LeetCode/tree/master/String/005.Longest-Palindromic-Substring
214.Shortest-Palindromehttps://github.com/wisdompeak/LeetCode/blob/master/String/214.Shortest-Palindrome
647.Palindromic-Substringshttps://github.com/wisdompeak/LeetCode/tree/master/String/647.Palindromic-Substrings
1960.Maximum-Product-of-the-Length-of-Two-Palindromic-Substringshttps://github.com/wisdompeak/LeetCode/tree/master/String/1960.Maximum-Product-of-the-Length-of-Two-Palindromic-Substrings
Union Findhttps://github.com/wisdompeak/LeetCode/tree/master/Union_Find
https://patch-diff.githubusercontent.com/Nishant763/LeetCode#union-find
547.Friend-Circleshttps://github.com/wisdompeak/LeetCode/tree/master/Union_Find/547.Friend-Circles
200.Number-of-Islandshttps://github.com/wisdompeak/LeetCode/tree/master/DFS/200.Number-of-Islands
305.Number-of-Islands-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Union_Find/305.Number-of-Islands-II
130.Surrounded-Regionshttps://github.com/wisdompeak/LeetCode/tree/master/Union_Find/130.Surrounded-Regions
128.Longest-Consecutive-Sequencehttps://github.com/wisdompeak/LeetCode/tree/master/Union_Find/128.Longest-Consecutive-Sequence
684.Redundant-Connectionhttps://github.com/wisdompeak/LeetCode/tree/master/Union_Find/684.Redundant-Connection
685.Redundant-Connection-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Union_Find/685.Redundant-Connection-II
721.Accounts-Mergehttps://github.com/wisdompeak/LeetCode/tree/master/Union_Find/721.Accounts-Merge
765.Couples-Holding-Handshttps://github.com/wisdompeak/LeetCode/tree/master/Union_Find/765.Couples-Holding-Hands
785.Is-Graph-Bipartitehttps://github.com/wisdompeak/LeetCode/tree/master/BFS/785.Is-Graph-Bipartite
924.Minimize-Malware-Spreadhttps://github.com/wisdompeak/LeetCode/tree/master/Union_Find/924.Minimize-Malware-Spread
947.Most-Stones-Removed-with-Same-Row-or-Columnhttps://github.com/wisdompeak/LeetCode/tree/master/Union_Find/947.Most-Stones-Removed-with-Same-Row-or-Column
959.Regions-Cut-By-Slasheshttps://github.com/wisdompeak/LeetCode/tree/master/DFS/959.Regions-Cut-By-Slashes
990.Satisfiability-of-Equality-Equationshttps://github.com/wisdompeak/LeetCode/tree/master/Union_Find/990.Satisfiability-of-Equality-Equations
1061.Lexicographically-Smallest-Equivalent-Stringhttps://github.com/wisdompeak/LeetCode/tree/master/Union_Find/1061.Lexicographically-Smallest-Equivalent-String
1101.The-Earliest-Moment-When-Everyone-Become-Friendshttps://github.com/wisdompeak/LeetCode/tree/master/Union_Find/1101.The-Earliest-Moment-When-Everyone-Become-Friends
1202.Smallest-String-With-Swapshttps://github.com/wisdompeak/LeetCode/tree/master/Union_Find/1202.Smallest-String-With-Swaps
1319.Number-of-Operations-to-Make-Network-Connectedhttps://github.com/wisdompeak/LeetCode/tree/master/Union_Find/1319.Number-of-Operations-to-Make-Network-Connected
1632.Rank-Transform-of-a-Matrixhttps://github.com/wisdompeak/LeetCode/tree/master/Union_Find/1632.Rank-Transform-of-a-Matrix
1631.Path-With-Minimum-Efforthttps://github.com/wisdompeak/LeetCode/tree/master/Union_Find/1631.Path-With-Minimum-Effort
1697.Checking-Existence-of-Edge-Length-Limited-Pathshttps://github.com/wisdompeak/LeetCode/tree/master/Union_Find/1697.Checking-Existence-of-Edge-Length-Limited-Paths
1724.Checking-Existence-of-Edge-Length-Limited-Paths-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Union_Find/1724.Checking-Existence-of-Edge-Length-Limited-Paths-II
1722.Minimize-Hamming-Distance-After-Swap-Operationshttps://github.com/wisdompeak/LeetCode/tree/master/Union_Find/1722.Minimize-Hamming-Distance-After-Swap-Operations
803.Bricks-Falling-When-Hithttps://github.com/wisdompeak/LeetCode/tree/master/DFS/803.Bricks-Falling-When-Hit
1970.Last-Day-Where-You-Can-Still-Crosshttps://github.com/wisdompeak/LeetCode/tree/master/Union_Find/1970.Last-Day-Where-You-Can-Still-Cross
2076.Process-Restricted-Friend-Requestshttps://github.com/wisdompeak/LeetCode/tree/master/Union_Find/2076.Process-Restricted-Friend-Requests
2092.Find-All-People-With-Secrethttps://github.com/wisdompeak/LeetCode/tree/master/Union_Find/2092.Find-All-People-With-Secret
2157.Groups-of-Stringshttps://github.com/wisdompeak/LeetCode/tree/master/Union_Find/2157.Groups-of-Strings
952.Largest-Component-Size-by-Common-Factorhttps://github.com/wisdompeak/LeetCode/tree/master/Union_Find/952.Largest-Component-Size-by-Common-Factor
1627.Graph-Connectivity-With-Thresholdhttps://github.com/wisdompeak/LeetCode/tree/master/Union_Find/1627.Graph-Connectivity-With-Threshold
1998.GCD-Sort-of-an-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Union_Find/1998.GCD-Sort-of-an-Array
1135.Connecting-Cities-With-Minimum-Costhttps://github.com/wisdompeak/LeetCode/tree/master/Union_Find/1135.Connecting-Cities-With-Minimum-Cost
1168.Optimize-Water-Distribution-in-a-Villagehttps://github.com/wisdompeak/LeetCode/tree/master/Union_Find/1168.Optimize-Water-Distribution-in-a-Village
1489.Find-Critical-and-Pseudo-Critical-Edges-in-Minimum-Spanning-Treehttps://github.com/wisdompeak/LeetCode/tree/master/Union_Find/1489.Find-Critical-and-Pseudo-Critical-Edges-in-Minimum-Spanning-Tree
1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversablehttps://github.com/wisdompeak/LeetCode/tree/master/Union_Find/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable
1584.Min-Cost-to-Connect-All-Pointshttps://github.com/wisdompeak/LeetCode/tree/master/Union_Find/1584.Min-Cost-to-Connect-All-Points
Recursionhttps://github.com/wisdompeak/LeetCode/tree/master/Recursion
https://patch-diff.githubusercontent.com/Nishant763/LeetCode#recursion
087.Scramble-Stringhttps://github.com/wisdompeak/LeetCode/tree/master/Recursion/087.Scramble-String
133.Clone-Graphhttps://github.com/wisdompeak/LeetCode/tree/master/Recursion/133.Clone-Graph
213.House-Robber-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/213.House-Robber-II
337.House-Robber-IIIhttps://github.com/wisdompeak/LeetCode/tree/master/Recursion/337.House-Robber-III
390.Elimination-Gamehttps://github.com/wisdompeak/LeetCode/tree/master/Recursion/390.Elimination-Game
395.Longest-Substring-with-At-Least-K-Repeating-Charactershttps://github.com/wisdompeak/LeetCode/tree/master/Recursion/395.Longest-Substring-with-At-Least-K-Repeating-Characters
397.Integer-Replacementhttps://github.com/wisdompeak/LeetCode/tree/master/Recursion/397.Integer-Replacement
761.Special-Binary-Stringhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/761.Special-Binary-String
780.Reaching-Pointshttps://github.com/wisdompeak/LeetCode/tree/master/Recursion/780.Reaching-Points
808.Soup-Servingshttps://github.com/wisdompeak/LeetCode/tree/master/Recursion/808.Soup-Servings
880.Decoded-String-at-Indexhttps://github.com/wisdompeak/LeetCode/tree/master/Recursion/880.Decoded-String-at-Index
902.Numbers-At-Most-N-Given-Digit-Sethttps://github.com/wisdompeak/LeetCode/tree/master/Recursion/902.Numbers-At-Most-N-Given-Digit-Set
964.Least-Operators-to-Express-Numberhttps://github.com/wisdompeak/LeetCode/tree/master/Recursion/964.Least-Operators-to-Express-Number
991.Broken-Calculatorhttps://github.com/wisdompeak/LeetCode/tree/master/Recursion/991.Broken-Calculator
1088.Confusing-Number-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Recursion/1088.Confusing-Number-II
1199.Minimum-Time-to-Build-Blockshttps://github.com/wisdompeak/LeetCode/tree/master/Recursion/1199.Minimum-Time-to-Build-Blocks
1274.Number-of-Ships-in-a-Rectanglehttps://github.com/wisdompeak/LeetCode/tree/master/Recursion/1274.Number-of-Ships-in-a-Rectangle
1415.The-k-th-Lexicographical-String-of-All-Happy-Strings-of-Length-nhttps://github.com/wisdompeak/LeetCode/tree/master/Recursion/1415.The-k-th-Lexicographical-String-of-All-Happy-Strings-of-Length-n
1553.Minimum-Number-of-Days-to-Eat-N-Orangeshttps://github.com/wisdompeak/LeetCode/tree/master/Recursion/1553.Minimum-Number-of-Days-to-Eat-N-Oranges
1611.Minimum-One-Bit-Operations-to-Make-Integers-Zerohttps://github.com/wisdompeak/LeetCode/tree/master/Recursion/1611.Minimum-One-Bit-Operations-to-Make-Integers-Zero
241.Different-Ways-to-Add-Parentheseshttps://github.com/wisdompeak/LeetCode/tree/master/Recursion/241.Different-Ways-to-Add-Parentheses
2019.The-Score-of-Students-Solving-Math-Expressionhttps://github.com/wisdompeak/LeetCode/tree/master/Recursion/2019.The-Score-of-Students-Solving-Math-Expression
679.24-Gamehttps://github.com/wisdompeak/LeetCode/tree/master/Recursion/679.24-Game
464.Can-I-Winhttps://github.com/wisdompeak/LeetCode/tree/master/Recursion/464.Can-I-Win
877.Stone-Gamehttps://github.com/wisdompeak/LeetCode/tree/master/Recursion/877.Stone-Game
1140.Stone-Game-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Recursion/1140.Stone-Game-II
1406.Stone-Game-IIIhttps://github.com/wisdompeak/LeetCode/tree/master/Recursion/1406.Stone-Game-III
1510.Stone-Game-IVhttps://github.com/wisdompeak/LeetCode/tree/master/Recursion/1510.Stone-Game-IV
1563.Stone-Game-Vhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1563.Stone-Game-V
2029.Stone-Game-IXhttps://github.com/wisdompeak/LeetCode/tree/master/Others/2029.Stone-Game-IX
Graphhttps://github.com/wisdompeak/LeetCode/tree/master/Graph/
https://patch-diff.githubusercontent.com/Nishant763/LeetCode#graph
332.Reconstruct-Itineraryhttps://github.com/wisdompeak/LeetCode/tree/master/DFS/332.Reconstruct-Itinerary
2097.Valid-Arrangement-of-Pairshttps://github.com/wisdompeak/LeetCode/tree/master/Graph/2097.Valid-Arrangement-of-Pairs
753.Cracking-the-Safehttps://github.com/wisdompeak/LeetCode/tree/master/Hash/753.Cracking-the-Safe
1059.All-Paths-from-Source-Lead-to-Destinationhttps://github.com/wisdompeak/LeetCode/tree/master/Graph/1059.All-Paths-from-Source-Lead-to-Destination
1192.Critical-Connections-in-a-Networkhttps://github.com/wisdompeak/LeetCode/tree/master/DFS/1192.Critical-Connections-in-a-Network
1719.Number-Of-Ways-To-Reconstruct-A-Treehttps://github.com/wisdompeak/LeetCode/tree/master/Graph/1719.Number-Of-Ways-To-Reconstruct-A-Tree
1761.Minimum-Degree-of-a-Connected-Trio-in-a-Graphhttps://github.com/wisdompeak/LeetCode/tree/master/Graph/1761.Minimum-Degree-of-a-Connected-Trio-in-a-Graph
1782.Count-Pairs-Of-Nodeshttps://github.com/wisdompeak/LeetCode/tree/master/Graph/1782.Count-Pairs-Of-Nodes
1820.Maximum-Number-of-Accepted-Invitationshttps://github.com/wisdompeak/LeetCode/tree/master/Graph/1820.Maximum-Number-of-Accepted-Invitations
2123.Minimum-Operations-to-Remove-Adjacent-Ones-in-Matrixhttps://github.com/wisdompeak/LeetCode/tree/master/Graph/2123.Minimum-Operations-to-Remove-Adjacent-Ones-in-Matrix
Mathhttps://github.com/wisdompeak/LeetCode/tree/master/Math
https://patch-diff.githubusercontent.com/Nishant763/LeetCode#math
089.Gray-Codehttps://github.com/wisdompeak/LeetCode/tree/master/Math/089.Gray-Code
233.Number-of-Digit-Onehttps://github.com/wisdompeak/LeetCode/tree/master/Math/233.Number-of-Digit-One
400.n-th-digithttps://github.com/wisdompeak/LeetCode/tree/master/Math/400.n-th-digit
441.Arranging-Coinshttps://github.com/wisdompeak/LeetCode/tree/master/Math/441.Arranging-Coins
628.Maximum-Product-of-Three-Numbershttps://github.com/wisdompeak/LeetCode/tree/master/Math/628.Maximum-Product-of-Three-Numbers
672.Bulb-Switcher-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/672.Bulb-Switcher-II
754.Reach-a-Numberhttps://github.com/wisdompeak/LeetCode/tree/master/Math/754.Reach-a-Number
829.Consecutive-Numbers-Sumhttps://github.com/wisdompeak/LeetCode/tree/master/Math/829.Consecutive-Numbers-Sum
878.Nth-Magical-Numberhttps://github.com/wisdompeak/LeetCode/tree/master/Math/878.Nth-Magical-Number
883.Projection-Area-of-3D-Shapeshttps://github.com/wisdompeak/LeetCode/tree/master/Math/883.Projection-Area-of-3D-Shapes
891.Sum-of-Subsequence-Widthshttps://github.com/wisdompeak/LeetCode/tree/master/Math/891.Sum-of-Subsequence-Widths
899.Orderly-Queuehttps://github.com/wisdompeak/LeetCode/tree/master/Math/899.Orderly-Queue
963.Minimum-Area-Rectangle-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Math/963.Minimum-Area-Rectangle-II
964.Least-Operators-to-Express-Numberhttps://github.com/wisdompeak/LeetCode/tree/master/Recursion/964.Least-Operators-to-Express-Number
972.Equal-Rational-Numbershttps://github.com/wisdompeak/LeetCode/tree/master/Math/972.Equal-Rational-Numbers
1012.Numbers-With-Repeated-Digitshttps://github.com/wisdompeak/LeetCode/tree/master/Math/1012.Numbers-With-Repeated-Digits
1017.Convert-to-Base--2https://github.com/wisdompeak/LeetCode/tree/master/Math/1017.Convert-to-Base--2
1073.Adding-Two-Negabinary-Numbershttps://github.com/wisdompeak/LeetCode/tree/master/Math/1073.Adding-Two-Negabinary-Numbers
1025.Divisor-Gamehttps://github.com/wisdompeak/LeetCode/tree/master/Math/1025.Divisor-Game
1040.Moving-Stones-Until-Consecutive-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Math/1040.Moving-Stones-Until-Consecutive-II
1015.Smallest-Integer-Divisible-by-Khttps://github.com/wisdompeak/LeetCode/tree/master/Math/1015.Smallest-Integer-Divisible-by-K
1103.Distribute-Candies-to-Peoplehttps://github.com/wisdompeak/LeetCode/tree/master/Math/1103.Distribute-Candies-to-People
1250.Check-If-It-Is-a-Good-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Math/1250.Check-If-It-Is-a-Good-Array
1680.Concatenation-of-Consecutive-Binary-Numbershttps://github.com/wisdompeak/LeetCode/tree/master/Math/1680.Concatenation-of-Consecutive-Binary-Numbers
1739.Building-Boxeshttps://github.com/wisdompeak/LeetCode/tree/master/Math/1739.Building-Boxes
1806.Minimum-Number-of-Operations-to-Reinitialize-a-Permutationhttps://github.com/wisdompeak/LeetCode/tree/master/Math/1806.Minimum-Number-of-Operations-to-Reinitialize-a-Permutation
1969.Minimum-Non-Zero-Product-of-the-Array-Elementshttps://github.com/wisdompeak/LeetCode/tree/master/Math/1969.Minimum-Non-Zero-Product-of-the-Array-Elements
2128.Remove-All-Ones-With-Row-and-Column-Flipshttps://github.com/wisdompeak/LeetCode/tree/master/Math/2128.Remove-All-Ones-With-Row-and-Column-Flips
2183.Count-Array-Pairs-Divisible-by-Khttps://github.com/wisdompeak/LeetCode/tree/master/Math/2183.Count-Array-Pairs-Divisible-by-K
296.Best-Meeting-Pointhttps://github.com/wisdompeak/LeetCode/tree/master/Math/296.Best-Meeting-Point
2033.Minimum-Operations-to-Make-a-Uni-Value-Gridhttps://github.com/wisdompeak/LeetCode/tree/master/Math/2033.Minimum-Operations-to-Make-a-Uni-Value-Grid
1703.Minimum-Adjacent-Swaps-for-K-Consecutive-Oneshttps://github.com/wisdompeak/LeetCode/tree/master/Math/1703.Minimum-Adjacent-Swaps-for-K-Consecutive-Ones
1478.Allocate-Mailboxeshttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1478.Allocate-Mailboxes
1131.Maximum-of-Absolute-Value-Expressionhttps://github.com/wisdompeak/LeetCode/tree/master/Math/1131.Maximum-of-Absolute-Value-Expression
1956.Minimum-Time-For-K-Virus-Variants-to-Spreadhttps://github.com/wisdompeak/LeetCode/tree/master/Math/1956.Minimum-Time-For-K-Virus-Variants-to-Spread
223.Rectangle-Areahttps://github.com/wisdompeak/LeetCode/tree/master/Math/223.Rectangle-Area
335.Self-Crossinghttps://github.com/wisdompeak/LeetCode/tree/master/Math/335.Self-Crossing
587.Erect-the-Fencehttps://github.com/wisdompeak/LeetCode/tree/master/Math/587.Erect-the-Fence
593.Valid-Squarehttps://github.com/wisdompeak/LeetCode/tree/master/Math/593.Valid-Square
858.Mirror-Reflectionhttps://github.com/wisdompeak/LeetCode/tree/master/Math/858.Mirror-Reflection
1401.Circle-and-Rectangle-Overlappinghttps://github.com/wisdompeak/LeetCode/tree/master/Math/1401.Circle-and-Rectangle-Overlapping
1453.Maximum-Number-of-Darts-Inside-of-a-Circular-Dartboardhttps://github.com/wisdompeak/LeetCode/tree/master/Math/1453.Maximum-Number-of-Darts-Inside-of-a-Circular-Dartboard
1610.Maximum-Number-of-Visible-Pointshttps://github.com/wisdompeak/LeetCode/tree/master/Math/1610.Maximum-Number-of-Visible-Points
382.Linked-List-Random-Nodehttps://github.com/wisdompeak/LeetCode/tree/master/Math/382.Linked-List-Random-Node
470.Implement-Rand10()-Using-Rand7()https://github.com/wisdompeak/LeetCode/tree/master/Math/470.Implement-Rand10--Using-Rand7
478.Generate-Random-Point-in-a-Circlehttps://github.com/wisdompeak/LeetCode/tree/master/Math/478.Generate-Random-Point-in-a-Circle
497.Random-Point-in-Non-overlapping-Rectangleshttps://github.com/wisdompeak/LeetCode/tree/master/Math/497.Random-Point-in-Non-overlapping-Rectangles
519.Random-Flip-Matrixhttps://github.com/wisdompeak/LeetCode/tree/master/Math/519.Random-Flip-Matrix
528.Random-Pick-with-Weighthttps://github.com/wisdompeak/LeetCode/tree/master/Math/528.Random-Pick-with-Weight
710.Random-Pick-with-Blacklisthttps://github.com/wisdompeak/LeetCode/tree/master/Math/710.Random-Pick-with-Blacklist
1227.Airplane-Seat-Assignment-Probabilityhttps://github.com/wisdompeak/LeetCode/tree/master/Math/1227.Airplane-Seat-Assignment-Probability
046.Permutationshttps://github.com/wisdompeak/LeetCode/tree/master/Math/046.Permutations
047.Permutations-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Math/047.Permutations-II
060.Permutation-Sequencehttps://github.com/wisdompeak/LeetCode/tree/master/Math/060.Permutation-Sequence
077.Combinationshttps://github.com/wisdompeak/LeetCode/blob/master/Math/077.Combinations
1286.Iterator-for-Combinationhttps://github.com/wisdompeak/LeetCode/tree/master/Math/1286.Iterator-for-Combination
1359.Count-All-Valid-Pickup-and-Delivery-Optionshttps://github.com/wisdompeak/LeetCode/tree/master/Math/1359.Count-All-Valid-Pickup-and-Delivery-Options
1467.Probability-of-a-Two-Boxes-Having-The-Same-Number-of-Distinct-Ballshttps://github.com/wisdompeak/LeetCode/tree/master/Math/1467.Probability-of-a-Two-Boxes-Having-The-Same-Number-of-Distinct-Balls
1641.Count-Sorted-Vowel-Stringshttps://github.com/wisdompeak/LeetCode/tree/master/Math/1641.Count-Sorted-Vowel-Strings
1643.Kth-Smallest-Instructionshttps://github.com/wisdompeak/LeetCode/tree/master/Math/1643.Kth-Smallest-Instructions
1735.Count-Ways-to-Make-Array-With-Producthttps://github.com/wisdompeak/LeetCode/tree/master/Math/1735.Count-Ways-to-Make-Array-With-Product
1830.Minimum-Number-of-Operations-to-Make-String-Sortedhttps://github.com/wisdompeak/LeetCode/tree/master/Math/1830.Minimum-Number-of-Operations-to-Make-String-Sorted
1866.Number-of-Ways-to-Rearrange-Sticks-With-K-Sticks-Visiblehttps://github.com/wisdompeak/LeetCode/tree/master/Math/1866.Number-of-Ways-to-Rearrange-Sticks-With-K-Sticks-Visible
1916.Count-Ways-to-Build-Rooms-in-an-Ant-Colonyhttps://github.com/wisdompeak/LeetCode/tree/master/Math/1916.Count-Ways-to-Build-Rooms-in-an-Ant-Colony
343.Integer-Breakhttps://github.com/wisdompeak/LeetCode/tree/master/Math/343.Integer-Break
365.Water-and-Jug-Problemhttps://github.com/wisdompeak/LeetCode/tree/master/Math/365.Water-and-Jug-Problem
1808.Maximize-Number-of-Nice-Divisorshttps://github.com/wisdompeak/LeetCode/tree/master/Math/1808.Maximize-Number-of-Nice-Divisors
Greedyhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy
https://patch-diff.githubusercontent.com/Nishant763/LeetCode#greedy
055.Jump-Gamehttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/055.Jump-Game
045.Jump-Game-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/045.Jump-Game-II
134.Gas-Stationhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/134.Gas-Station
221.Maximal-Squarehttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/221.Maximal-Square
229.Majority-Element-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/229.Majority-Element-II
659.Split-Array-into-Consecutive-Subsequenceshttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/659.Split-Array-into-Consecutive-Subsequences
484.Find-Permutationhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/484.Find-Permutation
386.Lexicographical-Numbershttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/386.Lexicographical-Numbers
665.Non-decreasing-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/665.Non-decreasing-Array
330.Patching-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/330.Patching-Array
683.K-Empty-Slotshttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/683.K-Empty-Slots
517.Super-Washing-Machineshttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/517.Super-Washing-Machines
781.Rabbits-in-Foresthttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/781.Rabbits-in-Forest
881.Boats-to-Save-Peoplehttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/881.Boats-to-Save-People
910.Smallest-Range-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/910.Smallest-Range-II
936.Stamping-The-Sequencehttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/936.Stamping-The-Sequence
948.Bag-of-Tokenshttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/948.Bag-of-Tokens
968.Binary-Tree-Camerashttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/968.Binary-Tree-Cameras
955.Delete-Columns-to-Make-Sorted-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/955.Delete-Columns-to-Make-Sorted-II
1040.Moving-Stones-Until-Consecutive-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1040.Moving-Stones-Until-Consecutive-II
1191.K-Concatenation-Maximum-Sumhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1191.K-Concatenation-Maximum-Sum
1253.Reconstruct-a-2-Row-Binary-Matrixhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1253.Reconstruct-a-2-Row-Binary-Matrix
1354.Construct-Target-Array-With-Multiple-Sumshttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1354.Construct-Target-Array-With-Multiple-Sums
1414.Find-the-Minimum-Number-of-Fibonacci-Numbers-Whose-Sum-Is-Khttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1414.Find-the-Minimum-Number-of-Fibonacci-Numbers-Whose-Sum-Is-K
1488.Avoid-Flood-in-The-Cityhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1488.Avoid-Flood-in-The-City
1505.Minimum-Possible-Integer-After-at-Most-K-Adjacent-Swaps-On-Digitshttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1505.Minimum-Possible-Integer-After-at-Most-K-Adjacent-Swaps-On-Digits
1526.Minimum-Number-of-Increments-on-Subarrays-to-Form-a-Target-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1526.Minimum-Number-of-Increments-on-Subarrays-to-Form-a-Target-Array
1535.Find-the-Winner-of-an-Array-Gamehttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1535.Find-the-Winner-of-an-Array-Game
1536.Minimum-Swaps-to-Arrange-a-Binary-Gridhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1536.Minimum-Swaps-to-Arrange-a-Binary-Grid
1540.Can-Convert-String-in-K-Moveshttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1540.Can-Convert-String-in-K-Moves
1567.Maximum-Length-of-Subarray-With-Positive-Producthttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1567.Maximum-Length-of-Subarray-With-Positive-Product
1578.Minimum-Deletion-Cost-to-Avoid-Repeating-Lettershttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1578.Minimum-Deletion-Cost-to-Avoid-Repeating-Letters
1585.Check-If-String-Is-Transformable-With-Substring-Sort-Operationshttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1585.Check-If-String-Is-Transformable-With-Substring-Sort-Operations
1657.Determine-if-Two-Strings-Are-Closehttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1657.Determine-if-Two-Strings-Are-Close
1702.Maximum-Binary-String-After-Changehttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1702.Maximum-Binary-String-After-Change
1717.Maximum-Score-From-Removing-Substringshttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1717.Maximum-Score-From-Removing-Substrings
1727.Largest-Submatrix-With-Rearrangementshttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1727.Largest-Submatrix-With-Rearrangements
1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Dayhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day
1788.Maximize-the-Beauty-of-the-Gardenhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1788.Maximize-the-Beauty-of-the-Garden
1818.Minimum-Absolute-Sum-Differencehttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1818.Minimum-Absolute-Sum-Difference
1850.Minimum-Adjacent-Swaps-to-Reach-the-Kth-Smallest-Numberhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1850.Minimum-Adjacent-Swaps-to-Reach-the-Kth-Smallest-Number
1911.Maximum-Alternating-Subsequence-Sumhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1911.Maximum-Alternating-Subsequence-Sum
2086.Minimum-Number-of-Buckets-Required-to-Collect-Rainwater-from-Houseshttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/2086.Minimum-Number-of-Buckets-Required-to-Collect-Rainwater-from-Houses
2136.Earliest-Possible-Day-of-Full-Bloomhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/2136.Earliest-Possible-Day-of-Full-Bloom
2170.Minimum-Operations-to-Make-the-Array-Alternatinghttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/2170.Minimum-Operations-to-Make-the-Array-Alternating
2171.Removing-Minimum-Number-of-Magic-Beanshttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/2171.Removing-Minimum-Number-of-Magic-Beans
2182.Construct-String-With-Repeat-Limithttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/2182.Construct-String-With-Repeat-Limit
2193.Minimum-Number-of-Moves-to-Make-Palindromehttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/2193.Minimum-Number-of-Moves-to-Make-Palindrome
300.Longest-Increasing-Subsequencehttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/300.Longest-Increasing-Subsequence
354.Russian-Doll-Envelopeshttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/354.Russian-Doll-Envelopes
1713.Minimum-Operations-to-Make-a-Subsequencehttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1713.Minimum-Operations-to-Make-a-Subsequence
1964.Find-the-Longest-Valid-Obstacle-Course-at-Each-Positionhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1964.Find-the-Longest-Valid-Obstacle-Course-at-Each-Position
2111.Minimum-Operations-to-Make-the-Array-K-Increasinghttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/2111.Minimum-Operations-to-Make-the-Array-K-Increasing
135.Candyhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/135.Candy
1840.Maximum-Building-Heighthttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1840.Maximum-Building-Height
1846.Maximum-Element-After-Decreasing-and-Rearranginghttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1846.Maximum-Element-After-Decreasing-and-Rearranging
042.Trapping-Rain-Waterhttps://github.com/wisdompeak/LeetCode/tree/master/Others/042.Trapping-Rain-Water
334.Increasing-Triplet-Subsequencehttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/334.Increasing-Triplet-Subsequence
907.Sum-of-Subarray-Minimumshttps://github.com/wisdompeak/LeetCode/tree/master/Stack/907.Sum-of-Subarray-Minimums
1525.Number-of-Good-Ways-to-Split-a-Stringhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1525.Number-of-Good-Ways-to-Split-a-String
1638.Count-Substrings-That-Differ-by-One-Characterhttps://github.com/wisdompeak/LeetCode/tree/master/Dynamic_Programming/1638.Count-Substrings-That-Differ-by-One-Character
1653.Minimum-Deletions-to-Make-String-Balancedhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1653.Minimum-Deletions-to-Make-String-Balanced
1664.Ways-to-Make-a-Fair-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1664.Ways-to-Make-a-Fair-Array
1671.Minimum-Number-of-Removals-to-Make-Mountain-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1671.Minimum-Number-of-Removals-to-Make-Mountain-Array
1769.Minimum-Number-of-Operations-to-Move-All-Balls-to-Each-Boxhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1769.Minimum-Number-of-Operations-to-Move-All-Balls-to-Each-Box
1888.Minimum-Number-of-Flips-to-Make-the-Binary-String-Alternatinghttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1888.Minimum-Number-of-Flips-to-Make-the-Binary-String-Alternating
2163.Minimum-Difference-in-Sums-After-Removal-of-Elementshttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/2163.Minimum-Difference-in-Sums-After-Removal-of-Elements
2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goodshttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/2167.Minimum-Time-to-Remove-All-Cars-Containing-Illegal-Goods
524.Longest-Word-in-Dictionary-through-Deletinghttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/524.Longest-Word-in-Dictionary-through-Deleting
727.Minimum-Window-Subsequencehttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/727.Minimum-Window-Subsequence
792.Number-of-Matching-Subsequenceshttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/792.Number-of-Matching-Subsequences
1055.Shortest-Way-to-Form-Stringhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1055.Shortest-Way-to-Form-String
2055.Plates-Between-Candleshttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/2055.Plates-Between-Candles
179.Largest-Numberhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/179.Largest-Number
581.shortest-unsorted-continuous-subarrayhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/581.shortest-unsorted-continuous-subarray
275.H-Index-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/275.H-Index-II
406.Queue-Reconstruction-by-Heighthttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/406.Queue-Reconstruction-by-Height
731.My-Calendar-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/731.My-Calendar-II
1268.Search-Suggestions-Systemhttps://github.com/wisdompeak/LeetCode/tree/master/Trie/1268.Search-Suggestions-System
1402.Reducing-Disheshttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1402.Reducing-Dishes
1520.Maximum-Number-of-Non-Overlapping-Substringshttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1520.Maximum-Number-of-Non-Overlapping-Substrings
1564.Put-Boxes-Into-the-Warehouse-Ihttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1564.Put-Boxes-Into-the-Warehouse-I
1665.Minimum-Initial-Energy-to-Finish-Taskshttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1665.Minimum-Initial-Energy-to-Finish-Tasks
1686.Stone-Game-VIhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1686.Stone-Game-VI
1996.The-Number-of-Weak-Characters-in-the-Gamehttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1996.The-Number-of-Weak-Characters-in-the-Game
041.First-Missing-Positivehttps://github.com/wisdompeak/LeetCode/blob/master/Greedy/041.First-Missing-Positive/Readme.md
268.Missing-Numberhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/268.Missing-Number
287.Find-the-Duplicate-Numberhttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/287.Find-the-Duplicate-Number
442.Find-All-Duplicates-in-an-Arrayhttps://github.com/wisdompeak/LeetCode/blob/master/Greedy/442.Find-All-Duplicates-in-an-Array
448.Find-All-Numbers-Disappeared-in-an-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/448.Find-All-Numbers-Disappeared-in-an-Array
645.Set-Mismatchhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/645.Set-Mismatch
032.Longest-Valid-Parentheseshttps://github.com/wisdompeak/LeetCode/tree/master/Stack/032.Longest-Valid-Parentheses
921.Minimum-Add-to-Make-Parentheses-Validhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/921.Minimum-Add-to-Make-Parentheses-Valid
1249.Minimum-Remove-to-Make-Valid-Parentheseshttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1249.Minimum-Remove-to-Make-Valid-Parentheses
1541.Minimum-Insertions-to-Balance-a-Parentheses-Stringhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1541.Minimum-Insertions-to-Balance-a-Parentheses-String
1963.minimum-number-of-swaps-to-make-the-string-balancedhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1963.minimum-number-of-swaps-to-make-the-string-balanced
678.Valid-Parenthesis-Stringhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/678.Valid-Parenthesis-String
2116.Check-if-a-Parentheses-String-Can-Be-Validhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/2116.Check-if-a-Parentheses-String-Can-Be-Valid
435.Non-overlapping-Intervalshttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/435.Non-overlapping-Intervals
646.Maximum-Length-of-Pair-Chainhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/646.Maximum-Length-of-Pair-Chain
452.Minimum-Number-of-Arrows-to-Burst-Balloonshttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/452.Minimum-Number-of-Arrows-to-Burst-Balloons
757.Set-Intersection-Size-At-Least-Twohttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/757.Set-Intersection-Size-At-Least-Two
1024.Video-Stitchinghttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1024.Video-Stitching
1272.Remove-Intervalhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1272.Remove-Interval
1288.Remove-Covered-Intervalshttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1288.Remove-Covered-Intervals
1326.Minimum-Number-of-Taps-to-Open-to-Water-a-Gardenhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1326.Minimum-Number-of-Taps-to-Open-to-Water-a-Garden
1235.Maximum-Profit-in-Job-Schedulinghttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1235.Maximum-Profit-in-Job-Scheduling
1751.Maximum-Number-of-Events-That-Can-Be-Attended-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1751.Maximum-Number-of-Events-That-Can-Be-Attended-II
2008.Maximum-Earnings-From-Taxihttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/2008.Maximum-Earnings-From-Taxi
2054.Two-Best-Non-Overlapping-Eventshttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/2054.Two-Best-Non-Overlapping-Events
324.Wiggle-Sort-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Others/324.Wiggle-Sort-II
667.Beautiful-Arrangement-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/667.Beautiful-Arrangement-II
932.Beautiful-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/932.Beautiful-Array
1605.Find-Valid-Matrix-Given-Row-and-Column-Sumshttps://github.com/wisdompeak/LeetCode/tree/master/Math/1605.Find-Valid-Matrix-Given-Row-and-Column-Sums
2007.Find-Original-Array-From-Doubled-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/2007.Find-Original-Array-From-Doubled-Array
2122.Recover-the-Original-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/2122.Recover-the-Original-Array
1982.Find-Array-Given-Subset-Sumshttps://github.com/wisdompeak/LeetCode/tree/master/Greedy/1982.Find-Array-Given-Subset-Sums
Simulationhttps://github.com/wisdompeak/LeetCode/tree/master/Simulation
https://patch-diff.githubusercontent.com/Nishant763/LeetCode#simulation
2061.Number-of-Spaces-Cleaning-Robot-Cleanedhttps://github.com/wisdompeak/LeetCode/tree/master/Simulation/2061.Number-of-Spaces-Cleaning-Robot-Cleaned
2069.Walking-Robot-Simulation-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Simulation/2069.Walking-Robot-Simulation-II
Othershttps://github.com/wisdompeak/LeetCode/tree/master/Others
https://patch-diff.githubusercontent.com/Nishant763/LeetCode#others-
007.Reverse-Integerhttps://github.com/wisdompeak/LeetCode/tree/master/Others/007.Reverse-Integer
048.Rotate-Imagehttps://github.com/wisdompeak/LeetCode/tree/master/Others/048.Rotate-Image
065.Valid-Numberhttps://github.com/wisdompeak/LeetCode/tree/master/Others/065.Valid-Number
158.Read-N-Characters-Given-Read4-II-Call-multiple-timeshttps://github.com/wisdompeak/LeetCode/tree/master/Others/158.Read-N-Characters-Given-Read4-II-Call-multiple-times
240.Search-a-2D-Matrix-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Others/240.Search-a-2D-Matrix-II
277.Find-the-Celebrityhttps://github.com/wisdompeak/LeetCode/tree/master/Others/277.Find-the-Celebrity
311.Sparse-Matrix-Multiplicationhttps://github.com/wisdompeak/LeetCode/tree/master/Others/311.Sparse-Matrix-Multiplication
782.Transform-to-Chessboardhttps://github.com/wisdompeak/LeetCode/tree/master/Others/782.Transform-to-Chessboard
466.Count-The-Repetitionshttps://github.com/wisdompeak/LeetCode/tree/master/Others/466.Count-The-Repetitions
810.Chalkboard-XOR-Gamehttps://github.com/wisdompeak/LeetCode/tree/master/Others/810.Chalkboard-XOR-Game
775.Global-and-Local-Inversionshttps://github.com/wisdompeak/LeetCode/tree/master/Others/775.Global-and-Local-Inversions
348.Design-Tic-Tac-Toehttps://github.com/wisdompeak/LeetCode/tree/master/Others/348.Design-Tic-Tac-Toe
794.Valid-Tic-Tac-Toe-Statehttps://github.com/wisdompeak/LeetCode/tree/master/Others/794.Valid-Tic-Tac-Toe-State
835.Image-Overlaphttps://github.com/wisdompeak/LeetCode/tree/master/Others/835.Image-Overlap
843.Guess-the-Wordhttps://github.com/wisdompeak/LeetCode/tree/master/Others/843.Guess-the-Word
927.Three-Equal-Partshttps://github.com/wisdompeak/LeetCode/tree/master/Others/927.Three-Equal-Parts
978.Longest-Turbulent-Subarrayhttps://github.com/wisdompeak/LeetCode/tree/master/Others/978.Longest-Turbulent-Subarray
1267.Count-Servers-that-Communicatehttps://github.com/wisdompeak/LeetCode/tree/master/Others/1267.Count-Servers-that-Communicate
1538.Guess-the-Majority-in-a-Hidden-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Others/1538.Guess-the-Majority-in-a-Hidden-Array
1706.Where-Will-the-Ball-Fallhttps://github.com/wisdompeak/LeetCode/tree/master/Others/1706.Where-Will-the-Ball-Fall
1749.Maximum-Absolute-Sum-of-Any-Subarrayhttps://github.com/wisdompeak/LeetCode/tree/master/Others/1749.Maximum-Absolute-Sum-of-Any-Subarray
1752.Check-if-Array-Is-Sorted-and-Rotatedhttps://github.com/wisdompeak/LeetCode/tree/master/Others/1752.Check-if-Array-Is-Sorted-and-Rotated
1826.Faulty-Sensorhttps://github.com/wisdompeak/LeetCode/tree/master/Others/1826.Faulty-Sensor
1861.Rotating-the-Boxhttps://github.com/wisdompeak/LeetCode/tree/master/Others/1861.Rotating-the-Box
1862.Sum-of-Floored-Pairshttps://github.com/wisdompeak/LeetCode/tree/master/Others/1862.Sum-of-Floored-Pairs
1904.The-Number-of-Full-Rounds-You-Have-Playedhttps://github.com/wisdompeak/LeetCode/tree/master/Others/1904.The-Number-of-Full-Rounds-You-Have-Played
1997.First-Day-Where-You-Have-Been-in-All-the-Roomshttps://github.com/wisdompeak/LeetCode/tree/master/Others/1997.First-Day-Where-You-Have-Been-in-All-the-Rooms
2018.Check-if-Word-Can-Be-Placed-In-Crosswordhttps://github.com/wisdompeak/LeetCode/tree/master/Others/2018.Check-if-Word-Can-Be-Placed-In-Crossword
2147.Number-of-Ways-to-Divide-a-Long-Corridorhttps://github.com/wisdompeak/LeetCode/tree/master/Others/2147.Number-of-Ways-to-Divide-a-Long-Corridor
1685.Sum-of-Absolute-Differences-in-a-Sorted-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Others/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array
2121.Intervals-Between-Identical-Elementshttps://github.com/wisdompeak/LeetCode/tree/master/Others/2121.Intervals-Between-Identical-Elements
252.Meeting-Roomshttps://github.com/wisdompeak/LeetCode/tree/master/Others/252.Meeting-Rooms
253.Meeting-Rooms-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Others/253.Meeting-Rooms-II
056.Merge-Intervalshttps://github.com/wisdompeak/LeetCode/tree/master/Others/056.Merge-Intervals
057.Insert-Intervalshttps://github.com/wisdompeak/LeetCode/tree/master/Others/057.Insert-Interval
732.My-Calendar-IIIhttps://github.com/wisdompeak/LeetCode/tree/master/Others/732.My-Calendar-III
759.Employee-Free-Timehttps://github.com/wisdompeak/LeetCode/tree/master/Others/759.Employee-Free-Time
798.Smallest-Rotation-with-Highest-Scorehttps://github.com/wisdompeak/LeetCode/tree/master/Others/798.Smallest-Rotation-with-Highest-Score
995.Minimum-Number-of-K-Consecutive-Bit-Flipshttps://github.com/wisdompeak/LeetCode/tree/master/Others/995.Minimum-Number-of-K-Consecutive-Bit-Flips
1094.Car-Poolinghttps://github.com/wisdompeak/LeetCode/tree/master/Others/1094.Car-Pooling
1109.Corporate-Flight-Bookingshttps://github.com/wisdompeak/LeetCode/tree/master/Others/1109.Corporate-Flight-Bookings
1589.Maximum-Sum-Obtained-of-Any-Permutationhttps://github.com/wisdompeak/LeetCode/tree/master/Others/1589.Maximum-Sum-Obtained-of-Any-Permutation
1674.Minimum-Moves-to-Make-Array-Complementaryhttps://github.com/wisdompeak/LeetCode/tree/master/Others/1674.Minimum-Moves-to-Make-Array-Complementary
1871.Jump-Game-VIIhttps://github.com/wisdompeak/LeetCode/tree/master/Others/1871.Jump-Game-VII
1943.Describe-the-Paintinghttps://github.com/wisdompeak/LeetCode/tree/master/Others/1943.Describe-the-Painting
2015.Average-Height-of-Buildings-in-Each-Segmenthttps://github.com/wisdompeak/LeetCode/tree/master/Others/2015.Average-Height-of-Buildings-in-Each-Segment
2158.Amount-of-New-Area-Painted-Each-Dayhttps://github.com/wisdompeak/LeetCode/tree/master/Others/2158.Amount-of-New-Area-Painted-Each-Day
850.Rectangle-Area-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Others/850.Rectangle-Area-II
2132.Stamping-the-Gridhttps://github.com/wisdompeak/LeetCode/tree/master/Others/2132.Stamping-the-Grid
479.Largest-Palindrome-Producthttps://github.com/wisdompeak/LeetCode/tree/master/Others/479.Largest-Palindrome-Product
866.Prime-Palindromehttps://github.com/wisdompeak/LeetCode/tree/master/Others/866.Prime-Palindrome
906.Super-Palindromeshttps://github.com/wisdompeak/LeetCode/tree/master/Others/906.Super-Palindromes
2081.Sum-of-k-Mirror-Numbershttps://github.com/wisdompeak/LeetCode/tree/master/Others/2081.Sum-of-k-Mirror-Numbers
795.Number-of-Subarrays-with-Bounded-Maximumhttps://github.com/wisdompeak/LeetCode/tree/master/Others/795.Number-of-Subarrays-with-Bounded-Maximum
1625.Lexicographically-Smallest-String-After-Applying-Operationshttps://github.com/wisdompeak/LeetCode/tree/master/Others/1625.Lexicographically-Smallest-String-After-Applying-Operations
1714.Sum-Of-Special-Evenly-Spaced-Elements-In-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Others/1714.Sum-Of-Special-Evenly-Spaced-Elements-In-Array
1737.Change-Minimum-Characters-to-Satisfy-One-of-Three-Conditionshttps://github.com/wisdompeak/LeetCode/tree/master/Others/1737.Change-Minimum-Characters-to-Satisfy-One-of-Three-Conditions
2013.Detect-Squareshttps://github.com/wisdompeak/LeetCode/tree/master/Others/2013.Detect-Squares
1878.Get-Biggest-Three-Rhombus-Sums-in-a-Gridhttps://github.com/wisdompeak/LeetCode/tree/master/Others/1878.Get-Biggest-Three-Rhombus-Sums-in-a-Grid
1906.Minimum-Absolute-Difference-Querieshttps://github.com/wisdompeak/LeetCode/tree/master/Others/1906.Minimum-Absolute-Difference-Queries
1292.Maximum-Side-Length-of-a-Square-with-Sum-Less-than-or-Equal-to-Thresholdhttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/1292.Maximum-Side-Length-of-a-Square-with-Sum-Less-than-or-Equal-to-Threshold
2132.Stamping-the-Gridhttps://github.com/wisdompeak/LeetCode/tree/master/Others/2132.Stamping-the-Grid
215.Kth-Largest-Element-in-an-Arrayhttps://github.com/wisdompeak/LeetCode/tree/master/Binary_Search/215.Kth-Largest-Element-in-an-Array
347.Top-K-Frequent-Elementshttps://github.com/wisdompeak/LeetCode/tree/master/Others/347.Top-K-Frequent-Elements
973.K-Closest-Points-to-Originhttps://github.com/wisdompeak/LeetCode/tree/master/Others/973.K-Closest-Points-to-Origin
324.Wiggle-Sort-IIhttps://github.com/wisdompeak/LeetCode/tree/master/Others/324.Wiggle-Sort-II
LeetCode Cuphttps://github.com/wisdompeak/LeetCode/tree/master/LCCUP
https://patch-diff.githubusercontent.com/Nishant763/LeetCode#leetcode-cup
LCP23.魔术排列https://github.com/wisdompeak/LeetCode/tree/master/LCCUP/2020Fall/LCP23.%E9%AD%94%E6%9C%AF%E6%8E%92%E5%88%97
LCP24.数字游戏https://github.com/wisdompeak/LeetCode/tree/master/LCCUP/2020Fall/LCP24.%E6%95%B0%E5%AD%97%E6%B8%B8%E6%88%8F
LCP25.古董键盘https://github.com/wisdompeak/LeetCode/tree/master/LCCUP/2020Fall/LCP25.%E5%8F%A4%E8%91%A3%E9%94%AE%E7%9B%98
LCP32.批量处理任务https://github.com/wisdompeak/LeetCode/tree/master/LCCUP/2021Spring/LCP32.%E6%89%B9%E9%87%8F%E5%A4%84%E7%90%86%E4%BB%BB%E5%8A%A1
LCP35.电动车游城市https://github.com/wisdompeak/LeetCode/tree/master/LCCUP/2021Spring/LCP35.%E7%94%B5%E5%8A%A8%E8%BD%A6%E6%B8%B8%E5%9F%8E%E5%B8%82
LCP36.最多牌组数https://github.com/wisdompeak/LeetCode/tree/master/LCCUP/2021Spring/LCP36.%E6%9C%80%E5%A4%9A%E7%89%8C%E7%BB%84%E6%95%B0
LCP43.十字路口的交通https://github.com/wisdompeak/LeetCode/tree/master/LCCUP/2021Fall/LCP43.%E5%8D%81%E5%AD%97%E8%B7%AF%E5%8F%A3%E7%9A%84%E4%BA%A4%E9%80%9A
Templateshttps://github.com/wisdompeak/LeetCode/tree/master/Template
https://patch-diff.githubusercontent.com/Nishant763/LeetCode#templates-
Mathhttps://github.com/wisdompeak/LeetCode/tree/master/Template/Math
Binary_Index_Treehttps://github.com/wisdompeak/LeetCode/tree/master/Template/Binary_Index_Tree
Segment Treehttps://github.com/wisdompeak/LeetCode/tree/master/Template/SegmentTree
Inverse_Elementhttps://github.com/wisdompeak/LeetCode/tree/master/Template/Inverse_Element
Graphhttps://github.com/wisdompeak/LeetCode/tree/master/Template/Graph
Bit_Manipulationhttps://github.com/wisdompeak/LeetCode/tree/master/Template/Bit_manipulation
Combination-Numberhttps://github.com/wisdompeak/LeetCode/tree/master/Template/Combination-Number
RB_Treehttps://github.com/wisdompeak/LeetCode/tree/master/Template/RB_Tree
二维子矩阵求和https://github.com/wisdompeak/LeetCode/tree/master/Template/Sub_Rect_Sum_2D
二维差分数组https://github.com/wisdompeak/LeetCode/tree/master/Template/Diff_Array_2D
CPP_LANGhttps://github.com/wisdompeak/LeetCode/tree/master/Template/CPP_LANG
Readme https://patch-diff.githubusercontent.com/Nishant763/LeetCode#readme-ov-file
Please reload this pagehttps://patch-diff.githubusercontent.com/Nishant763/LeetCode
Activityhttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/activity
0 starshttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/stargazers
0 watchinghttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/watchers
0 forkshttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/forks
Report repository https://patch-diff.githubusercontent.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2FNishant763%2FLeetCode&report=Nishant763+%28user%29
Releaseshttps://patch-diff.githubusercontent.com/Nishant763/LeetCode/releases
Packages 0https://patch-diff.githubusercontent.com/users/Nishant763/packages?repo_name=LeetCode
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.