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
Type
/
to 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 }}
hkhl
/
LeetCode
Public
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
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
master
Branches
Tags
Go to file
Code
Open more actions menu
Folders and files
Name
Name
Last commit message
Last commit date
Latest commit
History
110 Commits
110 Commits
virtualContest
virtualContest
001twosum.c
001twosum.c
026RemoveDuplicatesfromSortedArray.c
026RemoveDuplicatesfromSortedArray.c
027RemoveElement.c
027RemoveElement.c
035SearchInsertPosition.c
035SearchInsertPosition.c
053MaximumSubarray.c
053MaximumSubarray.c
066plusone.c
066plusone.c
088MergeSortedArray.c
088MergeSortedArray.c
100. Same Tree.cpp
100. Same Tree.cpp
101. Symmetric Tree.cpp
101. Symmetric Tree.cpp
107. Binary Tree Level Order Traversal II.cpp
107. Binary Tree Level Order Traversal II.cpp
108. Convert Sorted Array to Binary Search Tree.cpp
108. Convert Sorted Array to Binary Search Tree.cpp
110. Balanced Binary Tree.cpp
110. Balanced Binary Tree.cpp
111. Minimum Depth of Binary Tree.cpp
111. Minimum Depth of Binary Tree.cpp
112. Path Sum.cpp
112. Path Sum.cpp
118PascalTriangle.c
118PascalTriangle.c
119PascalTriangle.c
119PascalTriangle.c
121. Best Time to Buy and Sell Stock.cpp
121. Best Time to Buy and Sell Stock.cpp
122. Best Time to Buy and Sell Stock2.cpp
122. Best Time to Buy and Sell Stock2.cpp
125. Valid Palindrome.cpp
125. Valid Palindrome.cpp
13. Roman to Integer.cpp
13. Roman to Integer.cpp
136. Single Number.cpp
136. Single Number.cpp
14. Longest Common Prefix.cpp
14. Longest Common Prefix.cpp
141. Linked List Cycle.cpp
141. Linked List Cycle.cpp
160. Intersection of Two Linked Lists.cpp
160. Intersection of Two Linked Lists.cpp
167. Two Sum II - Input array is sorted.cpp
167. Two Sum II - Input array is sorted.cpp
168. Excel Sheet Column Title.cpp
168. Excel Sheet Column Title.cpp
169. Majority Element.cpp
169. Majority Element.cpp
171. Excel Sheet Column Number.cpp
171. Excel Sheet Column Number.cpp
172. Factorial Trailing Zeroes.cpp
172. Factorial Trailing Zeroes.cpp
189. Rotate Array.cpp
189. Rotate Array.cpp
20. Valid Parentheses.cpp
20. Valid Parentheses.cpp
202. Happy Number.cpp
202. Happy Number.cpp
203. Remove Linked List Elements.cpp
203. Remove Linked List Elements.cpp
204. Count Primes
204. Count Primes
206. Reverse Linked List.cpp
206. Reverse Linked List.cpp
21. Merge Two Sorted Lists.cpp
21. Merge Two Sorted Lists.cpp
217. Contains Duplicate.cpp
217. Contains Duplicate.cpp
219. Contains Duplicate II.cpp
219. Contains Duplicate II.cpp
226. Invert Binary Tree.cpp
226. Invert Binary Tree.cpp
234. Palindrome Linked List.cpp
234. Palindrome Linked List.cpp
235. Lowest Common Ancestor of a Binary Search Tree.cpp
235. Lowest Common Ancestor of a Binary Search Tree.cpp
237. Delete Node in a Linked List.cpp
237. Delete Node in a Linked List.cpp
242. Valid Anagram
242. Valid Anagram
257. Binary Tree Paths.cpp
257. Binary Tree Paths.cpp
268. Missing Number.cpp
268. Missing Number.cpp
28. Implement strStr.cpp
28. Implement strStr.cpp
283. Move Zeroes.cpp
283. Move Zeroes.cpp
374. Guess Number Higher or Lower.cpp
374. Guess Number Higher or Lower.cpp
38. Count and Say.cpp
38. Count and Say.cpp
383. Ransom Note.cpp
383. Ransom Note.cpp
404. Sum of Left Leaves.cpp
404. Sum of Left Leaves.cpp
414. Third Maximum Number.cpp
414. Third Maximum Number.cpp
437. Path Sum III.cpp
437. Path Sum III.cpp
448. Find All Numbers Disappeared in an Array.cpp
448. Find All Numbers Disappeared in an Array.cpp
485. Max Consecutive Ones.cpp
485. Max Consecutive Ones.cpp
538. Convert BST to Greater Tree.cpp
538. Convert BST to Greater Tree.cpp
543. Diameter of Binary Tree.cpp
543. Diameter of Binary Tree.cpp
561. Array Partition I.cpp
561. Array Partition I.cpp
563. Binary Tree Tilt.cpp
563. Binary Tree Tilt.cpp
566. Reshape the Matrix.cpp
566. Reshape the Matrix.cpp
572. Subtree of Another Tree.cpp
572. Subtree of Another Tree.cpp
58. Length of Last Word.cpp
58. Length of Last Word.cpp
581. Shortest Unsorted Continuous Subarray.cpp
581. Shortest Unsorted Continuous Subarray.cpp
605. Can Place Flowers.cpp
605. Can Place Flowers.cpp
606. Construct String from Binary Tree.cpp
606. Construct String from Binary Tree.cpp
617. Merge Two Binary Trees.cpp
617. Merge Two Binary Trees.cpp
628. Maximum Product of Three Numbers.cpp
628. Maximum Product of Three Numbers.cpp
637. Average of Levels in Binary Tree.cpp
637. Average of Levels in Binary Tree.cpp
643. Maximum Average Subarray I.cpp
643. Maximum Average Subarray I.cpp
653. Two Sum IV - Input is a BST.cpp
653. Two Sum IV - Input is a BST.cpp
661. Image Smoother.cpp
661. Image Smoother.cpp
665. Non-decreasing Array.cpp
665. Non-decreasing Array.cpp
669. Trim a Binary Search Tree.cpp
669. Trim a Binary Search Tree.cpp
67. Add Binary.cpp
67. Add Binary.cpp
671. Second Minimum Node In a Binary Tree.cpp
671. Second Minimum Node In a Binary Tree.cpp
674. Longest Continuous Increasing Subsequence.cpp
674. Longest Continuous Increasing Subsequence.cpp
687. Longest Univalue Path.cpp
687. Longest Univalue Path.cpp
69. Sqrtx.cpp
69. Sqrtx.cpp
695. Max Area of Island.cpp
695. Max Area of Island.cpp
697. Degree of an Array.cpp
697. Degree of an Array.cpp
7. Reverse Integer.cpp
7. Reverse Integer.cpp
70. Climbing Stairs.cpp
70. Climbing Stairs.cpp
717. 1-bit and 2-bit Characters.cpp
717. 1-bit and 2-bit Characters.cpp
724. Find Pivot Index.cpp
724. Find Pivot Index.cpp
746. Min Cost Climbing Stairs.cpp
746. Min Cost Climbing Stairs.cpp
747. Largest Number At Least Twice of Others.cpp
747. Largest Number At Least Twice of Others.cpp
766. Toeplitz Matrix.cpp
766. Toeplitz Matrix.cpp
83. Remove Duplicates from Sorted List.cpp
83. Remove Duplicates from Sorted List.cpp
89. Gray Code.cpp
89. Gray Code.cpp
9. Palindrome Number.cpp
9. Palindrome Number.cpp
README.md
README.md
grayCode.c
grayCode.c
View all files
Repository files navigation
README
More
items
LeetCode
exe
About
leetcode
Resources
Readme
Activity
Stars
0
stars
Watchers
0
watching
Forks
0
forks
Report repository
Releases
Packages
Contributors
Languages
You can’t perform that action at this time.