Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/algorithmzuo/algorithmbasic2020
/ functions
Functions
1,411 in github.com/algorithmzuo/algorithmbasic2020
⨍
Functions
1,411
◇
Types & classes
355
↓ 1 callers
Method
generateRandomArray
(int maxSize, int maxValue)
src/class05/Code02_PartitionAndQuickSort.java:125
↓ 1 callers
Method
generateRandomBST
(int maxLevel, int maxValue)
src/class13/Code01_IsCBT.java:92
↓ 1 callers
Method
generateRandomBST
(int maxLevel, int maxValue)
src/class13/Code03_lowestAncestor.java:90
↓ 1 callers
Method
generateRandomBST
(int maxLevel, int maxValue)
src/class13/Code02_MaxSubBSTHead.java:108
↓ 1 callers
Method
generateRandomBST
(int maxLevel, int maxValue)
src/class12/Code06_MaxDistance.java:152
↓ 1 callers
Method
generateRandomBST
(int maxLevel, int maxValue)
src/class12/Code05_MaxSubBSTSize.java:125
↓ 1 callers
Method
generateRandomBST
(int maxLevel, int maxValue)
src/class12/Code01_IsCBT.java:121
↓ 1 callers
Method
generateRandomBST
(int maxLevel, int maxValue)
src/class12/Code03_IsBalanced.java:74
↓ 1 callers
Method
generateRandomBST
(int maxLevel, int maxValue)
src/class12/Code02_IsBST.java:97
↓ 1 callers
Method
generateRandomBST
(int maxLevel, int maxValue)
src/class12/Code04_IsFull.java:80
↓ 1 callers
Method
generateRandomBST
(int maxLevel, int maxValue)
src/class11/Code05_TreeMaxWidth.java:85
↓ 1 callers
Method
generateRandomBST
(int maxLevel, int maxValue)
src/class11/Code02_SerializeAndReconstructTree.java:182
↓ 1 callers
Method
generateRandomDoubleLinkedList
(int n, int v)
src/class05/Code04_DoubleLinkedListQuickSort.java:221
↓ 1 callers
Method
generateRandomMatrix
(int rowSize, int colSize)
src/class21/Code01_MinPathSum.java:48
↓ 1 callers
Method
generateRandomString
(int strLen)
src/class13/Code05_LowestLexicography.java:70
↓ 1 callers
Method
generateRandomStringArray
(int arrLen, int strLen)
src/class13/Code05_LowestLexicography.java:80
↓ 1 callers
Method
generateTwoRandomArray
(int len, int value)
src/class38/Code04_MoneyProblem.java:137
↓ 1 callers
Method
gerenareRondomArray
()
src/class25/Code02_AllTimesMinToMax.java:46
↓ 1 callers
Method
getAllElements
()
src/class07/HeapGreater.java:71
↓ 1 callers
Method
getBSTSize
(TreeNode head)
src/class12/Code05_MaxSubBSTSize.java:98
↓ 1 callers
Method
getDaddies
()
src/class07/Code02_EveryStepShowBoss.java:94
↓ 1 callers
Method
getIndex
(SBTNode<K> cur, int kth)
src/class37/Code02_SlidingWindowMedian.java:140
↓ 1 callers
Method
getIndexKey
(int index)
src/class36/Code01_SizeBalancedTreeMap.java:226
↓ 1 callers
Method
getIndexOf
(String s1, String s2)
src/class27/Code01_KMP.java:5
↓ 1 callers
Method
getIndexOf
(String[] str1, String[] str2)
src/class27/Code02_TreeEqual.java:56
↓ 1 callers
Method
getIndexOf
(String s, String m)
src/class27/Code03_IsRotation.java:14
↓ 1 callers
Method
getIndexValue
(int index)
src/class36/Code01_SizeBalancedTreeMap.java:233
↓ 1 callers
Method
getLeftMost
(Node node)
src/class11/Code06_SuccessorNode.java:32
↓ 1 callers
Method
getLessIndex
(int[] arr)
src/class01/Code06_BSAwesome.java:6
↓ 1 callers
Method
getLessIndex
(int[] arr, int num)
src/class40/Code03_LongestLessSumSubArrayLength.java:65
↓ 1 callers
Method
getMaxLength
(int[] arr, int K)
src/class40/Code01_LongestSumSubArrayLengthInPositiveArray.java:5
↓ 1 callers
Method
getMaxWindow
(int[] arr, int w)
src/class24/Code01_SlidingWindowMaxArray.java:30
↓ 1 callers
Method
getMedian
(int[] arr, int L, int R)
src/class29/Code01_FindMinKth.java:135
↓ 1 callers
Method
getNearLess
(int[] arr)
src/class25/Code01_MonotonousStack.java:39
↓ 1 callers
Method
getNearLess
(int n)
src/class25/Code01_MonotonousStackForNowcoder.java:48
↓ 1 callers
Method
getNearLessNoRepeat
(int[] arr)
src/class25/Code01_MonotonousStack.java:17
↓ 1 callers
Method
getNeedParts
(int[] arr, long aim)
src/class41/Code04_SplitArrayLargestSum.java:134
↓ 1 callers
Method
getNextArray
(char[] str2)
src/class27/Code01_KMP.java:29
↓ 1 callers
Method
getNextArray
(String[] ms)
src/class27/Code02_TreeEqual.java:76
↓ 1 callers
Method
getNextArray
(char[] ms)
src/class27/Code03_IsRotation.java:36
↓ 1 callers
Method
getNum1
(int n)
src/class26/Code03_ZeroLeftOneStringNumber.java:5
↓ 1 callers
Method
getNum2
(int n)
src/class26/Code03_ZeroLeftOneStringNumber.java:22
↓ 1 callers
Method
getNum3
(int n)
src/class26/Code03_ZeroLeftOneStringNumber.java:40
↓ 1 callers
Method
getOp
(int[] pre)
src/class43/Code03_PavingTile.java:65
↓ 1 callers
Method
getParentMap
(Node head)
src/class12/Code06_MaxDistance.java:49
↓ 1 callers
Method
getPrelist
(Node head)
src/class12/Code06_MaxDistance.java:34
↓ 1 callers
Method
getRandomArray
(int size, int max)
src/class25/Code01_MonotonousStack.java:86
↓ 1 callers
Method
getRandomArrayNoRepeat
(int size)
src/class25/Code01_MonotonousStack.java:71
↓ 1 callers
Method
getRandomString
(int possibilities, int size)
src/class28/Code01_Manacher.java:68
↓ 1 callers
Method
goodArray
(int[] g, int[] c)
src/class24/Code03_GasStation.java:19
↓ 1 callers
Method
hanoi1
(int n)
src/class17/Code02_Hanoi.java:8
↓ 1 callers
Method
hanoi2
(int n)
src/class17/Code02_Hanoi.java:74
↓ 1 callers
Method
hanoi3
(int N)
src/class17/Code02_Hanoi.java:114
↓ 1 callers
Method
heapInsert
(int[] arr, int index)
src/class06/Code02_Heap.java:47
↓ 1 callers
Method
heapify
(int i)
src/class16/Code06_NetworkDelayTime.java:126
↓ 1 callers
Method
heapify
(int index, int size)
src/class16/Code06_Dijkstra.java:109
↓ 1 callers
Method
heapify
(int index, int size)
src/class17/Code01_Dijkstra.java:111
↓ 1 callers
Method
heapify
(int[] arr, int index, int heapSize)
src/class06/Code02_Heap.java:58
↓ 1 callers
Method
height
(int[] s)
src/class45/Code04_LongestRepeatingSubstring.java:156
↓ 1 callers
Method
height
(int[] s)
src/class45/Code03_LongestCommonSubstringConquerByHeight.java:213
↓ 1 callers
Method
height
(int[] s)
src/class44/DC3.java:131
↓ 1 callers
Method
in
(Node head)
src/class10/Code02_RecursiveTraversalBT.java:36
↓ 1 callers
Method
in
(Node cur)
src/class10/Code03_UnRecursiveTraversalBT.java:36
↓ 1 callers
Method
in
(Node head, ArrayList<Node> arr)
src/class13/Code02_MaxSubBSTHead.java:31
↓ 1 callers
Method
in
(TreeNode head, ArrayList<TreeNode> arr)
src/class12/Code05_MaxSubBSTSize.java:114
↓ 1 callers
Method
in
(Node head, ArrayList<Node> arr)
src/class12/Code02_IsBST.java:31
↓ 1 callers
Method
inHeap
(Node node)
src/class16/Code06_Dijkstra.java:129
↓ 1 callers
Method
inHeap
(Node node)
src/class17/Code01_Dijkstra.java:131
↓ 1 callers
Method
index
(int[][] positions)
src/class31/Code02_FallingSquares.java:77
↓ 1 callers
Method
infect
(char[][] board, int i, int j)
src/class15/Code02_NumberOfIslands.java:27
↓ 1 callers
Method
init
(int n)
src/class14/Code06_UnionFind.java:30
↓ 1 callers
Method
ins
(Node head, Queue<String> ans)
src/class11/Code02_SerializeAndReconstructTree.java:56
↓ 1 callers
Method
insertionSort
(int[] arr, int L, int R)
src/class29/Code01_FindMinKth.java:140
↓ 1 callers
Method
isBST1
(Node head)
src/class12/Code02_IsBST.java:17
↓ 1 callers
Method
isBST2
(Node head)
src/class12/Code02_IsBST.java:40
↓ 1 callers
Method
isBalanced1
(Node head)
src/class12/Code03_IsBalanced.java:15
↓ 1 callers
Method
isBalanced2
(Node head)
src/class12/Code03_IsBalanced.java:34
↓ 1 callers
Method
isCBT1
(Node head)
src/class12/Code01_IsCBT.java:17
↓ 1 callers
Method
isCBT2
(Node head)
src/class12/Code01_IsCBT.java:53
↓ 1 callers
Method
isCompleteTree1
(TreeNode head)
src/class13/Code01_IsCBT.java:20
↓ 1 callers
Method
isCompleteTree2
(TreeNode head)
src/class13/Code01_IsCBT.java:54
↓ 1 callers
Method
isEmpty
()
src/class06/Code02_Heap.java:93
↓ 1 callers
Method
isEqual
(int[] arr1, int[] arr2)
src/class08/Code05_ShellSort.java:71
↓ 1 callers
Method
isEqual
(int[] arr1, int[] arr2)
src/class08/Code03_CountSort.java:55
↓ 1 callers
Method
isEqual
(int[] arr1, int[] arr2)
src/class08/Code04_RadixSort.java:92
↓ 1 callers
Method
isEqual
(int[] arr1, int[] arr2)
src/class24/Code01_SlidingWindowMaxArray.java:64
↓ 1 callers
Method
isEqual
(int[] arr1, int[] arr2)
src/class01/Code03_InsertionSort.java:56
↓ 1 callers
Method
isEqual
(int[] arr1, int[] arr2)
src/class01/Code02_BubbleSort.java:57
↓ 1 callers
Method
isEqual
(int[] arr1, int[] arr2)
src/class01/Code01_SelectionSort.java:60
↓ 1 callers
Method
isEqual
(int[] arr1, int[] arr2)
src/class04/Code01_MergeSort.java:97
↓ 1 callers
Method
isEqual
(int[] arr1, int[] arr2)
src/class06/Code03_HeapSort.java:91
↓ 1 callers
Method
isEqual
(int[] arr1, int[] arr2)
src/class06/Code04_SortArrayDistanceLessK.java:72
↓ 1 callers
Method
isFull
()
src/class06/Code02_Heap.java:97
↓ 1 callers
Method
isFull1
(Node head)
src/class12/Code04_IsFull.java:18
↓ 1 callers
Method
isFull2
(Node head)
src/class12/Code04_IsFull.java:51
↓ 1 callers
Method
isKeyLess
(K otherKey)
src/class36/Code02_SkipListMap.java:23
↓ 1 callers
Method
isMSum2
(int num)
src/class38/Code03_MSumToN.java:21
↓ 1 callers
Method
isRight
(int[] arr, int index)
src/class01/Code06_BSAwesome.java:33
↓ 1 callers
Method
isRotation
(String a, String b)
src/class27/Code03_IsRotation.java:5
↓ 1 callers
Method
isSameSet
(int x, int y)
src/class14/Code06_UnionFind.java:51
← previous
next →
501–600 of 1,411, ranked by callers