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 callersMethodnumberOfTriangles
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:1244
↓ 1 callersMethodnumberOfTriangles2
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:1257
↓ 1 callersMethododdCount
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:499
↓ 1 callersMethododdCount2
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:507
↓ 1 callersMethododdCount3
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:523
↓ 1 callersMethodoptBstCost
(int[] freq, int i, int j)
CHAPTER 18 DYNAMIC PROGRAMMING/OptimalBST.java:4
↓ 1 callersMethodoptBstCostBU
(int[] keys, int[] freq)
CHAPTER 18 DYNAMIC PROGRAMMING/OptimalBST.java:71
↓ 1 callersMethodoptBstCostBU2
(int[] keys, int[] freq)
CHAPTER 18 DYNAMIC PROGRAMMING/OptimalBST.java:93
↓ 1 callersMethodoptBstCostTD
(int[] keys, int[] freq)
CHAPTER 18 DYNAMIC PROGRAMMING/OptimalBST.java:23
↓ 1 callersMethodorEx
(int a, int b)
CHAPTER 5 SEARCHING/BitManipulation.java:6
↓ 1 callersMethodpartition01
(int[] arr, int size)
CHAPTER 4 SORTING/SortingEx.java:21
↓ 1 callersMethodpartition012
(int[] arr, int size)
CHAPTER 4 SORTING/SortingEx.java:67
↓ 1 callersMethodpartition012_
(int[] arr, int size)
CHAPTER 4 SORTING/SortingEx.java:40
↓ 1 callersMethodpathExist
(int source, int dest)
CHAPTER 12 GRAPHS/Graph.java:195
↓ 1 callersMethodpeek
()
CHAPTER 6 LINKED LIST/CircularLinkedList.java:23
↓ 1 callersMethodpeek
()
CHAPTER 6 LINKED LIST/LinkedList.java:28
↓ 1 callersMethodpeekHead
()
CHAPTER 6 LINKED LIST/DoublyCircularLinkedList.java:28
↓ 1 callersMethodpermutation
(int[] arr, int i, int length)
CHAPTER 19 BACKTRACKING/Permutations.java:14
↓ 1 callersMethodpermutation2
(int[] arr, int i, int length)
CHAPTER 19 BACKTRACKING/Permutations.java:44
↓ 1 callersMethodpermutation3
(int[] arr, int i, int length)
CHAPTER 19 BACKTRACKING/Permutations.java:65
↓ 1 callersMethodpop
()
CHAPTER 3 ABSTRACT DATA TYPE/Stack.java:11
↓ 1 callersMethodpop2
()
CHAPTER 7 STACK/Stack.java:86
↓ 1 callersMethodpostfixEvaluate
(String expn)
CHAPTER 7 STACK/StackExercise.java:71
↓ 1 callersMethodprimsMST
()
CHAPTER 12 GRAPHS/Graph.java:769
↓ 1 callersMethodprimsMST
()
CHAPTER 12 GRAPHS/GraphAM.java:135
↓ 1 callersMethodprint
()
CHAPTER 7 STACK/StackLL.java:55
↓ 1 callersMethodprint
()
CHAPTER 16 GREEDY ALGORITHM/JobSequencing.java:33
↓ 1 callersMethodprint
()
CHAPTER 11 HASH TABLE/HashTableLP.java:105
↓ 1 callersMethodprintAllPath
()
CHAPTER 9 TREE/Tree.java:782
↓ 1 callersMethodprintAllPath
(int src, int dest)
CHAPTER 12 GRAPHS/Graph.java:239
↓ 1 callersMethodprintAllPathDFS
(boolean[] visited, int source, int dest, Stack<Integer> path)
CHAPTER 12 GRAPHS/Graph.java:222
↓ 1 callersMethodprintAllPathUtil
(Node curr, Stack<Integer> stk)
CHAPTER 9 TREE/Tree.java:787
↓ 1 callersMethodprintAnagram
(String str)
CHAPTER 13 STRING ALGORITHMS/StringEx.java:306
↓ 1 callersMethodprintArray
(char[] arr, int n)
CHAPTER 13 STRING ALGORITHMS/StringEx.java:324
↓ 1 callersMethodprintBreadthFirst
()
CHAPTER 9 TREE/Tree.java:154
↓ 1 callersMethodprintCoins
(int cvalue[], int val)
CHAPTER 18 DYNAMIC PROGRAMMING/CoinChange.java:84
↓ 1 callersMethodprintCoinsUtil
(int cvalue[], int val)
CHAPTER 18 DYNAMIC PROGRAMMING/CoinChange.java:77
↓ 1 callersMethodprintDepthFirst
()
CHAPTER 9 TREE/Tree.java:171
↓ 1 callersMethodprintFirstRepeating
(int[] arr)
CHAPTER 11 HASH TABLE/HashTableExercise.java:108
↓ 1 callersMethodprintInRange
(int min, int max)
CHAPTER 9 TREE/Tree.java:884
↓ 1 callersMethodprintInt
(int number, int base)
CHAPTER 1 ALGORITHMS ANALYSIS/Introduction.java:31
↓ 1 callersMethodprintInt10
(int number)
CHAPTER 1 ALGORITHMS ANALYSIS/Introduction.java:22
↓ 1 callersMethodprintItems
(int[][] dp, int[] wt, int[] cost, int n, int capacity)
CHAPTER 18 DYNAMIC PROGRAMMING/Knapsack.java:70
↓ 1 callersMethodprintLargerHalf
(int[] arr, int size)
CHAPTER 10 PRIORITY QUEUE & HEAPS/HeapEx.java:210
↓ 1 callersMethodprintLargerHalf2
(int[] arr, int size)
CHAPTER 10 PRIORITY QUEUE & HEAPS/HeapEx.java:217
↓ 1 callersMethodprintLargerHalf3
(int[] arr, int size)
CHAPTER 10 PRIORITY QUEUE & HEAPS/HeapEx.java:228
↓ 1 callersMethodprintLevelOrderLineByLine
()
CHAPTER 9 TREE/Tree.java:189
↓ 1 callersMethodprintLevelOrderLineByLine2
()
CHAPTER 9 TREE/Tree.java:218
↓ 1 callersMethodprintPath
(int[] previous, int[] dist, int count, int source)
CHAPTER 12 GRAPHS/GraphAM.java:121
↓ 1 callersMethodprintPath2
(int[][] path, int u, int v)
CHAPTER 12 GRAPHS/Graph.java:1389
↓ 1 callersMethodprintPathUtil
(int[] previous, int source, int dest)
CHAPTER 12 GRAPHS/Graph.java:955
↓ 1 callersMethodprintPathUtil
(int[] previous, int source, int dest)
CHAPTER 12 GRAPHS/GraphAM.java:110
↓ 1 callersMethodprintPostOrder
()
CHAPTER 9 TREE/Tree.java:95
↓ 1 callersMethodprintPreOrder
()
CHAPTER 9 TREE/Tree.java:66
↓ 1 callersMethodprintRepeating
(int[] arr)
CHAPTER 11 HASH TABLE/HashTableExercise.java:87
↓ 1 callersMethodprintRepeating
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:188
↓ 1 callersMethodprintRepeating2
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:200
↓ 1 callersMethodprintRepeating3
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:212
↓ 1 callersMethodprintRepeating4
(int[] arr, int size, int range)
CHAPTER 5 SEARCHING/Searching.java:225
↓ 1 callersMethodprintSolution
(int dist[][], int V)
CHAPTER 18 DYNAMIC PROGRAMMING/FloydWarshall.java:31
↓ 1 callersMethodprintSolution
(int[][] cost, int[][] path, int V)
CHAPTER 12 GRAPHS/Graph.java:1375
↓ 1 callersMethodprintSpiralTree
()
CHAPTER 9 TREE/Tree.java:240
↓ 1 callersMethodprintSubset
(boolean flags[], int arr[], int size)
CHAPTER 19 BACKTRACKING/SubsetSum.java:2
↓ 1 callersMethodpush2
(int value)
CHAPTER 7 STACK/Stack.java:74
↓ 1 callersMethodquickSelect
(int arr[], int lower, int upper, int k)
CHAPTER 4 SORTING/QuickSelect.java:2
↓ 1 callersMethodquickSort
(int arr[], int lower, int upper)
CHAPTER 4 SORTING/QuickSort.java:3
↓ 1 callersMethodrainWater
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:2531
↓ 1 callersMethodrainWater2
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:2557
↓ 1 callersMethodrangePartition
(int[] arr, int size, int lower, int higher)
CHAPTER 4 SORTING/SortingEx.java:104
↓ 1 callersMethodrangeSum
(int start, int end)
CHAPTER 9 TREE/BinaryIndexTree.java:40
↓ 1 callersMethodremove
(int key)
CHAPTER 11 HASH TABLE/HashTableSC.java:40
↓ 1 callersMethodremove
(int key)
CHAPTER 11 HASH TABLE/HashTableLP.java:88
↓ 1 callersMethodremoveDuplicate
(char[] str)
CHAPTER 11 HASH TABLE/HashTableExercise.java:43
↓ 1 callersMethodremoveDuplicate
()
CHAPTER 6 LINKED LIST/DoublyLinkedList.java:192
↓ 1 callersMethodremoveDuplicate
()
CHAPTER 6 LINKED LIST/LinkedList.java:410
↓ 1 callersMethodremoveDuplicates
(int[] array, int size)
CHAPTER 5 SEARCHING/Searching.java:256
↓ 1 callersMethodremoveDuplicates2
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:269
↓ 1 callersMethodremoveFromLeaf
(Node node, int index)
CHAPTER 9 TREE/BTree.java:238
↓ 1 callersMethodremoveFromNonLeaf
(Node node, int index)
CHAPTER 9 TREE/BTree.java:249
↓ 1 callersMethodremoveHead
()
CHAPTER 6 LINKED LIST/DoublyLinkedList.java:66
↓ 1 callersMethodremoveHead
()
CHAPTER 6 LINKED LIST/CircularLinkedList.java:56
↓ 1 callersMethodremoveHead
()
CHAPTER 6 LINKED LIST/LinkedList.java:53
↓ 1 callersMethodremoveLoop
()
CHAPTER 6 LINKED LIST/LinkedList.java:514
↓ 1 callersMethodremoveNode
(int key)
CHAPTER 6 LINKED LIST/DoublyLinkedList.java:81
↓ 1 callersMethodreplaceParenthesis
(char[] a)
CHAPTER 7 STACK/StackExercise.java:202
↓ 1 callersMethodresetRightMostBit
(int a)
CHAPTER 5 SEARCHING/BitManipulation.java:50
↓ 1 callersMethodreverse
(int cups[], int size)
CHAPTER 16 GREEDY ALGORITHM/ChotaBhim.java:6
↓ 1 callersMethodreverseKElementInQueue
(ArrayDeque<Integer> que, int k)
CHAPTER 7 STACK/StackExercise.java:511
↓ 1 callersMethodreverseKElementInStack
(Stack<Integer> stk, int k)
CHAPTER 7 STACK/StackExercise.java:491
↓ 1 callersMethodreverseList
()
CHAPTER 6 LINKED LIST/DoublyLinkedList.java:173
↓ 1 callersMethodreverseParenthesis
(String expn, int size)
CHAPTER 7 STACK/StackExercise.java:675
↓ 1 callersMethodreverseQueue
(ArrayDeque<Integer> que)
CHAPTER 7 STACK/StackExercise.java:502
↓ 1 callersMethodreverseQueue
(ArrayDeque<Integer> que)
CHAPTER 8 QUEUE/QueueEx.java:565
↓ 1 callersMethodreverseRecurse
()
CHAPTER 6 LINKED LIST/LinkedList.java:131
↓ 1 callersMethodreverseRecurseUtil
(Node currentNode, Node nextNode)
CHAPTER 6 LINKED LIST/LinkedList.java:117
↓ 1 callersMethodreverseStack
(Stack<T> stk)
CHAPTER 7 STACK/StackExercise.java:471
↓ 1 callersMethodreverseStack
(Stack<Integer> stk)
CHAPTER 8 QUEUE/QueueEx.java:553
↓ 1 callersMethodreverseStack2
(Stack<Integer> stk)
CHAPTER 7 STACK/StackExercise.java:482
↓ 1 callersMethodreverseString
(String str)
CHAPTER 13 STRING ALGORITHMS/StringEx.java:248
↓ 1 callersMethodreverseWords
(String str)
CHAPTER 13 STRING ALGORITHMS/StringEx.java:279
← previousnext →701–800 of 1,174, ranked by callers