MCPcopy Create free account

hub / github.com/algorithmzuo/algorithmbasic2020 / functions

Functions1,411 in github.com/algorithmzuo/algorithmbasic2020

↓ 1 callersMethodisSameSet
(Node a, Node b)
src/class16/Code04_Kruskal.java:47
↓ 1 callersMethodisSum1
(int[] arr, int sum)
src/class39/IsSum.java:14
↓ 1 callersMethodisSum2
(int[] arr, int sum)
src/class39/IsSum.java:39
↓ 1 callersMethodisSum3
(int[] arr, int sum)
src/class39/IsSum.java:69
↓ 1 callersMethodisSum4
(int[] arr, int sum)
src/class39/IsSum.java:104
↓ 1 callersMethodisValid
(int[] arr)
src/class47/Code02_RestoreWays.java:34
↓ 1 callersMethodisValid
(int[] record, int i, int j)
src/class23/Code03_NQueens.java:33
↓ 1 callersMethodjump
(int a, int b, int k)
src/class20/Code02_HorseJump.java:9
↓ 1 callersMethodkm
(int[] arr, int k, int m)
src/class02/Code03_KM.java:69
↓ 1 callersMethodlargestBSTSubtree
(TreeNode head)
src/class12/Code05_MaxSubBSTSize.java:20
↓ 1 callersMethodleftNearLessEqual2
(int[] arr)
src/class26/Code01_SumOfSubarrayMinimums.java:40
↓ 1 callersMethodlessMoney1
(int[] arr)
src/class14/Code02_LessMoneySplitGold.java:8
↓ 1 callersMethodlessMoney2
(int[] arr)
src/class14/Code02_LessMoneySplitGold.java:42
↓ 1 callersMethodlevel
(Node head)
src/class11/Code01_LevelTraversalBT.java:18
↓ 1 callersMethodlevelSerial
(Node head)
src/class11/Code02_SerializeAndReconstructTree.java:123
↓ 1 callersMethodlistPartition2
(Node head, int pivot)
src/class09/Code03_SmallerEqualBigger.java:60
↓ 1 callersMethodlivePosibility1
(int row, int col, int k, int N, int M)
src/class21/Code05_BobDie.java:5
↓ 1 callersMethodlivePosibility2
(int row, int col, int k, int N, int M)
src/class21/Code05_BobDie.java:26
↓ 1 callersMethodlog2N
(int n)
src/class42/Code02_ThrowChessPiecesProblem.java:138
↓ 1 callersMethodlongestCommonSubsequence
(char[] str1, char[] str2)
src/class20/Code01_PalindromeSubsequence.java:73
↓ 1 callersMethodlongestRepeatingSubstring
(String s)
src/class45/Code04_LongestRepeatingSubstring.java:12
↓ 1 callersMethodlowestAncestor1
(Node head, Node o1, Node o2)
src/class13/Code03_lowestAncestor.java:19
↓ 1 callersMethodlowestAncestor2
(Node head, Node a, Node b)
src/class13/Code03_lowestAncestor.java:52
↓ 1 callersMethodlowestString1
(String[] strs)
src/class13/Code05_LowestLexicography.java:9
↓ 1 callersMethodlowestString2
(String[] strs)
src/class13/Code05_LowestLexicography.java:57
↓ 1 callersMethodmaintain
(SBTNode<K> cur)
src/class37/Code02_SlidingWindowMedian.java:38
↓ 1 callersMethodmaintain
(SBTNode cur)
src/class37/Code01_CountofRangeSum.java:81
↓ 1 callersMethodmaintain
(SBTNode<V> cur)
src/class37/Code03_AddRemoveGetIndexGreat.java:40
↓ 1 callersMethodmaintain
(SBTNode cur)
src/class37/Code04_QueueReconstructionByHeight.java:104
↓ 1 callersMethodmaintain
(SBTNode<K, V> cur)
src/class36/Code01_SizeBalancedTreeMap.java:40
↓ 1 callersMethodmakeSets
(Collection<Node> nodes)
src/class16/Code04_Kruskal.java:26
↓ 1 callersMethodmanacher
(String s)
src/class28/Code01_Manacher.java:5
↓ 1 callersMethodmanacherString
(String str)
src/class28/Code02_AddShortestEnd.java:39
↓ 1 callersMethodmapCreater
(HashMap<Integer, Integer> map)
src/class02/Code03_KM.java:60
↓ 1 callersMethodmax1
(int[] arr)
src/class25/Code02_AllTimesMinToMax.java:7
↓ 1 callersMethodmax1
(int[] arr, int m)
src/class39/Code01_SubsquenceMaxModM.java:9
↓ 1 callersMethodmax2
(int[] arr)
src/class25/Code02_AllTimesMinToMax.java:23
↓ 1 callersMethodmax2
(int[] arr, int m)
src/class39/Code01_SubsquenceMaxModM.java:28
↓ 1 callersMethodmax3
(int[] arr, int m)
src/class39/Code01_SubsquenceMaxModM.java:56
↓ 1 callersMethodmax4
(int[] arr, int m)
src/class39/Code01_SubsquenceMaxModM.java:87
↓ 1 callersMethodmaxCover1
(int[][] lines)
src/class07/Code01_CoverMax.java:9
↓ 1 callersMethodmaxCover2
(int[][] m)
src/class07/Code01_CoverMax.java:29
↓ 1 callersMethodmaxCover3
(int[][] m)
src/class07/Code01_CoverMax.java:71
↓ 1 callersMethodmaxDistance1
(Node head)
src/class12/Code06_MaxDistance.java:19
↓ 1 callersMethodmaxDistance2
(Node head)
src/class12/Code06_MaxDistance.java:122
↓ 1 callersMethodmaxFlow
(int s, int t)
src/class47/Code03_DinicAlgorithm.java:95
↓ 1 callersMethodmaxHappy1
(Employee boss)
src/class13/Code04_MaxHappy.java:19
↓ 1 callersMethodmaxHappy2
(Employee head)
src/class13/Code04_MaxHappy.java:49
↓ 1 callersMethodmaxLength
(int[] arr, int k)
src/class40/Code03_LongestLessSumSubArrayLength.java:44
↓ 1 callersMethodmaxLength
(int[] arr, int k)
src/class40/Code02_LongestSumSubArrayLength.java:7
↓ 1 callersMethodmaxLengthAwesome
(int[] arr, int k)
src/class40/Code04_AvgLessEqualValueLongestSubarray.java:80
↓ 1 callersMethodmaxLengthAwesome
(int[] arr, int k)
src/class40/Code03_LongestLessSumSubArrayLength.java:5
↓ 1 callersMethodmaxRecFromBottom
(int[] height)
src/class25/Code04_MaximalRectangle.java:24
↓ 1 callersMethodmaxSubBSTHead1
(Node head)
src/class13/Code02_MaxSubBSTHead.java:40
↓ 1 callersMethodmaxSubBSTHead2
(Node head)
src/class13/Code02_MaxSubBSTHead.java:52
↓ 1 callersMethodmaxSum
(int[] arr, int M)
src/class46/Code04_MaxSumLengthNoMore.java:30
↓ 1 callersMethodmaxTopK1
(int[] arr, int k)
src/class29/Code02_MaxTopK.java:9
↓ 1 callersMethodmaxTopK2
(int[] arr, int k)
src/class29/Code02_MaxTopK.java:25
↓ 1 callersMethodmaxTopK3
(int[] arr, int k)
src/class29/Code02_MaxTopK.java:79
↓ 1 callersMethodmaxValue
(int[] w, int[] v, int bag)
src/class19/Code01_Knapsack.java:9
↓ 1 callersMethodmaxWidthNoMap
(Node head)
src/class11/Code05_TreeMaxWidth.java:54
↓ 1 callersMethodmaxWidthUseMap
(Node head)
src/class11/Code05_TreeMaxWidth.java:19
↓ 1 callersMethodmaxbits
(int[] arr)
src/class08/Code04_RadixSort.java:15
↓ 1 callersMethodmedianOfMedians
(int[] arr, int L, int R)
src/class29/Code01_FindMinKth.java:119
↓ 1 callersMethodmerge
(int[] arr, int L, int m, int r)
src/class04/Code02_SmallSum.java:31
↓ 1 callersMethodmerge
(int[] arr, int L, int m, int r)
src/class04/Code03_ReversePair.java:25
↓ 1 callersMethodmerge
(int[] arr, int L, int m, int r)
src/class04/Code04_BiggerThanRightTwice.java:22
↓ 1 callersMethodmerge
(int[] nums1, int[] nums2)
src/class45/Code02_CreateMaximumNumber.java:27
↓ 1 callersMethodmerge
(long[] arr, int L, int M, int R, int lower, int upper)
src/class05/Code01_CountOfRangeSum.java:28
↓ 1 callersMethodmergeBySuffixArray
(int[] nums1, int[] nums2)
src/class45/Code02_CreateMaximumNumber.java:72
↓ 1 callersMethodmergeSort1
(int[] arr)
src/class04/Code01_MergeSort.java:6
↓ 1 callersMethodmergeSort2
(int[] arr)
src/class04/Code01_MergeSort.java:48
↓ 1 callersMethodmidOrDownMidNode
(Node head)
src/class09/Code01_LinkedListMid.java:31
↓ 1 callersMethodmidOrDownMidPreNode
(Node head)
src/class09/Code01_LinkedListMid.java:57
↓ 1 callersMethodmidOrUpMidNode
(Node head)
src/class09/Code01_LinkedListMid.java:17
↓ 1 callersMethodmidOrUpMidPreNode
(Node head)
src/class09/Code01_LinkedListMid.java:44
↓ 1 callersMethodmin1
(int[] arr)
src/class41/Code03_StoneMerge.java:20
↓ 1 callersMethodmin1
(int[] arr, int num)
src/class42/Code01_PostOfficeProblem.java:7
↓ 1 callersMethodmin2
(int[] arr)
src/class41/Code03_StoneMerge.java:40
↓ 1 callersMethodmin2
(int[] arr, int num)
src/class42/Code01_PostOfficeProblem.java:34
↓ 1 callersMethodmin3
(int[] arr)
src/class41/Code03_StoneMerge.java:61
↓ 1 callersMethodminBags
(int apple)
src/class38/Code01_AppleMinBags.java:5
↓ 1 callersMethodminCoins
(int[] arr, int aim)
src/class22/Code02_MinCoinsNoLimit.java:5
↓ 1 callersMethodminCoins
(int[] arr, int aim)
src/class24/Code04_MinCoinsOnePaper.java:9
↓ 1 callersMethodminKth
(int[] arr, int index)
src/class29/Code02_MaxTopK.java:106
↓ 1 callersMethodminKth1
(int[] arr, int k)
src/class29/Code01_FindMinKth.java:18
↓ 1 callersMethodminKth2
(int[] array, int k)
src/class29/Code01_FindMinKth.java:34
↓ 1 callersMethodminKth3
(int[] array, int k)
src/class29/Code01_FindMinKth.java:90
↓ 1 callersMethodminLight1
(String road)
src/class14/Code01_Light.java:7
↓ 1 callersMethodminLight2
(String road)
src/class14/Code01_Light.java:40
↓ 1 callersMethodminLight3
(String road)
src/class14/Code01_Light.java:66
↓ 1 callersMethodminMoney2
(int[] d, int[] p)
src/class38/Code04_MoneyProblem.java:54
↓ 1 callersMethodminPathSum1
(int[][] m)
src/class21/Code01_MinPathSum.java:5
↓ 1 callersMethodminPathSum2
(int[][] m)
src/class21/Code01_MinPathSum.java:27
↓ 1 callersMethodminTime1
(int[] arr, int n, int a, int b)
src/class20/Code03_Coffee.java:81
↓ 1 callersMethodminTime2
(int[] arr, int n, int a, int b)
src/class20/Code03_Coffee.java:118
↓ 1 callersMethodminus
(String s1, String s2)
src/class19/Code03_StickersToSpellWord.java:30
↓ 1 callersMethodmoreThan
(int[] pre, int[] last)
src/class45/Code02_CreateMaximumNumber.java:62
↓ 1 callersMethodmorrisIn
(Node head)
src/class30/Code01_MorrisTraversal.java:78
↓ 1 callersMethodmorrisPos
(Node head)
src/class30/Code01_MorrisTraversal.java:104
← previousnext →601–700 of 1,411, ranked by callers