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
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 }}
Uh oh!
There was an error while loading.
Please reload this page
.
AlgorithmAndLeetCode
/
hqztrue-LeetCodeSolutions
Public
forked from
hqztrue/LeetCodeSolutions
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Files
Expand file tree
master
Breadcrumbs
hqztrue-LeetCodeSolutions
/
1701-1800
/
Copy path
Directory actions
More options
More options
Directory actions
More options
More options
Latest commit
History
History
History
master
Breadcrumbs
hqztrue-LeetCodeSolutions
/
1701-1800
/
Copy path
Top
Folders and files
Name
Name
Last commit message
Last commit date
parent directory
..
1701. Average Waiting Time.txt
1701. Average Waiting Time.txt
1702. Maximum Binary String After Change.txt
1702. Maximum Binary String After Change.txt
1703. Minimum Adjacent Swaps for K Consecutive Ones.txt
1703. Minimum Adjacent Swaps for K Consecutive Ones.txt
1704. Determine if String Halves Are Alike.txt
1704. Determine if String Halves Are Alike.txt
1705. Maximum Number of Eaten Apples 44ms.cpp
1705. Maximum Number of Eaten Apples 44ms.cpp
1705. Maximum Number of Eaten Apples.pdf
1705. Maximum Number of Eaten Apples.pdf
1706. Where Will the Ball Fall.txt
1706. Where Will the Ball Fall.txt
1707. Maximum XOR With an Element From Array 424ms.cpp
1707. Maximum XOR With an Element From Array 424ms.cpp
1707. Maximum XOR With an Element From Array.pdf
1707. Maximum XOR With an Element From Array.pdf
1708. Largest Subarray Length K.txt
1708. Largest Subarray Length K.txt
1710. Maximum Units on a Truck.txt
1710. Maximum Units on a Truck.txt
1711. Count Good Meals 108ms.cpp
1711. Count Good Meals 108ms.cpp
1711. Count Good Meals.pdf
1711. Count Good Meals.pdf
1712. Ways to Split Array Into Three Subarrays.txt
1712. Ways to Split Array Into Three Subarrays.txt
1713. Minimum Operations to Make a Subsequence 224ms.cpp
1713. Minimum Operations to Make a Subsequence 224ms.cpp
1713. Minimum Operations to Make a Subsequence.pdf
1713. Minimum Operations to Make a Subsequence.pdf
1714. Sum Of Special Evenly-Spaced Elements In Array 412ms_avx.cpp
1714. Sum Of Special Evenly-Spaced Elements In Array 412ms_avx.cpp
1714. Sum Of Special Evenly-Spaced Elements In Array.pdf
1714. Sum Of Special Evenly-Spaced Elements In Array.pdf
1716. Calculate Money in Leetcode Bank.txt
1716. Calculate Money in Leetcode Bank.txt
1717. Maximum Score From Removing Substrings.txt
1717. Maximum Score From Removing Substrings.txt
1718. Construct the Lexicographically Largest Valid Sequence.txt
1718. Construct the Lexicographically Largest Valid Sequence.txt
1719. Number Of Ways To Reconstruct A Tree.txt
1719. Number Of Ways To Reconstruct A Tree.txt
1720. Decode XORed Array.txt
1720. Decode XORed Array.txt
1721. Swapping Nodes in a Linked List.txt
1721. Swapping Nodes in a Linked List.txt
1722. Minimize Hamming Distance After Swap Operations.txt
1722. Minimize Hamming Distance After Swap Operations.txt
1723. Find Minimum Time to Finish All Jobs.pdf
1723. Find Minimum Time to Finish All Jobs.pdf
1724. Checking Existence of Edge Length Limited Paths II.txt
1724. Checking Existence of Edge Length Limited Paths II.txt
1725. Number Of Rectangles That Can Form The Largest Square.txt
1725. Number Of Rectangles That Can Form The Largest Square.txt
1726. Tuple with Same Product 64ms_array.cpp
1726. Tuple with Same Product 64ms_array.cpp
1726. Tuple with Same Product 68ms.cpp
1726. Tuple with Same Product 68ms.cpp
1726. Tuple with Same Product.pdf
1726. Tuple with Same Product.pdf
1727. Largest Submatrix With Rearrangements.txt
1727. Largest Submatrix With Rearrangements.txt
1728. Cat and Mouse II.txt
1728. Cat and Mouse II.txt
1730. Shortest Path to Get Food.txt
1730. Shortest Path to Get Food.txt
1732. Find the Highest Altitude.txt
1732. Find the Highest Altitude.txt
1733. Minimum Number of People to Teach.txt
1733. Minimum Number of People to Teach.txt
1734. Decode XORed Permutation.txt
1734. Decode XORed Permutation.txt
1735. Count Ways to Make Array With Product.pdf
1735. Count Ways to Make Array With Product.pdf
1736. Latest Time by Replacing Hidden Digits.txt
1736. Latest Time by Replacing Hidden Digits.txt
1737. Change Minimum Characters to Satisfy One of Three Conditions.txt
1737. Change Minimum Characters to Satisfy One of Three Conditions.txt
1738. Find Kth Largest XOR Coordinate Value.txt
1738. Find Kth Largest XOR Coordinate Value.txt
1739. Building Boxes.txt
1739. Building Boxes.txt
1740. Find Distance in a Binary Tree.txt
1740. Find Distance in a Binary Tree.txt
1742. Maximum Number of Balls in a Box.txt
1742. Maximum Number of Balls in a Box.txt
1743. Restore the Array From Adjacent Pairs.txt
1743. Restore the Array From Adjacent Pairs.txt
1744. Can You Eat Your Favorite Candy on Your Favorite Day.txt
1744. Can You Eat Your Favorite Candy on Your Favorite Day.txt
1745. Palindrome Partitioning IV 12ms.cpp
1745. Palindrome Partitioning IV 12ms.cpp
1745. Palindrome Partitioning IV.txt
1745. Palindrome Partitioning IV.txt
1746. Maximum Subarray Sum After One Operation.txt
1746. Maximum Subarray Sum After One Operation.txt
1748. Sum of Unique Elements.txt
1748. Sum of Unique Elements.txt
1749. Maximum Absolute Sum of Any Subarray.txt
1749. Maximum Absolute Sum of Any Subarray.txt
1750. Minimum Length of String After Deleting Similar Ends.txt
1750. Minimum Length of String After Deleting Similar Ends.txt
1751. Maximum Number of Events That Can Be Attended II.txt
1751. Maximum Number of Events That Can Be Attended II.txt
1752. Check if Array Is Sorted and Rotated.txt
1752. Check if Array Is Sorted and Rotated.txt
1753. Maximum Score From Removing Stones.txt
1753. Maximum Score From Removing Stones.txt
1754. Largest Merge Of Two Strings.txt
1754. Largest Merge Of Two Strings.txt
1755. Closest Subsequence Sum.txt
1755. Closest Subsequence Sum.txt
1756. Design Most Recently Used Queue.txt
1756. Design Most Recently Used Queue.txt
1758. Minimum Changes To Make Alternating Binary String.txt
1758. Minimum Changes To Make Alternating Binary String.txt
1759. Count Number of Homogenous Substrings.txt
1759. Count Number of Homogenous Substrings.txt
1760. Minimum Limit of Balls in a Bag 48ms_sampling.cpp
1760. Minimum Limit of Balls in a Bag 48ms_sampling.cpp
1760. Minimum Limit of Balls in a Bag 60ms.cpp
1760. Minimum Limit of Balls in a Bag 60ms.cpp
1760. Minimum Limit of Balls in a Bag.pdf
1760. Minimum Limit of Balls in a Bag.pdf
1761. Minimum Degree of a Connected Trio in a Graph 116ms_BMM.cpp
1761. Minimum Degree of a Connected Trio in a Graph 116ms_BMM.cpp
1761. Minimum Degree of a Connected Trio in a Graph 80ms.cpp
1761. Minimum Degree of a Connected Trio in a Graph 80ms.cpp
1761. Minimum Degree of a Connected Trio in a Graph.pdf
1761. Minimum Degree of a Connected Trio in a Graph.pdf
1762. Buildings With an Ocean View.txt
1762. Buildings With an Ocean View.txt
1764. Form Array by Concatenating Subarrays of Another Array.txt
1764. Form Array by Concatenating Subarrays of Another Array.txt
1765. Map of Highest Peak.txt
1765. Map of Highest Peak.txt
1766. Tree of Coprimes.txt
1766. Tree of Coprimes.txt
1768. Merge Strings Alternately.txt
1768. Merge Strings Alternately.txt
1769. Minimum Number of Operations to Move All Balls to Each Box.txt
1769. Minimum Number of Operations to Move All Balls to Each Box.txt
1770. Maximum Score from Performing Multiplication Operations.txt
1770. Maximum Score from Performing Multiplication Operations.txt
1771. Maximize Palindrome Length From Subsequences.txt
1771. Maximize Palindrome Length From Subsequences.txt
1772. Sort Features by Popularity.txt
1772. Sort Features by Popularity.txt
1773. Count Items Matching a Rule.txt
1773. Count Items Matching a Rule.txt
1774. Closest Dessert Cost.txt
1774. Closest Dessert Cost.txt
1775. Equal Sum Arrays With Minimum Number of Operations.txt
1775. Equal Sum Arrays With Minimum Number of Operations.txt
1776. Car Fleet II.txt
1776. Car Fleet II.txt
1778. Shortest Path in a Hidden Grid.txt
1778. Shortest Path in a Hidden Grid.txt
1779. Find Nearest Point That Has the Same X or Y Coordinate.txt
1779. Find Nearest Point That Has the Same X or Y Coordinate.txt
1780. Check if Number is a Sum of Powers of Three.txt
1780. Check if Number is a Sum of Powers of Three.txt
1781. Sum of Beauty of All Substrings.txt
1781. Sum of Beauty of All Substrings.txt
1782. Count Pairs Of Nodes.txt
1782. Count Pairs Of Nodes.txt
1784. Check if Binary String Has at Most One Segment of Ones.txt
1784. Check if Binary String Has at Most One Segment of Ones.txt
1785. Minimum Elements to Add to Form a Given Sum.txt
1785. Minimum Elements to Add to Form a Given Sum.txt
1786. Number of Restricted Paths From First to Last Node 324ms.cpp
1786. Number of Restricted Paths From First to Last Node 324ms.cpp
1786. Number of Restricted Paths From First to Last Node.txt
1786. Number of Restricted Paths From First to Last Node.txt
1787. Make the XOR of All Segments Equal to Zero.txt
1787. Make the XOR of All Segments Equal to Zero.txt
1788. Maximize the Beauty of the Garden 28ms.cpp
1788. Maximize the Beauty of the Garden 28ms.cpp
1788. Maximize the Beauty of the Garden.pdf
1788. Maximize the Beauty of the Garden.pdf
1790. Check if One String Swap Can Make Strings Equal.txt
1790. Check if One String Swap Can Make Strings Equal.txt
1791. Find Center of Star Graph.txt
1791. Find Center of Star Graph.txt
1792. Maximum Average Pass Ratio 200ms.cpp
1792. Maximum Average Pass Ratio 200ms.cpp
1792. Maximum Average Pass Ratio.pdf
1792. Maximum Average Pass Ratio.pdf
1793. Maximum Score of a Good Subarray.txt
1793. Maximum Score of a Good Subarray.txt
1794. Count Pairs of Equal Substrings With Minimum Difference.txt
1794. Count Pairs of Equal Substrings With Minimum Difference.txt
1796. Second Largest Digit in a String.txt
1796. Second Largest Digit in a String.txt
1797. Design Authentication Manager.txt
1797. Design Authentication Manager.txt
1798. Maximum Number of Consecutive Values You Can Make.pdf
1798. Maximum Number of Consecutive Values You Can Make.pdf
View all files
You can’t perform that action at this time.