Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/Jack-Cherish/LeetCode
/ types & classes
Types & classes
65 in github.com/Jack-Cherish/LeetCode
⨍
Functions
82
◇
Types & classes
65
↓ 1 callers
Class
ListNode
Linked List/Easy/21.Merge Two Sorted Lists/Merge Two Sorted Lists.c:8
Class
ListNode
Linked List/Medium/61.Rotate List/Rotate List.c:8
Class
ListNode
Linked List/Easy/141.Linked List Cycle/Linked List Cycle.c:8
Class
ListNode
Linked List/Easy/234.Palindrome Linked List/Palindrome Linked List.c:8
Class
ListNode
Linked List/Easy/237.Delete Node in a Linked List/Delete Node in a Linked List.c:8
Class
ListNode
Linked List/Easy/203.Remove Linked List Elements/Remove Linked List Elements.c:8
Class
ListNode
Linked List/Easy/160.Intersection of Two Linked Lists/Intersection of Two Linked Lists.c:8
Class
ListNode
Linked List/Easy/206.Reverse Linked List/Reverse Linked List-recursively.c:8
Class
ListNode
Linked List/Easy/206.Reverse Linked List/Reverse Linked List-iteratively.c:8
Class
ListNode
Linked List/Easy/83.Remove Duplicates from Sorted List/Remove Duplicates from Sorted List.c:8
Class
MinStack
Stack/Easy/155.Min Stack/Min Stack.cpp:1
Class
MyQueue
Stack/Easy/232.Implement Queue using Stacks/Implement Queue using Stacks.cpp:1
Class
MyStack
Stack/Easy/225.Implement Stack using Queues/Implement Stack using Queues.cpp:1
Class
Solution
* Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * };
Linked List/Medium/61.Rotate List/Rotate List.cpp:9
Class
Solution
Linked List/Medium/61.Rotate List/Rotate List.py:8
Class
Solution
Linked List/Easy/141.Linked List Cycle/Linked List Cycle.py:7
Class
Solution
* Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * };
Linked List/Easy/141.Linked List Cycle/Linked List Cycle.cpp:9
Class
Solution
* Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * };
Linked List/Easy/234.Palindrome Linked List/Palindrome Linked List.cpp:9
Class
Solution
Linked List/Easy/234.Palindrome Linked List/Palindrome.py:7
Class
Solution
Linked List/Easy/237.Delete Node in a Linked List/Delete Node in a Linked List.py:7
Class
Solution
* Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * };
Linked List/Easy/203.Remove Linked List Elements/Remove Linked List Elements.cpp:9
Class
Solution
Linked List/Easy/160.Intersection of Two Linked Lists/Intersection of Two Linked Lists.py:7
Class
Solution
* Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * };
Linked List/Easy/160.Intersection of Two Linked Lists/Intersection of Two Linked Lists.cpp:9
Class
Solution
Linked List/Easy/206.Reverse Linked List/Reverse Linked List.py:7
Class
Solution
* Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * };
Linked List/Easy/21.Merge Two Sorted Lists/Merge Two Sorted Lists.cpp:9
Class
Solution
Linked List/Easy/21.Merge Two Sorted Lists/Merge Two Sorted Lists.py:7
Class
Solution
* Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * };
Linked List/Easy/83.Remove Duplicates from Sorted List/Remove Duplicates from Sorted List.cpp:9
Class
Solution
Linked List/Easy/83.Remove Duplicates from Sorted List/Remove Duplicates from Sorted List.py:7
Class
Solution
Tree/Medium/113.Path Sum II/Path Sum II.py:8
Class
Solution
Tree/Easy/543.Diameter of Binary Tree/Diameter of Binary Tree.py:8
Class
Solution
* Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(
Tree/Easy/543.Diameter of Binary Tree/Diameter of Binary Tree.cpp:10
Class
Solution
Tree/Easy/111.Minimum Depth of Binary Tree/Minimum Depth of Binary Tree-2.py:8
Class
Solution
* Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(
Tree/Easy/111.Minimum Depth of Binary Tree/Minimum Depth of Binary Tree.cpp:10
Class
Solution
Tree/Easy/111.Minimum Depth of Binary Tree/Minimum Depth of Binary Tree-1.py:8
Class
Solution
* Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(
Tree/Easy/606.Construct String from Binary Tree/Construct String from Binary Tree.cpp:10
Class
Solution
Tree/Easy/606.Construct String from Binary Tree/Construct String from Binary Tree.py:8
Class
Solution
Tree/Easy/112.Path Sum/Path Sum-2.py:8
Class
Solution
Tree/Easy/112.Path Sum/Path Sum-1.py:8
Class
Solution
* Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(
Tree/Easy/112.Path Sum/Path Sum.cpp:10
Class
Solution
Tree/Easy/235.Lowest Common Ancestor of a Binary Search Tree/Lowest Common Ancestor of a Binary Search Tree-1.py:8
Class
Solution
* Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(
Tree/Easy/235.Lowest Common Ancestor of a Binary Search Tree/Lowest Common Ancestor of a Binary Search Tree.cpp:10
Class
Solution
Tree/Easy/235.Lowest Common Ancestor of a Binary Search Tree/Lowest Common Ancestor of a Binary Search Tree-2.py:8
Class
Solution
* Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(
Tree/Easy/501.Find Mode in Binary Search Tree/Find Mode in Binary Search Tree.cpp:10
Class
Solution
Tree/Easy/501.Find Mode in Binary Search Tree/Find Mode in Binary Search Tree.py:8
Class
Solution
Stack/Medium/150.Evaluate Reverse Polish Notation/Evaluate Reverse Polish Notation.cpp:1
Class
Solution
Stack/Easy/20.Valid Parentheses/Valid Parentheses.cpp:1
Class
Solution
Stack/Easy/496.Next Greater Element I/Next Greater Element I.cpp:1
Class
Solution
String/Easy/521.Longest Uncommon Subsequence I/Longest Uncommon Subsequence I.py:1
Class
Solution
String/Easy/13.Roman to Integer/Roman to Integer.py:1
Class
Solution
String/Easy/541.Reverse String II/Reverse String II.cpp:1
Class
Solution
String/Easy/541.Reverse String II/Reverse String II.py:1
Class
Solution
String/Easy/67.Add Binary/Add Binary.py:1
Class
Solution
String/Easy/67.Add Binary/67.Add Binary.cpp:1
Class
Solution
String/Easy/14.Longest Common Prefix/Longest Common Prefix.py:2
Class
Solution
String/Easy/434.Number of Segments in a String/Number of Segments in a String.cpp:1
Class
Solution
String/Easy/434.Number of Segments in a String/Number of Segments in a String.py:1
Class
Solution
String/Easy/657.Judge Route Circle/Judge Route Circle.py:1
Class
Solution
String/Easy/38.Count and Say/Count and Say.py:2
Class
Solution
String/Easy/557.Reverse Words in a String III/Reverse Words in a String III.py:1
Class
Solution
String/Easy/557.Reverse Words in a String III/Reverse Words in a String III.cpp:1
Class
Solution
String/Easy/520.Detect Capital/Detect Capital.py:1
Class
Solution
String/Easy/520.Detect Capital/Detect Capital.cpp:1
Class
Solution
String/Easy/551. Student Attendance Record I/Student Attendance Record I.py:1
Class
Solution
String/Easy/344.Reverse String/Reverse String.cpp:1
Class
Solution
String/Easy/344.Reverse String/Reverse String.py:1