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 callersMethodgetMajority
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:1348
↓ 1 callersMethodgetMajority2
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:1368
↓ 1 callersMethodgetMajority3
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:1386
↓ 1 callersMethodgetMax
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:1287
↓ 1 callersMethodgetMax
(int arr[], int n)
CHAPTER 4 SORTING/RadixSort.java:4
↓ 1 callersMethodgetMax2
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:1304
↓ 1 callersMethodgetMax3
(int[] arr, int size, int range)
CHAPTER 5 SEARCHING/Searching.java:1323
↓ 1 callersMethodgetMaxArea
(int[] arr)
CHAPTER 7 STACK/StackExercise.java:288
↓ 1 callersMethodgetMaxArea2
(int[] arr)
CHAPTER 7 STACK/StackExercise.java:308
↓ 1 callersMethodgetMaxCostFractional
(int[] wt, int[] cost, int capacity)
CHAPTER 16 GREEDY ALGORITHM/FractionalKnapsack.java:20
↓ 1 callersMethodgetMaxCostGreedy
(int[] wt, int[] cost, int capacity)
CHAPTER 16 GREEDY ALGORITHM/Knapsack.java:25
↓ 1 callersMethodgetMaxUtil
(int segStart, int segEnd, int queryStart, int queryEnd, int index)
CHAPTER 9 TREE/rangeMaxST.java:48
↓ 1 callersMethodgetMedian
()
CHAPTER 10 PRIORITY QUEUE & HEAPS/MedianHeap.java:33
↓ 1 callersMethodgetMinUtil
(int segStart, int segEnd, int queryStart, int queryEnd, int index)
CHAPTER 9 TREE/rmqST.java:48
↓ 1 callersMethodgetPred
(Node node, int index)
CHAPTER 9 TREE/BTree.java:281
↓ 1 callersMethodgetSucc
(Node node, int index)
CHAPTER 9 TREE/BTree.java:292
↓ 1 callersMethodgetSumUtil
(int segStart, int segEnd, int queryStart, int queryEnd, int index)
CHAPTER 9 TREE/SegmentTree.java:40
↓ 1 callersMethodgpTriplets
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:1215
↓ 1 callersMethodgraphColouring
(boolean[][] graph, int V, int m)
CHAPTER 19 BACKTRACKING/GraphColouring.java:79
↓ 1 callersMethodgraphColouring2
(boolean[][] graph, int V, int m, int[] colour, int i)
CHAPTER 19 BACKTRACKING/GraphColouring.java:18
↓ 1 callersMethodgraphColouringUtil
(boolean graph[][], int V, int m, int colour[], int i)
CHAPTER 19 BACKTRACKING/GraphColouring.java:63
↓ 1 callersMethodgreater
(int value1, int value2)
CHAPTER 4 SORTING/ShellSort.java:2
↓ 1 callersMethodgreater
(int value1, int value2)
CHAPTER 4 SORTING/InsertionSort.java:3
↓ 1 callersMethodgridUnique3Ways
(int m, int n)
CHAPTER 18 DYNAMIC PROGRAMMING/GridUniqueWays.java:24
↓ 1 callersMethodgridUniqueWays
(int m, int n)
CHAPTER 18 DYNAMIC PROGRAMMING/GridUniqueWays.java:3
↓ 1 callersMethodhamiltonianCycleUtil
(int path[], int pSize, int added[])
CHAPTER 12 GRAPHS/GraphAM.java:304
↓ 1 callersMethodhamiltonianPathUtil
(int path[], int pSize, int added[])
CHAPTER 12 GRAPHS/GraphAM.java:236
↓ 1 callersMethodheightTreeParentArr
(int[] arr)
CHAPTER 12 GRAPHS/Graph.java:1063
↓ 1 callersMethodheightTreeParentArr2
(int[] arr)
CHAPTER 12 GRAPHS/Graph.java:1107
↓ 1 callersMethodinfixToPrefix
(String expn)
CHAPTER 7 STACK/StackExercise.java:192
↓ 1 callersMethodinsertionSort
()
CHAPTER 6 LINKED LIST/LinkedList.java:387
↓ 1 callersMethodisAP
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:2019
↓ 1 callersMethodisAP2
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:2032
↓ 1 callersMethodisAP3
(int[] arr, int size)
CHAPTER 5 SEARCHING/Searching.java:2059
↓ 1 callersMethodisBST
()
CHAPTER 9 TREE/Tree.java:638
↓ 1 callersMethodisBST2
()
CHAPTER 9 TREE/Tree.java:652
↓ 1 callersMethodisBST3
()
CHAPTER 9 TREE/Tree.java:624
↓ 1 callersMethodisBalancedParenthesis
(String expn)
CHAPTER 7 STACK/StackExercise.java:32
↓ 1 callersMethodisCompleteTree2
()
CHAPTER 9 TREE/Tree.java:709
↓ 1 callersMethodisCompleteTreeUtil
(Node curr, int index, int count)
CHAPTER 9 TREE/Tree.java:700
↓ 1 callersMethodisConnected
()
CHAPTER 12 GRAPHS/Graph.java:1130
↓ 1 callersMethodisConnectedUndirected
()
CHAPTER 12 GRAPHS/Graph.java:661
↓ 1 callersMethodisCyclePresentDFS
(int index, boolean[] visited, int[] marked)
CHAPTER 12 GRAPHS/Graph.java:552
↓ 1 callersMethodisCyclePresentDFSColour
(int index, int[] visited)
CHAPTER 12 GRAPHS/Graph.java:580
↓ 1 callersMethodisCyclePresentUndirectedDFS
(int index, int parentIndex, boolean[] visited)
CHAPTER 12 GRAPHS/Graph.java:428
↓ 1 callersMethodisEmpty
()
CHAPTER 8 QUEUE/Queue.java:44
↓ 1 callersMethodisEqual
(Tree T2)
CHAPTER 9 TREE/Tree.java:393
↓ 1 callersMethodisEqualUtil
(Node node1, Node node2)
CHAPTER 9 TREE/Tree.java:397
↓ 1 callersMethodisEulerianCycle
()
CHAPTER 12 GRAPHS/Graph.java:1240
↓ 1 callersMethodisHeap
()
CHAPTER 9 TREE/Tree.java:722
↓ 1 callersMethodisHeap2
()
CHAPTER 9 TREE/Tree.java:738
↓ 1 callersMethodisHeapUtil
(Node curr, int parentValue)
CHAPTER 9 TREE/Tree.java:714
↓ 1 callersMethodisHeapUtil2
(Node curr, int index, int count, int parentValue)
CHAPTER 9 TREE/Tree.java:727
↓ 1 callersMethodisMajority
(int arr[], int size)
CHAPTER 5 SEARCHING/Searching.java:1622
↓ 1 callersMethodisMajority2
(int arr[], int size)
CHAPTER 5 SEARCHING/Searching.java:1609
↓ 1 callersMethodisMaxHeap
(int[] arr, int size)
CHAPTER 10 PRIORITY QUEUE & HEAPS/HeapEx.java:74
↓ 1 callersMethodisMinHeap
(int[] arr, int size)
CHAPTER 10 PRIORITY QUEUE & HEAPS/HeapEx.java:61
↓ 1 callersMethodisPermutation
(String s1, String s2)
CHAPTER 13 STRING ALGORITHMS/StringEx.java:175
↓ 1 callersMethodisPowerOf2
(int a)
CHAPTER 5 SEARCHING/BitManipulation.java:54
↓ 1 callersMethodisPrime
(int n)
CHAPTER 13 STRING ALGORITHMS/StringEx.java:70
↓ 1 callersMethodisSafe
(boolean graph[][], int V, int colour[], int v, int c)
CHAPTER 19 BACKTRACKING/GraphColouring.java:56
↓ 1 callersMethodisSafe2
(boolean[][] graph, int[] colour, int V)
CHAPTER 19 BACKTRACKING/GraphColouring.java:10
↓ 1 callersMethodisStronglyConnected
()
CHAPTER 12 GRAPHS/Graph.java:688
↓ 1 callersMethodisStronglyConnected2
()
CHAPTER 12 GRAPHS/Graph.java:1209
↓ 1 callersMethodisValid
(int[] arr, int n)
CHAPTER 19 BACKTRACKING/Permutations.java:36
↓ 1 callersMethodisValid2
(int[] arr, int i)
CHAPTER 19 BACKTRACKING/Permutations.java:59
↓ 1 callersMethoditerativeInOrder
()
CHAPTER 9 TREE/Tree.java:592
↓ 1 callersMethoditerativePostOrder
()
CHAPTER 9 TREE/Tree.java:560
↓ 1 callersMethoditerativePreOrder
()
CHAPTER 9 TREE/Tree.java:540
↓ 1 callersMethodjoinRopes
(int ropes[], int size)
CHAPTER 16 GREEDY ALGORITHM/JoinRopes.java:6
↓ 1 callersMethodjoinRopes2
(int ropes[], int size)
CHAPTER 16 GREEDY ALGORITHM/JoinRopes.java:33
↓ 1 callersMethodjosephus
(int n, int k)
CHAPTER 8 QUEUE/QueueEx.java:594
↓ 1 callersMethodkLargestElements
(int arrIn[], int size, int k)
CHAPTER 5 SEARCHING/Searching.java:2314
↓ 1 callersMethodkLargestElements2
(int arrIn[], int size, int k)
CHAPTER 5 SEARCHING/Searching.java:2355
↓ 1 callersMethodkSmallestProduct
(int[] arr, int size, int k)
CHAPTER 10 PRIORITY QUEUE & HEAPS/HeapEx.java:109
↓ 1 callersMethodkSmallestProduct2
(int[] arr, int size, int k)
CHAPTER 10 PRIORITY QUEUE & HEAPS/HeapEx.java:158
↓ 1 callersMethodkSmallestProduct3
(int[] arr, int size, int k)
CHAPTER 10 PRIORITY QUEUE & HEAPS/HeapEx.java:150
↓ 1 callersMethodkSmallestProduct4
(int[] arr, int size, int k)
CHAPTER 10 PRIORITY QUEUE & HEAPS/HeapEx.java:173
↓ 1 callersMethodkruskalMST
()
CHAPTER 12 GRAPHS/Graph.java:857
↓ 1 callersMethodkthBitCheck
(int a, int k)
CHAPTER 5 SEARCHING/BitManipulation.java:30
↓ 1 callersMethodkthBitReset
(int a, int k)
CHAPTER 5 SEARCHING/BitManipulation.java:38
↓ 1 callersMethodkthBitSet
(int a, int k)
CHAPTER 5 SEARCHING/BitManipulation.java:34
↓ 1 callersMethodkthBitToggle
(int a, int k)
CHAPTER 5 SEARCHING/BitManipulation.java:42
↓ 1 callersMethodkthSmallest
(int[] arr, int size, int k)
CHAPTER 10 PRIORITY QUEUE & HEAPS/HeapEx.java:22
↓ 1 callersMethodkthSmallest2
(int[] arr, int size, int k)
CHAPTER 10 PRIORITY QUEUE & HEAPS/HeapEx.java:27
↓ 1 callersMethodlargestPalinSubstr
(String str)
CHAPTER 18 DYNAMIC PROGRAMMING/LargestPalindromicSubstr.java:3
↓ 1 callersMethodlargestPalindromicSubseq
(String str)
CHAPTER 18 DYNAMIC PROGRAMMING/LargestPalindromicSubsequence.java:3
↓ 1 callersMethodlbs
(int[] arr)
CHAPTER 18 DYNAMIC PROGRAMMING/LargestBitonicSubseq.java:4
↓ 1 callersMethodleftRightRotate
(Node node)
CHAPTER 9 TREE/RBTree.java:114
↓ 1 callersMethodleftShiftEx
(int a)
CHAPTER 5 SEARCHING/BitManipulation.java:14
↓ 1 callersMethodlis
(int[] arr)
CHAPTER 18 DYNAMIC PROGRAMMING/LargestIncreasingSubseq.java:2
↓ 1 callersMethodlongestContBalParen
(String string, int size)
CHAPTER 7 STACK/StackExercise.java:630
↓ 1 callersMethodlongestContBalParen2
(String string, int size)
CHAPTER 7 STACK/StackExercise.java:649
↓ 1 callersMethodloopDetect
()
CHAPTER 6 LINKED LIST/LinkedList.java:432
↓ 1 callersMethodloopPointDetect
()
CHAPTER 6 LINKED LIST/LinkedList.java:499
↓ 1 callersMethodloopTypeDetect
()
CHAPTER 6 LINKED LIST/LinkedList.java:478
↓ 1 callersMethodmain1
()
CHAPTER 7 STACK/StackExercise.java:19
↓ 1 callersMethodmain1
()
CHAPTER 8 QUEUE/QueueEx.java:50
↓ 1 callersMethodmain1
()
CHAPTER 1 ALGORITHMS ANALYSIS/Introduction.java:15
↓ 1 callersMethodmain1
()
CHAPTER 9 TREE/Tree.java:1008
← previousnext →401–500 of 1,174, ranked by callers