Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/andavid/leetcode-java
/ types & classes
Types & classes
256 in github.com/andavid/leetcode-java
⨍
Functions
374
◇
Types & classes
256
Class
BSTIterator
Definition for a binary tree node. public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } }
en/173.binary-search-tree-iterator.java:15
Class
Codec
Definition for a binary tree node. public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } }
en/297.serialize-and-deserialize-binary-tree.java:57
Class
Codec
Definition for a binary tree node. public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } }
en/449.serialize-and-deserialize-bst.java:42
Class
Codec
Definition for a binary tree node. public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } }
zh/297.二叉树的序列化与反序列化.1.java:51
Class
Codec
Definition for a binary tree node. public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } }
zh/297.二叉树的序列化与反序列化.java:51
Class
DoubleList
en/146.lru-cache.java:59
Class
LRUCache
en/146.lru-cache.java:99
Class
MedianFinder
en/295.find-median-from-data-stream.java:55
Class
MinStack
en/155.min-stack.java:46
Class
MyCircularDeque
en/641.design-circular-deque.java:67
Class
MyCircularQueue
en/622.design-circular-queue.java:69
Class
MyQueue
en/232.implement-queue-using-stacks.java:47
Class
MyStack
en/225.implement-stack-using-queues.java:47
Class
Node
en/146.lru-cache.java:49
Class
RandomizedSet
en/380.insert-delete-get-random-o-1.java:56
Class
Solution
Definition for a binary tree node. public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } }
en/235.lowest-common-ancestor-of-a-binary-search-tree.java:15
Class
Solution
en/448.find-all-numbers-disappeared-in-an-array.java:34
Class
Solution
en/190.reverse-bits.java:58
Class
Solution
Definition for a binary tree node. public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } }
en/513.find-bottom-left-tree-value.java:63
Class
Solution
en/1.two-sum.java:32
Class
Solution
en/122.best-time-to-buy-and-sell-stock-ii.java:56
Class
Solution
en/39.combination-sum.java:54
Class
Solution
Definition for singly-linked list. public class ListNode { int val; ListNode next; ListNode(int x) { val = x; } }
en/24.swap-nodes-in-pairs.1.java:32
Class
Solution
en/394.decode-string.java:40
Class
Solution
en/33.search-in-rotated-sorted-array.java:6
Class
Solution
Definition for a binary tree node. public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } }
en/230.kth-smallest-element-in-a-bst.java:15
Class
Solution
Definition for a binary tree node. public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } }
en/515.find-largest-value-in-each-tree-row.java:42
Class
Solution
Definition for a binary tree node. public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } }
en/1022.sum-of-root-to-leaf-binary-numbers.1.java:58
Class
Solution
Definition for singly-linked list. public class ListNode { int val; ListNode next; ListNode(int x) { val = x; } }
en/83.remove-duplicates-from-sorted-list.java:42
Class
Solution
en/58.length-of-last-word.java:34
Class
Solution
en/387.first-unique-character-in-a-string.java:32
Class
Solution
en/88.merge-sorted-array.java:37
Class
Solution
Definition for a binary tree node. public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } }
en/144.binary-tree-preorder-traversal.java:41
Class
Solution
en/3.longest-substring-without-repeating-characters.java:49
Class
Solution
en/338.counting-bits.java:42
Class
Solution
Definition for singly-linked list. public class ListNode { int val; ListNode next; ListNode(int x) { val = x; } }
en/203.remove-linked-list-elements.java:34
Class
Solution
en/151.reverse-words-in-a-string.java:63
Class
Solution
en/283.move-zeroes.java:30
Class
Solution
en/621.task-scheduler.java:48
Class
Solution
en/581.shortest-unsorted-continuous-subarray.java:38
Class
Solution
en/347.top-k-frequent-elements.java:6
Class
Solution
en/647.palindromic-substrings.java:51
Class
Solution
en/56.merge-intervals.java:38
Class
Solution
en/204.count-primes.java:25
Class
Solution
Definition for a binary tree node. public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } }
en/872.leaf-similar-trees.java:48
Class
Solution
en/344.reverse-string.java:44
Class
Solution
Definition for singly-linked list. public class ListNode { int val; ListNode next; ListNode(int x) { val = x; } }
en/24.swap-nodes-in-pairs.java:32
Class
Solution
en/242.valid-anagram.java:39
Class
Solution
en/739.daily-temperatures.java:29
Class
Solution
en/10.regular-expression-matching.java:86
Class
Solution
en/9.palindrome-number.java:49
Class
Solution
en/384.shuffle-an-array.java:35
Class
Solution
en/172.factorial-trailing-zeroes.java:35
Class
Solution
Definition for a binary tree node. public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } }
en/106.construct-binary-tree-from-inorder-and-postorder-traversal.java:15
Class
Solution
en/268.missing-number.java:35
Class
Solution
en/168.excel-sheet-column-title.java:53
Class
Solution
en/215.kth-largest-element-in-an-array.1.java:34
Class
Solution
Definition for a binary tree node. public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } }
en/199.binary-tree-right-side-view.java:15
Class
Solution
Definition for singly-linked list. public class ListNode { int val; ListNode next; ListNode(int x) { val = x; } }
en/234.palindrome-linked-list.java:40
Class
Solution
en/189.rotate-array.java:46
Class
Solution
en/200.number-of-islands.java:45
Class
Solution
en/326.power-of-three.java:44
Class
Solution
en/18.4-sum.java:38
Class
Solution
en/16.3-sum-closest.java:29
Class
Solution
en/50.pow-x-n.java:48
Class
Solution
Definition for singly-linked list. public class ListNode { int val; ListNode next; ListNode(int x) { val = x; } }
en/206.reverse-linked-list.java:33
Class
Solution
en/69.sqrt-x.java:41
Class
Solution
en/62.unique-paths.java:48
Class
Solution
Definition for a binary tree node. public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } }
en/671.second-minimum-node-in-a-binary-tree.java:68
Class
Solution
en/119.pascals-triangle-ii.java:35
Class
Solution
en/692.top-k-frequent-words.java:6
Class
Solution
Definition for singly-linked list. class ListNode { int val; ListNode next; ListNode(int x) { val = x; next = null; } }
en/141.linked-list-cycle.java:71
Class
Solution
en/496.next-greater-element-i.java:61
Class
Solution
en/20.valid-parentheses.java:62
Class
Solution
en/40.combination-sum-ii.java:54
Class
Solution
Definition for a binary tree node. public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } }
en/98.validate-binary-search-tree.java:60
Class
Solution
en/217.contains-duplicate.java:38
Class
Solution
Definition for singly-linked list. public class ListNode { int val; ListNode next; ListNode(int x) { val = x; } }
en/92.reverse-linked-list-ii.java:34
Class
Solution
Definition for singly-linked list. public class ListNode { int val; ListNode next; ListNode(int x) { val = x; } }
en/206.reverse-linked-list.1.java:33
Class
Solution
en/79.word-search.java:38
Class
Solution
en/125.valid-palindrome.java:35
Class
Solution
en/12.integer-to-roman.java:82
Class
Solution
en/334.increasing-triplet-subsequence.java:46
Class
Solution
en/27.remove-element.java:69
Class
Solution
Definition for a binary tree node. public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } }
en/102.binary-tree-level-order-traversal.java:48
Class
Solution
Definition for a binary tree node. public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } }
en/543.diameter-of-binary-tree.java:52
Class
Solution
en/13.roman-to-integer.java:80
Class
Solution
en/239.sliding-window-maximum.java:6
Class
Solution
Definition for singly-linked list. class ListNode { int val; ListNode next; ListNode(int x) { val = x; next = null; } }
en/142.linked-list-cycle-ii.java:67
Class
Solution
en/300.longest-increasing-subsequence.java:38
Class
Solution
en/188.best-time-to-buy-and-sell-stock-iv.java:44
Class
Solution
en/409.longest-palindrome.java:37
Class
Solution
en/15.3-sum.java:37
Class
Solution
en/4.median-of-two-sorted-arrays.java:42
Class
Solution
en/198.house-robber.java:44
Class
Solution
en/51.n-queens.java:6
Class
Solution
en/349.intersection-of-two-arrays.java:41
Class
Solution
en/350.intersection-of-two-arrays-ii.java:51
Class
Solution
Definition for singly-linked list. public class ListNode { int val; ListNode next; ListNode(int x) { val = x; } }
en/876.middle-of-the-linked-list.java:65
Class
Solution
en/96.unique-binary-search-trees.java:6
next →
1–100 of 256, ranked by callers