| react-profiling | 0 |
| react-import-map | react,react-dom,react-dom/client,react-dom/profiling,react-is,react/compiler-runtime,react/jsx-dev-runtime,react/jsx-runtime,scheduler@b8488ee2c322 |
| route-pattern | /:user_id/:repository/tree/*name(/*path) |
| route-controller | files |
| route-action | disambiguate |
| fetch-nonce | v2:2838d246-5a7a-f4fe-b442-625c3133160f |
| current-catalog-service-hash | f3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb |
| request-id | 81B2:116930:4521D6:640484:6AFD821B |
| html-safe-nonce | 0e4184e613b9a525cbbd9f4ec557e916c2ad1b5e8b47b5f3746ec18c31f3e0ff |
| visitor-payload | eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiI4MUIyOjExNjkzMDo0NTIxRDY6NjQwNDg0OjZBRkQ4MjFCIiwidmlzaXRvcl9pZCI6IjMyNzkwMDcyNTc5NjU5ODYzMzEiLCJyZWdpb25fZWRnZSI6ImlhZCIsInJlZ2lvbl9yZW5kZXIiOiJpYWQifQ== |
| visitor-hmac | b41daf37755915f241d2c040b7d0fa645b0dccfc91094daa86391043ba97f9f5 |
| hovercard-subject-tag | repository:489562762 |
| github-keyboard-shortcuts | repository,source-code,file-tree,copilot |
| google-site-verification | Apib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I |
| octolytics-url | https://collector.github.com/github/collect |
| analytics-location | ///files/disambiguate |
| fb:app_id | 1401488693436528 |
| apple-itunes-app | app-id=1477376905, app-argument=https://github.com/java4fun/LeetCode-Java-Solutions/tree/master/Hard |
| twitter:image | https://opengraph.githubassets.com/61375bc5661ca1f82266872cf86060a4d7e9a5fcc7b0a44034e3a84efe91db2c/java4fun/LeetCode-Java-Solutions |
| twitter:card | summary_large_image |
| og:image | https://opengraph.githubassets.com/61375bc5661ca1f82266872cf86060a4d7e9a5fcc7b0a44034e3a84efe91db2c/java4fun/LeetCode-Java-Solutions |
| og:image:alt | Solutions to LeetCode Online Judge problems in Java - java4fun/LeetCode-Java-Solutions |
| og:image:width | 1200 |
| og:image:height | 600 |
| og:site_name | GitHub |
| og:type | object |
| hostname | github.com |
| expected-hostname | github.com |
| None | 42d4967e3c8afca51ccac31f419a705af777226a95f025ea73387d87a306b326 |
| turbo-cache-control | no-cache |
| go-import | github.com/java4fun/LeetCode-Java-Solutions git https://github.com/java4fun/LeetCode-Java-Solutions.git |
| octolytics-dimension-user_id | 7391669 |
| octolytics-dimension-user_login | java4fun |
| octolytics-dimension-repository_id | 489562762 |
| octolytics-dimension-repository_nwo | java4fun/LeetCode-Java-Solutions |
| octolytics-dimension-repository_public | true |
| octolytics-dimension-repository_is_fork | true |
| octolytics-dimension-repository_parent_id | 98157751 |
| octolytics-dimension-repository_parent_nwo | varunu28/LeetCode-Java-Solutions |
| octolytics-dimension-repository_network_root_id | 98157751 |
| octolytics-dimension-repository_network_root_nwo | varunu28/LeetCode-Java-Solutions |
| turbo-body-classes | logged-out env-production page-responsive |
| disable-turbo | false |
| browser-stats-url | https://api.github.com/_private/browser/stats |
| browser-errors-url | https://api.github.com/_private/browser/errors |
| release | 2329ceed0bc2c7b7c3b9f5f2db6abfc7b6fc3a50 |
| ui-target | full |
| theme-color | #1e2327 |
| color-scheme | light dark |
| Skip to content | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/tree/master/Hard#start-of-content |
| https://redirect.github.com/ |
| Sign in | https://redirect.github.com/login?return_to=https%3A%2F%2Fgithub.com%2Fjava4fun%2FLeetCode-Java-Solutions%2Ftree%2Fmaster%2FHard |
| GitHubRepository hosting, code review, and collaboration | https://github.com/platform |
| CopilotAI coding agent for tasks, projects, and automated work | https://github.com/features/copilot |
| ActionsCI/CD and automation | https://github.com/features/actions |
| Code QualityQuality analysis, fixes, and enforcement | https://github.com/features/code-quality |
| CodespacesCloud development environments | https://github.com/features/codespaces |
| Code SecurityVulnerability detection and remediation | https://github.com/security/advanced-security/code-security |
| Secret ProtectionSecret scanning and leak prevention | https://github.com/security/advanced-security/secret-protection |
| All Features | https://github.com/features |
| Documentation | https://docs.github.com/en |
| Training | https://learn.github.com/skills |
| Certifications | https://learn.github.com/credentials |
| Build with Copilot | https://github.com/features/ai |
| Customize Copilot | https://docs.github.com/en/copilot/how-tos/copilot-on-github/customize-copilot/customize-copilot-overview |
| Integrations | https://github.com/marketplace |
| Trending repos | https://github.com/trending |
| GitHub Sponsors | https://github.com/open-source/sponsors |
| Developer articles | https://github.com/resources/articles |
| ChangelogYour source for the latest features, improvements, and fixes across GitHub products, all in one place. | https://github.blog/changelog/ |
| Enterprises | https://github.com/enterprise |
| Team | https://github.com/team |
| Startups | https://github.com/enterprise/startups |
| Nonprofits | https://github.com/solutions/industry/nonprofits |
| Healthcare | https://github.com/solutions/industry/healthcare |
| Financial services | https://github.com/solutions/industry/financial-services |
| Manufacturing | https://github.com/solutions/industry/manufacturing |
| Government | https://github.com/solutions/industry/government |
| See all industries | https://github.com/solutions/industry |
| Why GitHub | https://github.com/why-github |
| Customer Stories | https://github.com/customer-stories |
| Business insights | https://github.com/solutions/executive-insights |
| Trust Center | https://github.com/trust-center |
| GitHub Advanced SecurityEnterprise-grade code security | https://github.com/security/advanced-security |
| Copilot for businessEnterprise-grade AI features | https://github.com/features/copilot/copilot-business |
| Premium SupportEnterprise-grade 24/7 support | https://github.com/enterprise/premium-support |
| Documentation | https://docs.github.com/en |
| Resource center | https://github.com/resources |
| Blog | https://github.blog/ |
| Events & webinars | https://github.com/resources/events |
| Community Forum | https://github.com/orgs/community/discussions |
| Customer Stories | https://github.com/customer-stories |
| Integrations | https://github.com/marketplace |
| Customer support | https://help.github.com/ |
| Training | https://learn.github.com/skills |
| GitHub Status | https://www.githubstatus.com/ |
| About | https://github.com/about |
| Partners | https://github.com/partners |
| Changelog | https://github.blog/changelog/ |
| GitHub UniverseThe event for developers, by developers — talks, workshops, and what’s next for GitHub. | https://githubuniverse.com/ |
| Pricing | https://github.com/pricing |
| Sign in | https://redirect.github.com/login?return_to=https%3A%2F%2Fgithub.com%2Fjava4fun%2FLeetCode-Java-Solutions%2Ftree%2Fmaster%2FHard |
| Sign up | https://redirect.github.com/signup?ref_cta=Sign+up&ref_loc=header+logged+out&ref_page=%2F%3Cuser-name%3E%2F%3Crepo-name%3E%2Ffiles%2Fdisambiguate&source=header-repo&source_repo=java4fun%2FLeetCode-Java-Solutions |
| Reload | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/tree/master/Hard |
| Reload | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/tree/master/Hard |
| Reload | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/tree/master/Hard |
| java4fun | https://redirect.github.com/java4fun |
| LeetCode-Java-Solutions | https://redirect.github.com/java4fun/LeetCode-Java-Solutions |
| Code | https://redirect.github.com/java4fun/LeetCode-Java-Solutions |
| Pull requests | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/pulls |
| Actions | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/actions |
| Projects | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/projects |
| Security and quality | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/security |
| Insights | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/pulse |
| https://redirect.github.com/java4fun/LeetCode-Java-Solutions |
| LeetCode-Java-Solutions | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/tree/master |
| History | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/commits/master/Hard |
| https://redirect.github.com/java4fun/LeetCode-Java-Solutions/commits/master/Hard |
| LeetCode-Java-Solutions | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/tree/master |
| .. | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/tree/master |
| Basic Calculator III.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Basic%20Calculator%20III.java |
| Basic Calculator III.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Basic%20Calculator%20III.java |
| Basic Calculator.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Basic%20Calculator.java |
| Basic Calculator.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Basic%20Calculator.java |
| Binary Tree Maximum Path Sum.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Binary%20Tree%20Maximum%20Path%20Sum.java |
| Binary Tree Maximum Path Sum.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Binary%20Tree%20Maximum%20Path%20Sum.java |
| Binary Tree PostOrder Traversal.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Binary%20Tree%20PostOrder%20Traversal.java |
| Binary Tree PostOrder Traversal.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Binary%20Tree%20PostOrder%20Traversal.java |
| Candy.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Candy.java |
| Candy.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Candy.java |
| Closest Binary Search Tree Values II.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Closest%20Binary%20Search%20Tree%20Values%20II.java |
| Closest Binary Search Tree Values II.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Closest%20Binary%20Search%20Tree%20Values%20II.java |
| Concatenated Words.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Concatenated%20Words.java |
| Concatenated Words.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Concatenated%20Words.java |
| Cut Off Trees for Golf Event.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Cut%20Off%20Trees%20for%20Golf%20Event.java |
| Cut Off Trees for Golf Event.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Cut%20Off%20Trees%20for%20Golf%20Event.java |
| Design In-Memory File System.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Design%20In-Memory%20File%20System.java |
| Design In-Memory File System.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Design%20In-Memory%20File%20System.java |
| Design Movie Rental System.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Design%20Movie%20Rental%20System.java |
| Design Movie Rental System.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Design%20Movie%20Rental%20System.java |
| Design Search Autocomplete System.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Design%20Search%20Autocomplete%20System.java |
| Design Search Autocomplete System.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Design%20Search%20Autocomplete%20System.java |
| Divide Array Into Increasing Sequences.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Divide%20Array%20Into%20Increasing%20Sequences.java |
| Divide Array Into Increasing Sequences.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Divide%20Array%20Into%20Increasing%20Sequences.java |
| Edit Distance.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Edit%20Distance.java |
| Edit Distance.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Edit%20Distance.java |
| Employee Free Time.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Employee%20Free%20Time.java |
| Employee Free Time.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Employee%20Free%20Time.java |
| Find Median From Data Stream.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Find%20Median%20From%20Data%20Stream.java |
| Find Median From Data Stream.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Find%20Median%20From%20Data%20Stream.java |
| Find Minimum in Rotated Sorted Array II.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Find%20Minimum%20in%20Rotated%20Sorted%20Array%20II.java |
| Find Minimum in Rotated Sorted Array II.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Find%20Minimum%20in%20Rotated%20Sorted%20Array%20II.java |
| First Missing Positive.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/First%20Missing%20Positive.java |
| First Missing Positive.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/First%20Missing%20Positive.java |
| Frog Jump.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Frog%20Jump.java |
| Frog Jump.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Frog%20Jump.java |
| Hard.md | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Hard.md |
| Hard.md | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Hard.md |
| Insert Delete GetRandom O(1) - Duplicates Allowed.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Insert%20Delete%20GetRandom%20O(1)%20-%20Duplicates%20Allowed.java |
| Insert Delete GetRandom O(1) - Duplicates Allowed.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Insert%20Delete%20GetRandom%20O(1)%20-%20Duplicates%20Allowed.java |
| Insert Interval.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Insert%20Interval.java |
| Insert Interval.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Insert%20Interval.java |
| Integer to English Words.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Integer%20to%20English%20Words.java |
| Integer to English Words.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Integer%20to%20English%20Words.java |
| Interleaving String.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Interleaving%20String.java |
| Interleaving String.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Interleaving%20String.java |
| K Empty Slots.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/K%20Empty%20Slots.java |
| K Empty Slots.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/K%20Empty%20Slots.java |
| Kth Smallest Number in Multiplication Table.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Kth%20Smallest%20Number%20in%20Multiplication%20Table.java |
| Kth Smallest Number in Multiplication Table.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Kth%20Smallest%20Number%20in%20Multiplication%20Table.java |
| LFU Cache.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/LFU%20Cache.java |
| LFU Cache.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/LFU%20Cache.java |
| Largest Rectangle in Histogram.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Largest%20Rectangle%20in%20Histogram.java |
| Largest Rectangle in Histogram.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Largest%20Rectangle%20in%20Histogram.java |
| Longest Increasing Path in a Matrix.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Longest%20Increasing%20Path%20in%20a%20Matrix.java |
| Longest Increasing Path in a Matrix.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Longest%20Increasing%20Path%20in%20a%20Matrix.java |
| Longest Palindrome Product.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Longest%20Palindrome%20Product.java |
| Longest Palindrome Product.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Longest%20Palindrome%20Product.java |
| Maximum Frequency Stack.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Maximum%20Frequency%20Stack.java |
| Maximum Frequency Stack.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Maximum%20Frequency%20Stack.java |
| Maximum Number of Non-Overlapping Substrings.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Maximum%20Number%20of%20Non-Overlapping%20Substrings.java |
| Maximum Number of Non-Overlapping Substrings.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Maximum%20Number%20of%20Non-Overlapping%20Substrings.java |
| Maximum Sum BST in Binary Tree.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Maximum%20Sum%20BST%20in%20Binary%20Tree.java |
| Maximum Sum BST in Binary Tree.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Maximum%20Sum%20BST%20in%20Binary%20Tree.java |
| Median of Two Sorted Arrays.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Median%20of%20Two%20Sorted%20Arrays.java |
| Median of Two Sorted Arrays.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Median%20of%20Two%20Sorted%20Arrays.java |
| Merge K Sorted Lists.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Merge%20K%20Sorted%20Lists.java |
| Merge K Sorted Lists.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Merge%20K%20Sorted%20Lists.java |
| Minimize Deviation in Array.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Minimize%20Deviation%20in%20Array.java |
| Minimize Deviation in Array.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Minimize%20Deviation%20in%20Array.java |
| Minimum Cost to Hire K Workers.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Minimum%20Cost%20to%20Hire%20K%20Workers.java |
| Minimum Cost to Hire K Workers.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Minimum%20Cost%20to%20Hire%20K%20Workers.java |
| Minimum Window Substring.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Minimum%20Window%20Substring.java |
| Minimum Window Substring.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Minimum%20Window%20Substring.java |
| N-Queens.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/N-Queens.java |
| N-Queens.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/N-Queens.java |
| Number of Paths with Max Score.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Number%20of%20Paths%20with%20Max%20Score.java |
| Number of Paths with Max Score.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Number%20of%20Paths%20with%20Max%20Score.java |
| Number of Squareful Arrays.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Number%20of%20Squareful%20Arrays.java |
| Number of Squareful Arrays.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Number%20of%20Squareful%20Arrays.java |
| Number of Submatrices That Sum to Target.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Number%20of%20Submatrices%20That%20Sum%20to%20Target.java |
| Number of Submatrices That Sum to Target.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Number%20of%20Submatrices%20That%20Sum%20to%20Target.java |
| Number of Valid Subarrays.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Number%20of%20Valid%20Subarrays.java |
| Number of Valid Subarrays.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Number%20of%20Valid%20Subarrays.java |
| Odd Even Jump.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Odd%20Even%20Jump.java |
| Odd Even Jump.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Odd%20Even%20Jump.java |
| Optimal Account Balancing.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Optimal%20Account%20Balancing.java |
| Optimal Account Balancing.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Optimal%20Account%20Balancing.java |
| Palindrome Pairs.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Palindrome%20Pairs.java |
| Palindrome Pairs.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Palindrome%20Pairs.java |
| Parsing A Boolean Expression.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Parsing%20A%20Boolean%20Expression.java |
| Parsing A Boolean Expression.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Parsing%20A%20Boolean%20Expression.java |
| Prefix and Suffix Search.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Prefix%20and%20Suffix%20Search.java |
| Prefix and Suffix Search.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Prefix%20and%20Suffix%20Search.java |
| README.md | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/README.md |
| README.md | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/README.md |
| Reconstruct Itinerary.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Reconstruct%20Itinerary.java |
| Reconstruct Itinerary.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Reconstruct%20Itinerary.java |
| Recover a Tree From Preorder Traversal.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Recover%20a%20Tree%20From%20Preorder%20Traversal.java |
| Recover a Tree From Preorder Traversal.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Recover%20a%20Tree%20From%20Preorder%20Traversal.java |
| Remove Invalid Parentheses.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Remove%20Invalid%20Parentheses.java |
| Remove Invalid Parentheses.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Remove%20Invalid%20Parentheses.java |
| Reverse Nodes in k-Group.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Reverse%20Nodes%20in%20k-Group.java |
| Reverse Nodes in k-Group.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Reverse%20Nodes%20in%20k-Group.java |
| Robot Room Cleaner.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Robot%20Room%20Cleaner.java |
| Robot Room Cleaner.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Robot%20Room%20Cleaner.java |
| Serialize and Deserialize N-ary Tree.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Serialize%20and%20Deserialize%20N-ary%20Tree.java |
| Serialize and Deserialize N-ary Tree.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Serialize%20and%20Deserialize%20N-ary%20Tree.java |
| Serialize and Deserialize a Binary Tree.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Serialize%20and%20Deserialize%20a%20Binary%20Tree.java |
| Serialize and Deserialize a Binary Tree.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Serialize%20and%20Deserialize%20a%20Binary%20Tree.java |
| Shortest Distance from All Buildings.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Shortest%20Distance%20from%20All%20Buildings.java |
| Shortest Distance from All Buildings.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Shortest%20Distance%20from%20All%20Buildings.java |
| Sliding Window Maximum.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Sliding%20Window%20Maximum.java |
| Sliding Window Maximum.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Sliding%20Window%20Maximum.java |
| Sliding Window Median.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Sliding%20Window%20Median.java |
| Sliding Window Median.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Sliding%20Window%20Median.java |
| Stream of Characters.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Stream%20of%20Characters.java |
| Stream of Characters.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Stream%20of%20Characters.java |
| Subarrays with K Different Integers.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Subarrays%20with%20K%20Different%20Integers.java |
| Subarrays with K Different Integers.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Subarrays%20with%20K%20Different%20Integers.java |
| Substring with Concatenation of All Words.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Substring%20with%20Concatenation%20of%20All%20Words.java |
| Substring with Concatenation of All Words.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Substring%20with%20Concatenation%20of%20All%20Words.java |
| Text Justification.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Text%20Justification.java |
| Text Justification.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Text%20Justification.java |
| Trapping Rain Water.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Trapping%20Rain%20Water.java |
| Trapping Rain Water.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Trapping%20Rain%20Water.java |
| Unique Paths III.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Unique%20Paths%20III.java |
| Unique Paths III.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Unique%20Paths%20III.java |
| Valid Number.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Valid%20Number.java |
| Valid Number.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Valid%20Number.java |
| Vertical Order Traversal Of a Binary Tree.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Vertical%20Order%20Traversal%20Of%20a%20Binary%20Tree.java |
| Vertical Order Traversal Of a Binary Tree.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Vertical%20Order%20Traversal%20Of%20a%20Binary%20Tree.java |
| Word Break II.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Word%20Break%20II.java |
| Word Break II.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Word%20Break%20II.java |
| Word Search II.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Word%20Search%20II.java |
| Word Search II.java | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/blob/master/Hard/Word%20Search%20II.java |
| README.md | https://redirect.github.com/java4fun/LeetCode-Java-Solutions/tree/master/Hard#readme |
| https://redirect.github.com/java4fun/LeetCode-Java-Solutions/tree/master/Hard#hard-leetcode-java-solutions |
| Concatenated Words | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Concatenated%20Words.java |
| Remove Invalid Parentheses | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Remove%20Invalid%20Parentheses.java |
| First Missing Positive | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/First%20Missing%20Positive.java |
| Frog Jump | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Frog%20Jump.java |
| Sliding Window Median | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Sliding%20Window%20Median.java |
| Edit Distance | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Edit%20Distance.java |
| Merge K Sorted Lists | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Merge%20K%20Sorted%20Lists.java |
| Sliding Window Maximum | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Sliding%20Window%20Maximum.java |
| Text Justification | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Text%20Justification.java |
| Basic Calculator III | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Basic%20Calculator%20III.java |
| Insert Interval | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Insert%20Interval.java |
| Integer to English Words | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Integer%20to%20English%20Words.java |
| Median of Two Sorted Arrays | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Median%20of%20Two%20Sorted%20Arrays.java |
| Divide Array Into Increasing Sequences | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Divide%20Array%20Into%20Increasing%20Sequences.java |
| Word Break II | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Word%20Break%20II.java |
| Maximum Number of Non-Overlapping Substrings | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Maximum%20Number%20of%20Non-Overlapping%20Substrings.java |
| Subarrays with K Different Integers | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Subarrays%20with%20K%20Different%20Integers.java |
| Parallel Courses | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Parallel%20Courses.java |
| LFU Cache | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/LFU%20Cache.java |
| Word Search II | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Word%20Search%20II.java |
| K Empty Slots | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/K%20Empty%20Slots.java |
| Employee Free Time | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Employee%20Free%20Time.java |
| N-Queens | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/N-Queens.java |
| Longest Palindrome Product | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Longest%20Palindrome%20Product.java |
| Odd Even Jump | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Odd%20Even%20Jump.java |
| Palindrome Pairs | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Palindrome%20Pairs.java |
| Stream of Characters | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Stream%20of%20Characters.java |
| Cut Off Trees for Golf Event | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Cut%20Off%20Trees%20for%20Golf%20Event.java |
| Minimize Deviation in Array | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Minimize%20Deviation%20in%20Array.java |
| Minimum Cost to Hire K Workers | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Minimum%20Cost%20to%20Hire%20K%20Workers.java |
| Number of Valid Subarrays | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Number%20of%20Valid%20Subarrays.java |
| Substring with Concatenation of All Words | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Substring%20with%20Concatenation%20of%20All%20Words.java |
| Number of Paths with Max Score | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Number%20of%20Paths%20with%20Max%20Score.java |
| Design Search Autocomplete System | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Design%20Search%20Autocomplete%20System.java |
| LRU Cache | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/LRU%20Cache.java |
| Number of Squareful Arrays | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Number%20of%20Squareful%20Arrays.java |
| Robot Room Cleaner | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Robot%20Room%20Cleaner.java |
| Minimum Window Substring | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Minimum%20Window%20Substring.java |
| Hard | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Hard.md |
| Parsing A Boolean Expression | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Parsing%20A%20Boolean%20Expression.java |
| Trapping Rain Water | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Trapping%20Rain%20Water.java |
| Optimal Account Balancing | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Optimal%20Account%20Balancing.java |
| Find Median From Data Stream | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Find%20Median%20From%20Data%20Stream.java |
| Find Minimum in Rotated Sorted Array II | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Find%20Minimum%20in%20Rotated%20Sorted%20Array%20II.java |
| Longest Substring with At Most Two Distinct Characters | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Longest%20Substring%20with%20At%20Most%20Two%20Distinct%20Characters.java |
| Number of Submatrices That Sum to Target | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Number%20of%20Submatrices%20That%20Sum%20to%20Target.java |
| Candy | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Candy.java |
| Shortest Distance from All Buildings | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Shortest%20Distance%20from%20All%20Buildings.java |
| Recover a Tree From Preorder Traversal | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Recover%20a%20Tree%20From%20Preorder%20Traversal.java |
| Longest Increasing Path in a Matrix | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Longest%20Increasing%20Path%20in%20a%20Matrix.java |
| Interleaving String | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Interleaving%20String.java |
| Closest Binary Search Tree Values II | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Closest%20Binary%20Search%20Tree%20Values%20II.java |
| Basic Calculator | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Basic%20Calculator.java |
| Prefix and Suffix Search | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Prefix%20and%20Suffix%20Search.java |
| Valid Number | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Valid%20Number.java |
| Maximum Frequency Stack | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Maximum%20Frequency%20Stack.java |
| Reverse Nodes in k-Group | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Reverse%20Nodes%20in%20k-Group.java |
| Longest Substring with At Most K Distinct Characters | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Longest%20Substring%20with%20At%20Most%20K%20Distinct%20Characters.java |
| Serialize and Deserialize N-ary Tree | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Serialize%20and%20Deserialize%20N-ary%20Tree.java |
| Serialize and Deserialize a Binary Tree | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Serialize%20and%20Deserialize%20a%20Binary%20Tree.java |
| Binary Tree PostOrder Traversal | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Binary%20Tree%20PostOrder%20Traversal.java |
| Unique Paths III | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Unique%20Paths%20III.java |
| Insert Delete GetRandom O(1) - Duplicates Allowed | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Insert%20Delete%20GetRandom%20O(1)%20-%20Duplicates%20Allowed.java |
| Maximum Sum BST in Binary Tree | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Maximum%20Sum%20BST%20in%20Binary%20Tree.java |
| Binary Tree Maximum Path Sum | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Binary%20Tree%20Maximum%20Path%20Sum.java |
| Largest Rectangle in Histogram | https://github.com/varunu28/LeetCode-Java-Solutions/tree/master/Hard/Largest%20Rectangle%20in%20Histogram.java |
|
| https://github.com |
| Terms | https://docs.github.com/site-policy/github-terms/github-terms-of-service |
| Privacy | https://docs.github.com/site-policy/privacy-policies/github-privacy-statement |
| Security | https://github.com/security |
| Status | https://www.githubstatus.com/ |
| Community | https://github.community/ |
| Docs | https://docs.github.com/ |
| Contact | https://support.github.com?tags=dotcom-footer |