Skip to content
Navigation Menu
Sign in
Appearance settings
Platform
AI CODE CREATION
GitHub Copilot
Write better code with AI
GitHub Copilot app
Direct agents from issue to merge
MCP Registry
Integrate external tools
DEVELOPER WORKFLOWS
Actions
Automate any workflow
Codespaces
Instant dev environments
Issues
Plan and track work
Code Review
Manage code changes
Code Quality
Enforce quality at merge
APPLICATION SECURITY
GitHub Advanced Security
Find and fix vulnerabilities
Code security
Secure your code as you build
Secret protection
Stop leaks before they start
EXPLORE
Why GitHub
Documentation
Blog
Changelog
Marketplace
View all features
Solutions
BY COMPANY SIZE
Enterprises
Small and medium teams
Startups
Nonprofits
BY USE CASE
App Modernization
DevSecOps
DevOps
CI/CD
View all use cases
BY INDUSTRY
Healthcare
Financial services
Manufacturing
Government
View all industries
View all solutions
Resources
EXPLORE BY TOPIC
AI
Software Development
DevOps
Security
View all topics
EXPLORE BY TYPE
Customer stories
Events & webinars
Ebooks & reports
Business insights
GitHub Skills
SUPPORT & SERVICES
Documentation
Customer support
Community forum
Trust center
Partners
View all resources
Open Source
COMMUNITY
GitHub Sponsors
Fund open source developers
PROGRAMS
Security Lab
Maintainer Community
Accelerator
GitHub Stars
Archive Program
REPOSITORIES
Topics
Trending
Collections
Enterprise
ENTERPRISE SOLUTIONS
Enterprise platform
AI-powered developer platform
AVAILABLE ADD-ONS
GitHub Advanced Security
Enterprise-grade security features
Copilot for Business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
Pricing
Search
/
Sign in
Sign up
Appearance settings
You signed in with another tab or window.
Reload
to refresh your session.
You signed out in another tab or window.
Reload
to refresh your session.
You switched accounts on another tab or window.
Reload
to refresh your session.
Dismiss alert
{{ message }}
amogh-nagar
/
Leetcode-Questions
Public
Notifications
You must be signed in to change notification settings
Fork
0
Star
2
Code
Issues
0
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
main
Branches
Tags
Go to file
Code
Open more actions menu
Folders and files
Name
Name
Last commit message
Last commit date
Latest commit
History
1,412 Commits
1,412 Commits
1004-max-consecutive-ones-iii
1004-max-consecutive-ones-iii
1007-minimum-domino-rotations-for-equal-row
1007-minimum-domino-rotations-for-equal-row
1009-complement-of-base-10-integer
1009-complement-of-base-10-integer
1014-best-sightseeing-pair
1014-best-sightseeing-pair
1019-next-greater-node-in-linked-list
1019-next-greater-node-in-linked-list
1022-sum-of-root-to-leaf-binary-numbers
1022-sum-of-root-to-leaf-binary-numbers
1025-divisor-game
1025-divisor-game
1027-longest-arithmetic-subsequence
1027-longest-arithmetic-subsequence
1029-two-city-scheduling
1029-two-city-scheduling
1039-minimum-score-triangulation-of-polygon
1039-minimum-score-triangulation-of-polygon
104-maximum-depth-of-binary-tree
104-maximum-depth-of-binary-tree
1041-robot-bounded-in-circle
1041-robot-bounded-in-circle
1043-partition-array-for-maximum-sum
1043-partition-array-for-maximum-sum
1046-last-stone-weight
1046-last-stone-weight
1048-longest-string-chain
1048-longest-string-chain
1049-last-stone-weight-ii
1049-last-stone-weight-ii
1072-flip-columns-for-maximum-number-of-equal-rows
1072-flip-columns-for-maximum-number-of-equal-rows
1091-shortest-path-in-binary-matrix
1091-shortest-path-in-binary-matrix
1092-shortest-common-supersequence
1092-shortest-common-supersequence
1094-car-pooling
1094-car-pooling
1109-corporate-flight-bookings
1109-corporate-flight-bookings
114-flatten-binary-tree-to-linked-list
114-flatten-binary-tree-to-linked-list
1143-longest-common-subsequence
1143-longest-common-subsequence
115-distinct-subsequences
115-distinct-subsequences
1162-as-far-from-land-as-possible
1162-as-far-from-land-as-possible
117-populating-next-right-pointers-in-each-node-ii
117-populating-next-right-pointers-in-each-node-ii
1170-compare-strings-by-frequency-of-the-smallest-character
1170-compare-strings-by-frequency-of-the-smallest-character
118-pascals-triangle
118-pascals-triangle
119-pascals-triangle-ii
119-pascals-triangle-ii
1192-critical-connections-in-a-network
1192-critical-connections-in-a-network
120-triangle
120-triangle
1202-smallest-string-with-swaps
1202-smallest-string-with-swaps
1209-remove-all-adjacent-duplicates-in-string-ii
1209-remove-all-adjacent-duplicates-in-string-ii
121-best-time-to-buy-and-sell-stock
121-best-time-to-buy-and-sell-stock
1219-path-with-maximum-gold
1219-path-with-maximum-gold
122-best-time-to-buy-and-sell-stock-ii
122-best-time-to-buy-and-sell-stock-ii
124-binary-tree-maximum-path-sum
124-binary-tree-maximum-path-sum
1248-count-number-of-nice-subarrays
1248-count-number-of-nice-subarrays
1249-minimum-remove-to-make-valid-parentheses
1249-minimum-remove-to-make-valid-parentheses
127-word-ladder
127-word-ladder
1283-find-the-smallest-divisor-given-a-threshold
1283-find-the-smallest-divisor-given-a-threshold
1288-remove-covered-intervals
1288-remove-covered-intervals
1291-sequential-digits
1291-sequential-digits
1292-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold
1292-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold
130-surrounded-regions
130-surrounded-regions
1300-sum-of-mutated-array-closest-to-target
1300-sum-of-mutated-array-closest-to-target
1302-deepest-leaves-sum
1302-deepest-leaves-sum
1305-all-elements-in-two-binary-search-trees
1305-all-elements-in-two-binary-search-trees
131-palindrome-partitioning
131-palindrome-partitioning
1310-xor-queries-of-a-subarray
1310-xor-queries-of-a-subarray
1312-minimum-insertion-steps-to-make-a-string-palindrome
1312-minimum-insertion-steps-to-make-a-string-palindrome
1318-minimum-flips-to-make-a-or-b-equal-to-c
1318-minimum-flips-to-make-a-or-b-equal-to-c
132-palindrome-partitioning-ii
132-palindrome-partitioning-ii
133-clone-graph
133-clone-graph
1332-remove-palindromic-subsequences
1332-remove-palindromic-subsequences
1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
1337-the-k-weakest-rows-in-a-matrix
1337-the-k-weakest-rows-in-a-matrix
1338-reduce-array-size-to-the-half
1338-reduce-array-size-to-the-half
134-gas-station
134-gas-station
1342-number-of-steps-to-reduce-a-number-to-zero
1342-number-of-steps-to-reduce-a-number-to-zero
1345-jump-game-iv
1345-jump-game-iv
1359-count-all-valid-pickup-and-delivery-options
1359-count-all-valid-pickup-and-delivery-options
136-single-number
136-single-number
137-single-number-ii
137-single-number-ii
1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree
1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree
138-copy-list-with-random-pointer
138-copy-list-with-random-pointer
1381-design-a-stack-with-increment-operation
1381-design-a-stack-with-increment-operation
139-word-break
139-word-break
1395-count-number-of-teams
1395-count-number-of-teams
1396-design-underground-system
1396-design-underground-system
1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one
1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one
141-linked-list-cycle
141-linked-list-cycle
1414-find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k
1414-find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k
142-linked-list-cycle-ii
142-linked-list-cycle-ii
1423-maximum-points-you-can-obtain-from-cards
1423-maximum-points-you-can-obtain-from-cards
1433-check-if-a-string-can-break-another-string
1433-check-if-a-string-can-break-another-string
1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit
1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit
1441-build-an-array-with-stack-operations
1441-build-an-array-with-stack-operations
1442-count-triplets-that-can-form-two-arrays-of-equal-xor
1442-count-triplets-that-can-form-two-arrays-of-equal-xor
1447-simplified-fractions
1447-simplified-fractions
1456-maximum-number-of-vowels-in-a-substring-of-given-length
1456-maximum-number-of-vowels-in-a-substring-of-given-length
146-lru-cache
146-lru-cache
1461-check-if-a-string-contains-all-binary-codes-of-size-k
1461-check-if-a-string-contains-all-binary-codes-of-size-k
1463-cherry-pickup-ii
1463-cherry-pickup-ii
1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero
1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero
1471-the-k-strongest-values-in-an-array
1471-the-k-strongest-values-in-an-array
1477-find-two-non-overlapping-sub-arrays-each-with-target-sum
1477-find-two-non-overlapping-sub-arrays-each-with-target-sum
148-sort-list
148-sort-list
1480-running-sum-of-1d-array
1480-running-sum-of-1d-array
1510-stone-game-iv
1510-stone-game-iv
1514-path-with-maximum-probability
1514-path-with-maximum-probability
152-maximum-product-subarray
152-maximum-product-subarray
1524-number-of-sub-arrays-with-odd-sum
1524-number-of-sub-arrays-with-odd-sum
1525-number-of-good-ways-to-split-a-string
1525-number-of-good-ways-to-split-a-string
153-find-minimum-in-rotated-sorted-array
153-find-minimum-in-rotated-sorted-array
1541-minimum-insertions-to-balance-a-parentheses-string
1541-minimum-insertions-to-balance-a-parentheses-string
155-min-stack
155-min-stack
1552-magnetic-force-between-two-balls
1552-magnetic-force-between-two-balls
1557-minimum-number-of-vertices-to-reach-all-nodes
1557-minimum-number-of-vertices-to-reach-all-nodes
1584-min-cost-to-connect-all-points
1584-min-cost-to-connect-all-points
View all files
Repository files navigation
README
More
items
Leetcode-Questions
Leetcode problems
About
Leetcode problems
Resources
Readme
Activity
Stars
2
stars
Watchers
1
watching
Forks
0
forks
Report repository
Releases
Packages
Used by
Contributors
Languages
You can’t perform that action at this time.