MCPcopy Create free account

hub / github.com/Hemant-Jain-Author/Problem-Solving-in-Data-Structures-Algorithms-using-Java / functions

Functions1,174 in github.com/Hemant-Jain-Author/Problem-Solving-in-Data-Structures-Algorithms-using-Java

⨍ Functions 1,174◇ Types & classes 150
↓ 1 callersMethodmain50
()
CHAPTER 5 SEARCHING/Searching.java:2609
↓ 1 callersMethodmain51
()
CHAPTER 5 SEARCHING/Searching.java:2658
↓ 1 callersMethodmain52
()
CHAPTER 5 SEARCHING/Searching.java:2699
↓ 1 callersMethodmain53
()
CHAPTER 5 SEARCHING/Searching.java:2726
↓ 1 callersMethodmain6
()
CHAPTER 7 STACK/StackExercise.java:268
↓ 1 callersMethodmain6
()
CHAPTER 8 QUEUE/QueueEx.java:213
↓ 1 callersMethodmain6
()
CHAPTER 9 TREE/Tree.java:1211
↓ 1 callersMethodmain6
()
CHAPTER 13 STRING ALGORITHMS/StringEx.java:162
↓ 1 callersMethodmain6
()
CHAPTER 4 SORTING/SortingEx.java:253
↓ 1 callersMethodmain6
()
CHAPTER 6 LINKED LIST/LinkedList.java:653
↓ 1 callersMethodmain7
()
CHAPTER 7 STACK/StackExercise.java:332
↓ 1 callersMethodmain7
()
CHAPTER 8 QUEUE/QueueEx.java:319
↓ 1 callersMethodmain7
()
CHAPTER 9 TREE/Tree.java:1227
↓ 1 callersMethodmain7
()
CHAPTER 13 STRING ALGORITHMS/StringEx.java:198
↓ 1 callersMethodmain7
()
CHAPTER 4 SORTING/SortingEx.java:309
↓ 1 callersMethodmain7
()
CHAPTER 6 LINKED LIST/LinkedList.java:672
↓ 1 callersMethodmain7a
()
CHAPTER 7 STACK/StackExercise.java:351
↓ 1 callersMethodmain8
()
CHAPTER 7 STACK/StackExercise.java:370
↓ 1 callersMethodmain8
()
CHAPTER 8 QUEUE/QueueEx.java:395
↓ 1 callersMethodmain8
()
CHAPTER 13 STRING ALGORITHMS/StringEx.java:221
↓ 1 callersMethodmain8
()
CHAPTER 4 SORTING/SortingEx.java:345
↓ 1 callersMethodmain8
()
CHAPTER 6 LINKED LIST/LinkedList.java:693
↓ 1 callersMethodmain9
()
CHAPTER 7 STACK/StackExercise.java:407
↓ 1 callersMethodmain9
()
CHAPTER 8 QUEUE/QueueEx.java:492
↓ 1 callersMethodmain9
()
CHAPTER 13 STRING ALGORITHMS/StringEx.java:243
↓ 1 callersMethodmain9
()
CHAPTER 4 SORTING/SortingEx.java:393
↓ 1 callersMethodmain9
()
CHAPTER 6 LINKED LIST/LinkedList.java:714
↓ 1 callersMethodmakeLoop
()
CHAPTER 6 LINKED LIST/LinkedList.java:421
↓ 1 callersMethodmakePairs
(int[] nuts, int[] bolts)
CHAPTER 17 DIVIDE AND CONQUER/NutsAndBolts.java:2
↓ 1 callersMethodmatchExp
(String src, String ptn)
CHAPTER 13 STRING ALGORITHMS/StringEx.java:402
↓ 1 callersMethodmatchExpUtil
(char[] exp, char[] str, int i, int j)
CHAPTER 13 STRING ALGORITHMS/StringEx.java:408
↓ 1 callersMethodmatchExpUtil
(char[] exp, char[] str, int m, int n)
CHAPTER 18 DYNAMIC PROGRAMMING/WildCharMatch.java:6
↓ 1 callersMethodmatchExpUtilDP
(char[] exp, char[] str, int m, int n)
CHAPTER 18 DYNAMIC PROGRAMMING/WildCharMatch.java:26
↓ 1 callersMethodmatchPattern
(String src, String ptn)
CHAPTER 13 STRING ALGORITHMS/StringEx.java:37
↓ 1 callersMethodmaxActivities
(int s[], int f[], int n)
CHAPTER 16 GREEDY ALGORITHM/ActivitySelection.java:24
↓ 1 callersMethodmaxConSub
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:2461
↓ 1 callersMethodmaxConSubArr
(int[] A, int sizeA, int[] B, int sizeB)
CHAPTER 5 SEARCHING/Searching.java:2474
↓ 1 callersMethodmaxConSubArr2
(int A[], int sizeA, int B[], int sizeB)
CHAPTER 5 SEARCHING/Searching.java:2496
↓ 1 callersMethodmaxCost01Knapsack
(int[] wt, int[] cost, int capacity)
CHAPTER 18 DYNAMIC PROGRAMMING/Knapsack.java:2
↓ 1 callersMethodmaxCost01KnapsackBU
(int[] wt, int[] cost, int capacity)
CHAPTER 18 DYNAMIC PROGRAMMING/Knapsack.java:47
↓ 1 callersMethodmaxCost01KnapsackTD
(int[] wt, int[] cost, int capacity)
CHAPTER 18 DYNAMIC PROGRAMMING/Knapsack.java:23
↓ 1 callersMethodmaxCost01KnapsackUtil
(int[] wt, int[] cost, int n, int capacity)
CHAPTER 18 DYNAMIC PROGRAMMING/Knapsack.java:7
↓ 1 callersMethodmaxDepthParenthesis
(String expn, int size)
CHAPTER 7 STACK/StackExercise.java:579
↓ 1 callersMethodmaxDepthParenthesis2
(String expn, int size)
CHAPTER 7 STACK/StackExercise.java:601
↓ 1 callersMethodmaxLengthPathBT
()
CHAPTER 9 TREE/Tree.java:489
↓ 1 callersMethodmaxOfMinSlidingWindows
(int arr[], int size, int k)
CHAPTER 8 QUEUE/QueueEx.java:165
↓ 1 callersMethodmaxPathSum
(int[] arr1, int size1, int[] arr2, int size2)
CHAPTER 5 SEARCHING/Searching.java:2668
↓ 1 callersMethodmaxProfit
(int[] arr)
CHAPTER 18 DYNAMIC PROGRAMMING/StockBuySell.java:2
↓ 1 callersMethodmaxProfit
(int stocks[], int size)
CHAPTER 5 SEARCHING/Searching.java:1643
↓ 1 callersMethodmaxProfit2
(int[] arr)
CHAPTER 18 DYNAMIC PROGRAMMING/StockBuySell.java:28
↓ 1 callersMethodmaxProfit2
(int stocks[], int size)
CHAPTER 5 SEARCHING/Searching.java:1661
↓ 1 callersMethodmaxProfitTC
(int[] arr, int t)
CHAPTER 18 DYNAMIC PROGRAMMING/StockBuySell.java:15
↓ 1 callersMethodmaxProfitTC2
(int[] arr, int t)
CHAPTER 18 DYNAMIC PROGRAMMING/StockBuySell.java:41
↓ 1 callersMethodmaxRobbery
(int[] house)
CHAPTER 18 DYNAMIC PROGRAMMING/HouseRobber.java:2
↓ 1 callersMethodmaxRobbery2
(int[] house)
CHAPTER 18 DYNAMIC PROGRAMMING/HouseRobber.java:14
↓ 1 callersMethodmaxSlidingWindows
(int arr[], int size, int k)
CHAPTER 8 QUEUE/QueueEx.java:93
↓ 1 callersMethodmaxSlidingWindows2
(int arr[], int size, int k)
CHAPTER 8 QUEUE/QueueEx.java:104
↓ 1 callersMethodmaxSubArraySum
(int[] a, int size)
CHAPTER 5 SEARCHING/Searching.java:2709
↓ 1 callersMethodmaxValueJobUtil
(Job[] arr, int n)
CHAPTER 18 DYNAMIC PROGRAMMING/JobScheduling.java:19
↓ 1 callersMethodmaxValueJobUtilTD
(int[] dp, Job[] arr, int n)
CHAPTER 18 DYNAMIC PROGRAMMING/JobScheduling.java:47
↓ 1 callersMethodmaxValueJobs
(int s[], int f[], int[] v, int n)
CHAPTER 18 DYNAMIC PROGRAMMING/JobScheduling.java:39
↓ 1 callersMethodmaxValueJobsBU
(int s[], int f[], int[] v, int n)
CHAPTER 18 DYNAMIC PROGRAMMING/JobScheduling.java:80
↓ 1 callersMethodmaxValueJobsTD
(int s[], int f[], int[] v, int n)
CHAPTER 18 DYNAMIC PROGRAMMING/JobScheduling.java:71
↓ 1 callersMethodmerge
(int lists[], int size)
CHAPTER 16 GREEDY ALGORITHM/OptimalMergePattern.java:4
↓ 1 callersMethodmerge
(int[] arr1, int size1, int[] arr2, int size2)
CHAPTER 4 SORTING/SortingEx.java:319
↓ 1 callersMethodmerge
(int[] arr, int[] tempArray, int lowerIndex, int middleIndex, int upperIndex)
CHAPTER 4 SORTING/MergeSort.java:2
↓ 1 callersMethodmergeSrt
(int[] arr, int[] tempArray, int lowerIndex, int upperIndex)
CHAPTER 4 SORTING/MergeSort1.java:2
↓ 1 callersMethodmergeSrt
(int[] arr, int[] tempArray, int lowerIndex, int upperIndex)
CHAPTER 4 SORTING/MergeSort.java:26
↓ 1 callersMethodminAbsDiffAdjCircular
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:1893
↓ 1 callersMethodminAbsSumPair
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:588
↓ 1 callersMethodminAbsSumPair2
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:612
↓ 1 callersMethodminCoinsBU2
(int[] coins, int n, int val)
CHAPTER 18 DYNAMIC PROGRAMMING/CoinChange.java:90
↓ 1 callersMethodminCoinsTD
(int[] coins, int n, int val)
CHAPTER 18 DYNAMIC PROGRAMMING/CoinChange.java:37
↓ 1 callersMethodminCost
(int cost[][], int m, int n)
CHAPTER 18 DYNAMIC PROGRAMMING/GridMinCost.java:7
↓ 1 callersMethodminCostBU
(int cost[][], int m, int n)
CHAPTER 18 DYNAMIC PROGRAMMING/GridMinCost.java:17
↓ 1 callersMethodminCostBstBU
(int[] arr)
CHAPTER 18 DYNAMIC PROGRAMMING/MinCostBinaryTree.java:45
↓ 1 callersMethodminCostBstTD
(int[][] dp, int[][] max, int i, int j, int[] arr)
CHAPTER 18 DYNAMIC PROGRAMMING/MinCostBinaryTree.java:15
↓ 1 callersMethodminCostTravel
(int[] days, int[] costs)
CHAPTER 18 DYNAMIC PROGRAMMING/Vacation.java:3
↓ 1 callersMethodminOfMaxSlidingWindows
(int arr[], int size, int k)
CHAPTER 8 QUEUE/QueueEx.java:137
↓ 1 callersMethodminStairCost
(int cost[], int n)
CHAPTER 18 DYNAMIC PROGRAMMING/MinStairCost.java:2
↓ 1 callersMethodminSwaps
(int arr[], int size, int val)
CHAPTER 4 SORTING/SortingEx.java:132
↓ 1 callersMethodminimum
(Node node)
CHAPTER 9 TREE/RBTree.java:351
↓ 1 callersMethodmissingValues
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:425
↓ 1 callersMethodmissingValues2
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:450
↓ 1 callersMethodmissingValues3
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:466
↓ 1 callersMethodmyAtoi
(String str)
CHAPTER 13 STRING ALGORITHMS/StringEx.java:90
↓ 1 callersMethodnQueens
(int[] Q, int k, int n)
CHAPTER 19 BACKTRACKING/NQueen.java:18
↓ 1 callersMethodnextLargerElement
(int[] arr, int size)
CHAPTER 7 STACK/StackExercise.java:777
↓ 1 callersMethodnextLargerElement2
(int[] arr, int size)
CHAPTER 7 STACK/StackExercise.java:797
↓ 1 callersMethodnextLargerElementCircular
(int[] arr, int size)
CHAPTER 7 STACK/StackExercise.java:877
↓ 1 callersMethodnextLargerElementCircular2
(int[] arr, int size)
CHAPTER 7 STACK/StackExercise.java:894
↓ 1 callersMethodnextSmallerElement
(int[] arr, int size)
CHAPTER 7 STACK/StackExercise.java:822
↓ 1 callersMethodnextSmallerElement2
(int[] arr, int size)
CHAPTER 7 STACK/StackExercise.java:839
↓ 1 callersMethodnthInOrder
(int index)
CHAPTER 9 TREE/Tree.java:137
↓ 1 callersMethodnthNodeFromEnd
(int index)
CHAPTER 6 LINKED LIST/LinkedList.java:237
↓ 1 callersMethodnthNodeFromEnd2
(int index)
CHAPTER 6 LINKED LIST/LinkedList.java:247
↓ 1 callersMethodnthPostOrder
(int index)
CHAPTER 9 TREE/Tree.java:108
↓ 1 callersMethodnthPreOrder
(int index)
CHAPTER 9 TREE/Tree.java:79
↓ 1 callersMethodnumFullNodesBT
()
CHAPTER 9 TREE/Tree.java:475
↓ 1 callersMethodnumLeafNodes
()
CHAPTER 9 TREE/Tree.java:516
← previousnext →601–700 of 1,174, ranked by callers