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 callersMethoddoubleSize
()
CHAPTER 10 PRIORITY QUEUE & HEAPS/Heap.java:83
↓ 1 callersMethodduplicateKDistance
(int arr[], int size, int k)
CHAPTER 5 SEARCHING/Searching.java:2215
↓ 1 callersMethodeditDist
(String str1, String str2)
CHAPTER 18 DYNAMIC PROGRAMMING/EditDist.java:7
↓ 1 callersMethodeditDistDP
(String str1, String str2)
CHAPTER 18 DYNAMIC PROGRAMMING/EditDist.java:30
↓ 1 callersMethodfactorial
(int i)
CHAPTER 1 ALGORITHMS ANALYSIS/Introduction.java:5
↓ 1 callersMethodfastestWayBU
(int a[][], int t[][], int e[], int x[], int n)
CHAPTER 18 DYNAMIC PROGRAMMING/ALS.java:21
↓ 1 callersMethodfastestWayBU2
(int a[][], int t[][], int e[], int x[], int n)
CHAPTER 18 DYNAMIC PROGRAMMING/ALS.java:2
↓ 1 callersMethodfastestWayTD
(int a[][], int t[][], int e[], int x[], int n)
CHAPTER 18 DYNAMIC PROGRAMMING/ALS.java:39
↓ 1 callersMethodfeasible
(int[] Q, int k)
CHAPTER 19 BACKTRACKING/NQueen.java:9
↓ 1 callersMethodfibonacci
(int n)
CHAPTER 1 ALGORITHMS ANALYSIS/Introduction.java:101
↓ 1 callersMethodfibonacci
(int n)
CHAPTER 18 DYNAMIC PROGRAMMING/Fibo.java:2
↓ 1 callersMethodfibonacciBU
(int n)
CHAPTER 18 DYNAMIC PROGRAMMING/Fibo.java:9
↓ 1 callersMethodfibonacciBU2
(int n)
CHAPTER 18 DYNAMIC PROGRAMMING/Fibo.java:24
↓ 1 callersMethodfibonacciTD
(int n)
CHAPTER 18 DYNAMIC PROGRAMMING/Fibo.java:39
↓ 1 callersMethodfind
(int data)
CHAPTER 9 TREE/RBTree.java:119
↓ 1 callersMethodfind
(int data)
CHAPTER 9 TREE/SPLAYTree.java:119
↓ 1 callersMethodfindBalancedPoint
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:2101
↓ 1 callersMethodfindCeil
(int arr[], int size, int value)
CHAPTER 5 SEARCHING/Searching.java:2150
↓ 1 callersMethodfindCelebrity
(int relation[][], int count)
CHAPTER 7 STACK/StackExercise.java:931
↓ 1 callersMethodfindCelebrity2
(int relation[][], int count)
CHAPTER 7 STACK/StackExercise.java:948
↓ 1 callersMethodfindCelebrity3
(int relation[][], int count)
CHAPTER 7 STACK/StackExercise.java:969
↓ 1 callersMethodfindDifference
(int arr[], int size, int value)
CHAPTER 5 SEARCHING/Searching.java:812
↓ 1 callersMethodfindDifference2
(int arr[], int size, int value)
CHAPTER 5 SEARCHING/Searching.java:824
↓ 1 callersMethodfindDuplicateParenthesis
(String expn, int size)
CHAPTER 7 STACK/StackExercise.java:714
↓ 1 callersMethodfindFirstIndex
(int[] arr, int start, int end, int key)
CHAPTER 5 SEARCHING/Searching.java:1543
↓ 1 callersMethodfindFloor
(int arr[], int size, int value)
CHAPTER 5 SEARCHING/Searching.java:2129
↓ 1 callersMethodfindIntersection
(LinkedList lst2)
CHAPTER 6 LINKED LIST/LinkedList.java:266
↓ 1 callersMethodfindKey
(Node node, int key)
CHAPTER 9 TREE/BTree.java:230
↓ 1 callersMethodfindKeyCount
(int[] arr, int size, int key)
CHAPTER 5 SEARCHING/Searching.java:1533
↓ 1 callersMethodfindKeyCount2
(int[] arr, int size, int key)
CHAPTER 5 SEARCHING/Searching.java:1574
↓ 1 callersMethodfindLargestIsland
(int[][] arr, int maxCol, int maxRow)
CHAPTER 8 QUEUE/QueueEx.java:521
↓ 1 callersMethodfindLargestIslandUtil
(int[][] arr, int maxCol, int maxRow, int currCol, int currRow, boolean[][] traversed)
CHAPTER 8 QUEUE/QueueEx.java:506
↓ 1 callersMethodfindLastIndex
(int[] arr, int start, int end, int key)
CHAPTER 5 SEARCHING/Searching.java:1559
↓ 1 callersMethodfindMax
()
CHAPTER 9 TREE/Tree.java:302
↓ 1 callersMethodfindMaxBT
()
CHAPTER 9 TREE/Tree.java:937
↓ 1 callersMethodfindMaxBitonicArray
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:1496
↓ 1 callersMethodfindMaxNode
(Node curr)
CHAPTER 9 TREE/Tree.java:314
↓ 1 callersMethodfindMedian
(int[] arrFirst, int sizeFirst, int[] arrSecond, int sizeSecond)
CHAPTER 5 SEARCHING/Searching.java:1694
↓ 1 callersMethodfindMin
()
CHAPTER 9 TREE/Tree.java:290
↓ 1 callersMethodfindMin
(Node curr)
CHAPTER 9 TREE/AVLTree.java:196
↓ 1 callersMethodfindMinDiff
(int arr[], int size)
CHAPTER 5 SEARCHING/Searching.java:852
↓ 1 callersMethodfindMinDiff2
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:864
↓ 1 callersMethodfindMinNode
(Node curr)
CHAPTER 9 TREE/SPLAYTree.java:164
↓ 1 callersMethodfindMissing
(int[] arr, int start, int end)
CHAPTER 11 HASH TABLE/HashTableExercise.java:65
↓ 1 callersMethodfindMissingNumber
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:302
↓ 1 callersMethodfindMissingNumber2
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:319
↓ 1 callersMethodfindMissingNumber3
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:328
↓ 1 callersMethodfindMissingNumber4
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:340
↓ 1 callersMethodfindMissingNumber5
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:353
↓ 1 callersMethodfindMissingNumber6
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:363
↓ 1 callersMethodfindMissingNumber7
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:378
↓ 1 callersMethodfindMissingNumber8
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:392
↓ 1 callersMethodfindPair
(int[] arr, int size, int value)
CHAPTER 5 SEARCHING/Searching.java:654
↓ 1 callersMethodfindPair2
(int[] arr, int size, int value)
CHAPTER 5 SEARCHING/Searching.java:666
↓ 1 callersMethodfindPair3
(int[] arr, int size, int value)
CHAPTER 5 SEARCHING/Searching.java:684
↓ 1 callersMethodfindPair4
(int[] arr, int size, int range, int value)
CHAPTER 5 SEARCHING/Searching.java:696
↓ 1 callersMethodfindPairTwoLists
(int[] arr1, int size1, int[] arr2, int size2, int value)
CHAPTER 5 SEARCHING/Searching.java:723
↓ 1 callersMethodfindPairTwoLists2
(int[] arr1, int size1, int[] arr2, int size2, int value)
CHAPTER 5 SEARCHING/Searching.java:735
↓ 1 callersMethodfindPairTwoLists3
(int[] arr1, int size1, int[] arr2, int size2, int value)
CHAPTER 5 SEARCHING/Searching.java:746
↓ 1 callersMethodfindPairTwoLists4
(int[] arr1, int size1, int[] arr2, int size2, int value)
CHAPTER 5 SEARCHING/Searching.java:764
↓ 1 callersMethodfindPairTwoLists5
(int[] arr1, int size1, int[] arr2, int size2, int range, int value)
CHAPTER 5 SEARCHING/Searching.java:778
↓ 1 callersMethodfindRotationMax2
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:1819
↓ 1 callersMethodfindTriplet
(int arr[], int size, int value)
CHAPTER 5 SEARCHING/Searching.java:1067
↓ 1 callersMethodfindTriplet2
(int arr[], int size, int value)
CHAPTER 5 SEARCHING/Searching.java:1076
↓ 1 callersMethodfindWays
(int n, int m, int V)
CHAPTER 18 DYNAMIC PROGRAMMING/DiceThrow.java:2
↓ 1 callersMethodfirstIndex
(int arr[], int size, int low, int high, int value)
CHAPTER 5 SEARCHING/Searching.java:1592
↓ 1 callersMethodfirstNegSlidingWindows
(int arr[], int size, int k)
CHAPTER 8 QUEUE/QueueEx.java:193
↓ 1 callersMethodfirstRepeated
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:149
↓ 1 callersMethodfirstRepeated2
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:160
↓ 1 callersMethodfixBTree
(Node node, int index)
CHAPTER 9 TREE/BTree.java:303
↓ 1 callersMethodfixDoubleBlack
(Node x)
CHAPTER 9 TREE/RBTree.java:263
↓ 1 callersMethodfixPoint
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:2397
↓ 1 callersMethodfixPoint2
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:2406
↓ 1 callersMethodfixRedRed
(Node x)
CHAPTER 9 TREE/RBTree.java:152
↓ 1 callersMethodfloorBST
(double val)
CHAPTER 9 TREE/Tree.java:901
↓ 1 callersMethodfloydWarshall
(int graph[][], int V)
CHAPTER 18 DYNAMIC PROGRAMMING/FloydWarshall.java:5
↓ 1 callersMethodfloydWarshall
()
CHAPTER 12 GRAPHS/Graph.java:1327
↓ 1 callersMethodfrequencyCounts
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:2237
↓ 1 callersMethodfrequencyCounts2
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:2251
↓ 1 callersMethodfrequencyCounts3
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:2266
↓ 1 callersMethodfrequencyCounts4
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:2279
↓ 1 callersMethodfun1
(int n)
CHAPTER 1 ALGORITHMS ANALYSIS/Analysis.java:3
↓ 1 callersMethodfun10
(int n)
CHAPTER 1 ALGORITHMS ANALYSIS/Analysis.java:95
↓ 1 callersMethodfun11
(int n)
CHAPTER 1 ALGORITHMS ANALYSIS/Analysis.java:105
↓ 1 callersMethodfun12
(int n)
CHAPTER 1 ALGORITHMS ANALYSIS/Analysis.java:120
↓ 1 callersMethodfun13
(int n)
CHAPTER 1 ALGORITHMS ANALYSIS/Analysis.java:130
↓ 1 callersMethodfun2
(int n)
CHAPTER 1 ALGORITHMS ANALYSIS/Analysis.java:11
↓ 1 callersMethodfun3
(int n)
CHAPTER 1 ALGORITHMS ANALYSIS/Analysis.java:21
↓ 1 callersMethodfun4
(int n)
CHAPTER 1 ALGORITHMS ANALYSIS/Analysis.java:33
↓ 1 callersMethodfun5
(int n)
CHAPTER 1 ALGORITHMS ANALYSIS/Analysis.java:45
↓ 1 callersMethodfun6
(int n)
CHAPTER 1 ALGORITHMS ANALYSIS/Analysis.java:55
↓ 1 callersMethodfun7
(int n)
CHAPTER 1 ALGORITHMS ANALYSIS/Analysis.java:65
↓ 1 callersMethodfun8
(int n)
CHAPTER 1 ALGORITHMS ANALYSIS/Analysis.java:75
↓ 1 callersMethodfun9
(int n)
CHAPTER 1 ALGORITHMS ANALYSIS/Analysis.java:85
↓ 1 callersMethodfunction1
()
CHAPTER 7 STACK/StackExercise.java:12
↓ 1 callersMethodfunction2
()
CHAPTER 7 STACK/StackExercise.java:8
↓ 1 callersMethodgcd
(int m, int n)
CHAPTER 1 ALGORITHMS ANALYSIS/Introduction.java:82
↓ 1 callersMethodget
(int key)
CHAPTER 11 HASH TABLE/HashTableSC.java:83
↓ 1 callersMethodget
(int key)
CHAPTER 11 HASH TABLE/HashTableLP.java:71
↓ 1 callersMethodgetHeight
(int[] arr, int[] height, int index)
CHAPTER 12 GRAPHS/Graph.java:1099
← previousnext →301–400 of 1,174, ranked by callers