Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/Jensenczx/CodeEveryday
/ types & classes
Types & classes
150 in github.com/Jensenczx/CodeEveryday
⨍
Functions
269
◇
Types & classes
150
Class
Cat
99_ToyFactory.java:12
Class
Dog
99_ToyFactory.java:5
Class
DoublyListNode
55_bstToDoublyList.java:9
Class
Gloves
1_Gloves.java:3
Class
Interval
14_countOfAirplanes.java:1
Class
ListNode
10_DeleteNode.java:1
Class
Main
untitled.java:1
Class
MinStack
51_minstack.java:1
Class
Periods
2_Periods.java:3
Class
Queue
33_QueueByStack.java:1
Class
RandomListNode
54_copyRandomList.java:1
Class
Rectangle
101_shapeFactory.java:11
Class
SegmentTree
91_countOfSmallerNumber.java:1
Class
SegmentTree
Definition of Interval: public classs Interval { int start, end; Interval(int start, int end) { this.start = start; this.end =
89_intervalSum.java:10
Class
SegmentTree
Definition of Interval: public classs Interval { int start, end; Interval(int start, int end) { this.start = start; this.end =
88_intervalMinNumber.java:10
Interface
Shape
Your object will be instantiated and called as such: ShapeFactory sf = new ShapeFactory(); Shape shape = sf.getShape(shapeType); shape.draw();
101_shapeFactory.java:7
Class
ShapeFactory
101_shapeFactory.java:39
Class
Solution
107_generateParenthesis.java:1
Class
Solution
72_threeSum.java:1
Class
Solution
103_trailingZeros.java:1
Class
Solution
18_backPack.java:1
Class
Solution
9_longestWords.java:1
Class
Solution
87_reverseInteger.java:1
Class
Solution
104_numWays.java:1
Class
Solution
105_reversePairs.java:1
Class
Solution
23_houseRobber.java:1
Class
Solution
29_minPathSum.java:1
Class
Solution
44_mergeTwoLists.java:1
Class
Solution
45_reverse.java:1
Class
Solution
63_median.java:1
Class
Solution
56_maxSubArray.java:1
Class
Solution
43_removeNthFromEnd.java:1
Class
Solution
82_removeElements.java:1
Class
Solution
8_majorityNumber.java:1
Class
Solution
16_1_singleNumber.java:1
Class
Solution
14_countOfAirplanes.java:9
Class
Solution
73_binarySearch.java:1
Class
Solution
71_twosum.java:1
Class
Solution
16_2_aplusb.java:1
Class
Solution
91_countOfSmallerNumber.java:14
Class
Solution
11_BinaryTreePaths.java:12
Class
Solution
50_postorderTraversal.java:1
Class
Solution
27_longestIncreasingContinuousSubsequence.java:1
Class
Solution
110_isugly.java:1
Class
Solution
12_findMissing.java:1
Class
Solution
36_countOnes.java:1
Class
Solution
35_fibonacci.java:1
Class
Solution
30_uniquePaths.java:1
Class
Solution
40_searchMatrix.java:1
Class
Solution
13_plusOne.java:1
Class
Solution
60_digitCounts.java:1
Class
Solution
Definition of SegmentTreeNode: public class SegmentTreeNode { public int start, end, max; public SegmentTreeNode left, right; public Segme
84_segmentTreeQuery.java:14
Class
Solution
48_binaryTreePathSum.java:11
Class
Solution
15_restoreIpAddresses.java:2
Class
Solution
78_listpartition.java:1
Class
Solution
131_productExcludeItself.java:7
Class
Solution
113_maxSquare.java:1
Class
Solution
75_countAndSay.java:1
Class
Solution
54_copyRandomList.java:6
Class
Solution
31_uniquePathsWithObstacles.java:1
Class
Solution
100_paintingHouseMinCost.java:1
Class
Solution
70_partitionArray.java:1
Class
Solution
28_canJump.java:1
Class
Solution
Definition of SegmentTreeNode: public class SegmentTreeNode { public int start, end, max; public SegmentTreeNode left, right; public Segme
86_buildSegmetTree.java:14
Class
Solution
46_numbersByRecursion.java:1
Class
Solution
Definition for singly-linked list. public class ListNode { int val; ListNode next; ListNode(int x) { val = x; } }
106_swapPairs.java:9
Class
Solution
114_minSubArray.java:1
Class
Solution
Definition for ListNode public class ListNode { int val; ListNode next; ListNode(int x) { val = x; next = null; } }
119_deleteDuplicates.java:12
Class
Solution
4_HappyNumber.java:1
Class
Solution
132_hashcode.java:15
Class
Solution
58_getIntersectionNode.java:1
Class
Solution
37_findMinNumInRrveseArray.java:1
Class
Solution
34_fizzBuzz.java:1
Class
Solution
17_TreeisIdentical.java:9
Class
Solution
77_isUnique.java:1
Class
Solution
126_isHappy.java:1
Class
Solution
125_intersection.java:1
Class
Solution
120_singleNumberII.java:1
Class
Solution
129_mergesortedArray.java:9
Class
Solution
5_PermutationIndex.java:1
Class
Solution
38_singleton.java:1
Class
Solution
Definition of SegmentTreeNode: public class SegmentTreeNode { public int start, end; public SegmentTreeNode left, right; public SegmentTre
83_segmentTreeNodeBuild.java:12
Class
Solution
10_DeleteNode.java:10
Class
Solution
59_kthPrimeNumber.java:1
Class
Solution
102_nextPermutation.java:1
Class
Solution
public class SVNRepo { public static boolean isBadVersion(int k); } you can use SVNRepo.isBadVersion(k) to judge whether the kth code version is b
93_findFirstBadVersion.java:8
Class
Solution
19_backPackII.java:1
Class
Solution
127_subarraySum.java:1
Class
Solution
Definition of SegmentTreeNode: public class SegmentTreeNode { public int start, end, max; public SegmentTreeNode left, right; public Segme
85_modifySegmentTree.java:14
Class
Solution
42_partitionArray.java:1
Class
Solution
57_kthLargestElement.java:1
Class
Solution
49_stringPermutation.java:1
Class
Solution
Definition of TreeNode: public class TreeNode { public int val; public TreeNode left, right; public TreeNode(int val) { this.val =
95_sortedArrayToBST.java:12
Class
Solution
121_simplifyPath.java:1
Class
Solution
74_findPeak.java:1
Class
Solution
20_longestCommonSubstring.java:1
Class
Solution
Definition of TreeNode: public class TreeNode { public int val; public TreeNode left, right; public TreeNode(int val) { this.val =
96_minDepth.java:12
Class
Solution
24_MinAdjustmentCost.java:2
Class
Solution
117_maxProfit1.java:1
Class
Solution
81_compareStrings.java:1
next →
1–100 of 150, ranked by callers