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
↓ 3 callersMethodcreateCompleteBinaryTree
(int[] arr)
CHAPTER 9 TREE/Tree.java:30
↓ 3 callersMethoddelete
(int data)
CHAPTER 9 TREE/AVLTree.java:143
↓ 3 callersMethoddfsUtil2
(int index, boolean[] visited, Stack<Integer> stk)
CHAPTER 12 GRAPHS/Graph.java:97
↓ 3 callersMethodfind
(Node curr, String word, int wordIndex)
CHAPTER 13 STRING ALGORITHMS/TST.java:36
↓ 3 callersMethodfind
(String str)
CHAPTER 13 STRING ALGORITHMS/Trie.java:63
↓ 3 callersMethodfind
(String value)
CHAPTER 13 STRING ALGORITHMS/StringTree.java:46
↓ 3 callersMethodisEmpty
()
CHAPTER 7 STACK/StackLL.java:19
↓ 3 callersMethodisEmpty
()
CHAPTER 6 LINKED LIST/DoublyLinkedList.java:23
↓ 3 callersMethodisEmpty
()
CHAPTER 6 LINKED LIST/DoublyCircularLinkedList.java:24
↓ 3 callersMethodjoinParentChild
(Node u, Node v)
CHAPTER 9 TREE/RBTree.java:340
↓ 3 callersMethodlcaBST
(int first, int second)
CHAPTER 9 TREE/Tree.java:832
↓ 3 callersMethodmatchExpDP
(String exp, String str)
CHAPTER 18 DYNAMIC PROGRAMMING/WildCharMatch.java:22
↓ 3 callersMethodmax
(int first, int second)
CHAPTER 9 TREE/rangeMaxST.java:32
↓ 3 callersMethodmerge
(Node node, int index)
CHAPTER 9 TREE/BTree.java:384
↓ 3 callersMethodmin
(int first, int second)
CHAPTER 9 TREE/rmqST.java:32
↓ 3 callersMethodminCoinsBU
(int[] coins, int n, int val)
CHAPTER 18 DYNAMIC PROGRAMMING/CoinChange.java:61
↓ 3 callersMethodmyStrcmp
(String a, String b)
CHAPTER 13 STRING ALGORITHMS/StringEx.java:3
↓ 3 callersMethodnumNodes
()
CHAPTER 9 TREE/Tree.java:464
↓ 3 callersMethodpercolateDown
(int parent)
CHAPTER 10 PRIORITY QUEUE & HEAPS/Heap.java:31
↓ 3 callersMethodpop
()
CHAPTER 7 STACK/StackLL.java:35
↓ 3 callersMethodprint
()
CHAPTER 13 STRING ALGORITHMS/StringTree.java:11
↓ 3 callersMethodprint
()
CHAPTER 10 PRIORITY QUEUE & HEAPS/KthLargestStream.java:23
↓ 3 callersMethodprint
()
CHAPTER 6 LINKED LIST/Polynomial.java:64
↓ 3 callersMethodprintArray
(int[] arr, int n)
CHAPTER 19 BACKTRACKING/Permutations.java:2
↓ 3 callersMethodprintPath
(int[] previous, int[] dist, int count, int source)
CHAPTER 12 GRAPHS/Graph.java:966
↓ 3 callersMethodprintTree
()
CHAPTER 9 TREE/RBTree.java:32
↓ 3 callersMethodpush
(T obj)
CHAPTER 3 ABSTRACT DATA TYPE/Stack.java:7
↓ 3 callersMethodpush1
(int value)
CHAPTER 7 STACK/TwoStack.java:13
↓ 3 callersMethodpush2
(int value)
CHAPTER 7 STACK/TwoStack.java:21
↓ 3 callersMethodreverseStringUtil
(char[] a)
CHAPTER 13 STRING ALGORITHMS/StringEx.java:255
↓ 3 callersMethodsum
(int[] freq, int i, int j)
CHAPTER 18 DYNAMIC PROGRAMMING/OptimalBST.java:50
↓ 3 callersMethodswap
(int[] arr, int first, int second)
CHAPTER 17 DIVIDE AND CONQUER/NutsAndBolts.java:24
↓ 3 callersMethodswap
(int[] arr, int first, int second)
CHAPTER 5 SEARCHING/Searching.java:143
↓ 3 callersMethodtreeDepth
()
CHAPTER 9 TREE/Tree.java:375
↓ 3 callersMethodunion
(int[] parent, int x, int y)
CHAPTER 12 GRAPHS/Graph.java:461
↓ 2 callersMethodKMPPreprocess
(char[] pattern, int[] ShiftArr)
CHAPTER 13 STRING ALGORITHMS/StringMatching.java:64
↓ 2 callersMethodadd
(int value)
CHAPTER 10 PRIORITY QUEUE & HEAPS/KthLargestStream.java:13
↓ 2 callersMethodadd
(Polynomial poly2)
CHAPTER 6 LINKED LIST/Polynomial.java:36
↓ 2 callersMethodbinarySearchRec
(int[] arr, int size, int value)
CHAPTER 5 SEARCHING/Searching.java:46
↓ 2 callersMethodbottomInsert
(Stack<Integer> stk, int element)
CHAPTER 7 STACK/StackExercise.java:434
↓ 2 callersMethodclosestPairBF
(int[][] arr)
CHAPTER 17 DIVIDE AND CONQUER/ClosestPair.java:15
↓ 2 callersMethodclosestPairDC
(int[][] arr)
CHAPTER 17 DIVIDE AND CONQUER/ClosestPair.java:90
↓ 2 callersMethodcompareList
(LinkedList ll)
CHAPTER 6 LINKED LIST/LinkedList.java:186
↓ 2 callersMethodcompareList2
(LinkedList ll2)
CHAPTER 6 LINKED LIST/LinkedList.java:199
↓ 2 callersMethodcopyList
()
CHAPTER 6 LINKED LIST/LinkedList.java:162
↓ 2 callersMethodcopyListReversed
()
CHAPTER 6 LINKED LIST/LinkedList.java:148
↓ 2 callersMethodcountRotation
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:1832
↓ 2 callersMethoddelete
(int data)
CHAPTER 9 TREE/RBTree.java:214
↓ 2 callersMethoddelete
(int data)
CHAPTER 9 TREE/SPLAYTree.java:175
↓ 2 callersMethoddistance
(Point a, Point b)
CHAPTER 17 DIVIDE AND CONQUER/ClosestPair.java:30
↓ 2 callersMethodfibonacciSearch
(int[] arr, int size, int value)
CHAPTER 5 SEARCHING/Searching.java:82
↓ 2 callersMethodfind
(int key)
CHAPTER 11 HASH TABLE/HashTableSC.java:71
↓ 2 callersMethodfind
(int key)
CHAPTER 11 HASH TABLE/HashTableLP.java:55
↓ 2 callersMethodfindLength
()
CHAPTER 6 LINKED LIST/LinkedList.java:215
↓ 2 callersMethodfindMinNode
(Node curr)
CHAPTER 9 TREE/Tree.java:326
↓ 2 callersMethodfindRotationMax
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:1797
↓ 2 callersMethodfindRotationMaxUtil
(int arr[], int start, int end)
CHAPTER 5 SEARCHING/Searching.java:1804
↓ 2 callersMethodgetBalance
(Node node)
CHAPTER 9 TREE/AVLTree.java:29
↓ 2 callersMethodgetMedian
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:1427
↓ 2 callersMethodgreater
(int value1, int value2)
CHAPTER 4 SORTING/BubbleSort.java:6
↓ 2 callersMethodhamiltonianCycle
()
CHAPTER 12 GRAPHS/GraphAM.java:329
↓ 2 callersMethodhamiltonianPath
()
CHAPTER 12 GRAPHS/GraphAM.java:257
↓ 2 callersMethodheapSort
(int[] array, boolean inc)
CHAPTER 10 PRIORITY QUEUE & HEAPS/Heap.java:142
↓ 2 callersMethodinfixToPostfix
(String expn)
CHAPTER 7 STACK/StackExercise.java:127
↓ 2 callersMethodisAnagram
(char[] str1, char[] str2)
CHAPTER 11 HASH TABLE/HashTableExercise.java:6
↓ 2 callersMethodisBSTArray
(int preorder[])
CHAPTER 9 TREE/Tree.java:986
↓ 2 callersMethodisCompleteTree
()
CHAPTER 9 TREE/Tree.java:675
↓ 2 callersMethodisCyclePresent
()
CHAPTER 12 GRAPHS/Graph.java:569
↓ 2 callersMethodisCyclePresentColour
()
CHAPTER 12 GRAPHS/Graph.java:597
↓ 2 callersMethodisCyclePresentUndirected
()
CHAPTER 12 GRAPHS/Graph.java:443
↓ 2 callersMethodisCyclePresentUndirected2
()
CHAPTER 12 GRAPHS/Graph.java:465
↓ 2 callersMethodisCyclePresentUndirected3
()
CHAPTER 12 GRAPHS/Graph.java:494
↓ 2 callersMethodisEulerian
()
CHAPTER 12 GRAPHS/Graph.java:1153
↓ 2 callersMethodisPalindrome
(String str)
CHAPTER 13 STRING ALGORITHMS/StringEx.java:206
↓ 2 callersMethodisPrime
(int n)
CHAPTER 20 COMPLEXITY THEORY/IsPrime.java:2
↓ 2 callersMethodisUniqueChar
(String str)
CHAPTER 13 STRING ALGORITHMS/StringEx.java:105
↓ 2 callersMethodleftRightRotate
(Node x)
CHAPTER 9 TREE/AVLTree.java:138
↓ 2 callersMethodlinearSearchSorted
(int[] arr, int size, int value)
CHAPTER 5 SEARCHING/Searching.java:15
↓ 2 callersMethodlinearSearchUnsorted
(int[] arr, int size, int value)
CHAPTER 5 SEARCHING/Searching.java:6
↓ 2 callersMethodloopDetect2
()
CHAPTER 6 LINKED LIST/LinkedList.java:447
↓ 2 callersMethodlowerUpper
(char s)
CHAPTER 13 STRING ALGORITHMS/StringEx.java:153
↓ 2 callersMethodmatchExp
(String exp, String str)
CHAPTER 18 DYNAMIC PROGRAMMING/WildCharMatch.java:2
↓ 2 callersMethodmaxVal
(int[][] max, int i, int j)
CHAPTER 18 DYNAMIC PROGRAMMING/MinCostBinaryTree.java:5
↓ 2 callersMethodmin
(int x, int y, int z)
CHAPTER 18 DYNAMIC PROGRAMMING/GridMinCost.java:2
↓ 2 callersMethodminCoins
(int[] coins, int n, int val)
CHAPTER 18 DYNAMIC PROGRAMMING/CoinChange.java:4
↓ 2 callersMethodminCoins2
(int[] coins, int n, int val)
CHAPTER 18 DYNAMIC PROGRAMMING/CoinChange.java:22
↓ 2 callersMethodminDiffPair
(int arr1[], int size1, int arr2[], int size2)
CHAPTER 5 SEARCHING/Searching.java:884
↓ 2 callersMethodnthNodeFromBeginning
(int index)
CHAPTER 6 LINKED LIST/LinkedList.java:225
↓ 2 callersMethodparent
(Node node)
CHAPTER 9 TREE/SPLAYTree.java:84
↓ 2 callersMethodpartition
(int[] arr, int low, int high, int pivot)
CHAPTER 17 DIVIDE AND CONQUER/NutsAndBolts.java:31
↓ 2 callersMethodpeek
()
CHAPTER 3 ABSTRACT DATA TYPE/Queue.java:15
↓ 2 callersMethodpercolateUp
(int child)
CHAPTER 10 PRIORITY QUEUE & HEAPS/Heap.java:50
↓ 2 callersMethodpop1
()
CHAPTER 7 STACK/TwoStack.java:29
↓ 2 callersMethodpop2
()
CHAPTER 7 STACK/TwoStack.java:39
↓ 2 callersMethodprecedence
(char x)
CHAPTER 7 STACK/StackExercise.java:112
↓ 2 callersMethodprintArray
(int[] arr)
CHAPTER 17 DIVIDE AND CONQUER/NutsAndBolts.java:46
↓ 2 callersMethodprintArray
(int[] arr)
CHAPTER 4 SORTING/RadixSort.java:47
↓ 2 callersMethodprintParenthesisNumber
(String expn, int size)
CHAPTER 7 STACK/StackExercise.java:744
↓ 2 callersMethodprintSolution
(int[] colour, int V)
CHAPTER 19 BACKTRACKING/GraphColouring.java:2
↓ 2 callersMethodprintTree
()
CHAPTER 9 TREE/BTree.java:27
← previousnext →101–200 of 1,174, ranked by callers