MCPcopy Create free account

hub / github.com/Hemant-Jain-Author/Data-Structures-Algorithms-In-Go / functions

Functions1,518 in github.com/Hemant-Jain-Author/Data-Structures-Algorithms-In-Go

⨍ Functions 1,518◇ Types & classes 101
↓ 1 callersFunctionFactorial
(i int)
IntroductoryChapters/Intro.go:499
↓ 1 callersFunctionFastestWayBU
(a, t [][]int, e, x []int, n int)
AlgorithmsChapters/DP/ALS.go:12
↓ 1 callersFunctionFastestWayBU2
(a, t [][]int, e, x []int, n int)
AlgorithmsChapters/DP/ALS.go:31
↓ 1 callersFunctionFastestWayTD
(a, t [][]int, e, x []int, n int)
AlgorithmsChapters/DP/ALS.go:48
↓ 1 callersFunctionFibonacci
(n int)
AlgorithmsChapters/DP/Fibo.go:5
↓ 1 callersFunctionFibonacciBU
(n int)
AlgorithmsChapters/DP/Fibo.go:24
↓ 1 callersFunctionFibonacciBU2
(n int)
AlgorithmsChapters/DP/Fibo.go:12
↓ 1 callersFunctionFibonacciTD
(n int)
AlgorithmsChapters/DP/Fibo.go:40
↓ 1 callersMethodFind
(data int)
LinkedLIst/LinkedLIst.go:91
↓ 1 callersMethodFind
(data int)
Tree/RBTree.go:118
↓ 1 callersMethodFind
(data int)
Tree/SPLAYTree.go:144
↓ 1 callersFunctionFindBitonicArrayMax
* 5 true 5 true 5 true true true */
Searching/Searching.go:1561
↓ 1 callersFunctionFindDifference
* The pair is : 1 , 7 true The pair is : 1 , 7 true The pair is : 1 , 7 true The pair is : 1 , 7 true The pair is : 1 , 7 true */
Searching/Searching.go:847
↓ 1 callersFunctionFindDifference2
(arr []int, value int)
Searching/Searching.go:860
↓ 1 callersMethodFindIntersection
(list2 List)
LinkedLIst/LinkedLIst.go:427
↓ 1 callersMethodFindLength
()
LinkedLIst/LinkedLIst.go:275
↓ 1 callersMethodFindMax
()
Tree/Tree.go:313
↓ 1 callersMethodFindMaxBT
()
Tree/Tree.go:928
↓ 1 callersMethodFindMin
()
Tree/Tree.go:300
↓ 1 callersMethodFindMin
(curr *Node)
Tree/AVLTree.go:170
↓ 1 callersFunctionFindMinDiff
* The pair is: 1 & 7 true The pair is: 1 & 7 true */
Searching/Searching.go:893
↓ 1 callersFunctionFindMinDiff2
(arr []int)
Searching/Searching.go:907
↓ 1 callersMethodFindMinNode
(curr *Node)
Tree/SPLAYTree.go:187
↓ 1 callersFunctionFindMissing
* helo */
HashTable/HashTableExercise.go:57
↓ 1 callersFunctionFindMissingNumber
* [1 3 5 9 30] [1 3 5 9 30] */
Searching/Searching.go:275
↓ 1 callersFunctionFindMissingNumber2
(arr []int)
Searching/Searching.go:293
↓ 1 callersFunctionFindMissingNumber3
(arr []int)
Searching/Searching.go:304
↓ 1 callersFunctionFindMissingNumber4
(arr []int)
Searching/Searching.go:318
↓ 1 callersFunctionFindMissingNumber5
(arr []int)
Searching/Searching.go:335
↓ 1 callersFunctionFindMissingNumber6
(arr []int)
Searching/Searching.go:352
↓ 1 callersFunctionFindMissingNumber7
(arr []int, dataRange int)
Searching/Searching.go:369
↓ 1 callersFunctionFindMissingNumber8
(arr []int, upperRange int)
Searching/Searching.go:387
↓ 1 callersFunctionFindPair
* The two elements with minimum sum are : -6 & 6 The two elements with minimum sum are : -6 & 6 */
Searching/Searching.go:669
↓ 1 callersFunctionFindPair2
(data []int, value int)
Searching/Searching.go:685
↓ 1 callersFunctionFindPair3
(data []int, value int)
Searching/Searching.go:708
↓ 1 callersFunctionFindPair4
(data []int, rangeVal int, value int)
Searching/Searching.go:725
↓ 1 callersFunctionFindPairTwoLists
* Pairs with sum 8 are : (1, 7) (5, 3) (2, 6) Pairs with sum 8 are : (1, 7) (2, 6) (3, 5) Pairs with sum 8 are : (5, 3) (6, 2) (7, 1) The pair is : 5
Searching/Searching.go:753
↓ 1 callersFunctionFindPairTwoLists2
(arr1 []int, size1 int, arr2 []int, size2 int, value int)
Searching/Searching.go:765
↓ 1 callersFunctionFindPairTwoLists3
(arr1 []int, size1 int, arr2 []int, size2 int, value int)
Searching/Searching.go:776
↓ 1 callersFunctionFindPairTwoLists4
(arr1 []int, size1 int, arr2 []int, size2 int, value int)
Searching/Searching.go:796
↓ 1 callersFunctionFindPairTwoLists5
(arr1 []int, size1 int, arr2 []int, size2 int, rangeVal int, value int)
Searching/Searching.go:810
↓ 1 callersFunctionFindRotationMax
(arr []int)
Searching/Searching.go:1904
↓ 1 callersFunctionFindWays
(n, m, V int)
AlgorithmsChapters/DP/DiceThrow.go:5
↓ 1 callersFunctionFirstRepeated
* true false true false true false true false */
Searching/Searching.go:125
↓ 1 callersFunctionFirstRepeated2
(arr []int)
Searching/Searching.go:137
↓ 1 callersFunctionFixPoint
* KLargestElements are :3 4 2 2 5 9 3 KLargestElements are :3 4 2 2 5 9 3 */
Searching/Searching.go:2558
↓ 1 callersFunctionFixPoint2
(arr []int, size int)
Searching/Searching.go:2567
↓ 1 callersMethodFloorBST
(val int)
Tree/Tree.go:892
↓ 1 callersFunctionFloydWarshall
(graph [][]int, V int)
AlgorithmsChapters/DP/FloydWarshall.go:10
↓ 1 callersMethodFloydWarshall
()
Graph/Graph.go:1445
↓ 1 callersMethodFreeList
()
LinkedLIst/LinkedLIst.go:155
↓ 1 callersMethodFreeList
()
LinkedLIst/DoublyLinkedList.go:120
↓ 1 callersFunctionFrequencyCounts
* Value: 1 Index: 0 & 3 */
Searching/Searching.go:2401
↓ 1 callersFunctionFrequencyCounts2
(arr []int)
Searching/Searching.go:2418
↓ 1 callersFunctionFrequencyCounts3
(arr []int)
Searching/Searching.go:2433
↓ 1 callersFunctionFrequencyCounts4
(arr []int)
Searching/Searching.go:2447
↓ 1 callersMethodFront
()
Tree/Tree.go:1306
↓ 1 callersMethodFront
()
Queue/QueueLinkedLIst.go:29
↓ 1 callersFunctionGCD
(m int, n int)
IntroductoryChapters/Intro.go:554
↓ 1 callersFunctionGPTriplets
(arr []int)
Searching/Searching.go:1289
↓ 1 callersMethodGet
(key int)
HashTable/HashTableLP.go:75
↓ 1 callersMethodGet
(key int)
HashTable/HashTableSC.go:79
↓ 1 callersFunctionGetMaxArea
* Output: [1 1 1 1 1 4 6 8 9] [1 1 1 1 1 4 6 8 9] */
Stack/StackExercise.go:721
↓ 1 callersFunctionGetMaxArea2
(arr []int)
Stack/StackExercise.go:741
↓ 1 callersFunctionGetMaxCost01
(items []*Item, capacity int)
AlgorithmsChapters/DP/Knapsack.go:38
↓ 1 callersFunctionGetMaxCost01BU
(items []*Item, capacity int)
AlgorithmsChapters/DP/Knapsack.go:101
↓ 1 callersFunctionGetMaxCost01TD
(items []*Item, capacity int)
AlgorithmsChapters/DP/Knapsack.go:65
↓ 1 callersFunctionGetMaxCostFractional
(wt []int, cost []int, capacity int)
AlgorithmsChapters/Greedy/FractionalKnapsack.go:21
↓ 1 callersFunctionGetMaxCostGreedy
(weights []int, costs []int, capacity int)
AlgorithmsChapters/Greedy/Knapsack.go:22
↓ 1 callersFunctionGetMedian
* [8 0 12 7 9 11 5 1 5 3 1] */
Searching/Searching.go:2019
↓ 1 callersFunctionGetMedian2
(arr []int)
Searching/Searching.go:2025
↓ 1 callersFunctionGraphColouring
(graph [][]bool, V int, m int)
AlgorithmsChapters/BT/GraphColouring.go:5
↓ 1 callersFunctionGraphColouring2
(graph [][]bool, V int, m int)
AlgorithmsChapters/BT/GraphColouring.go:42
↓ 1 callersFunctionGraphShortestDist
GraphShortestDist returns the shortest distance from 0 to N-1.
AlgorithmsChapters/Greedy/MultipleStageGraph.go:11
↓ 1 callersFunctionInOrder
(n *TreeNode)
Basics/Tree.go:40
↓ 1 callersMethodInOrder
()
Basics/Tree.go:35
↓ 1 callersFunctionIncrementPassByPointer
(ptr *int)
Basics/untitled.go:6
↓ 1 callersFunctionIncrementPassByValue
(x int)
Basics/untitled.go:2
↓ 1 callersFunctionInfixToPrefix
* Output: Infix Expn: 10+((3))*5/(16-4) Postfix Expn: 10 3 5 * 16 4 - / + */
Stack/StackExercise.go:587
↓ 1 callersFunctionInsertionSort
(arr []int, comp func(int, int) bool)
Sorting/InsertionSort.go:19
↓ 1 callersMethodIsBST
()
Tree/Tree.go:654
↓ 1 callersMethodIsBST2
()
Tree/Tree.go:668
↓ 1 callersMethodIsBST3
()
Tree/Tree.go:637
↓ 1 callersFunctionIsBalancedParenthesis
* Output: [1 2 3 4] [2 1 3 4] */
Stack/StackExercise.go:272
↓ 1 callersMethodIsCompleteTree2
()
Tree/Tree.go:731
↓ 1 callersMethodIsConnected
* [1 2 0] [4 5 3] [6] */
Graph/Graph.go:882
↓ 1 callersMethodIsEmpty
()
Stack/StackLinkedList.go:37
↓ 1 callersMethodIsEmpty
()
Queue/QueueLinkedLIst.go:37
↓ 1 callersMethodIsEmpty
()
Queue/Queue.go:35
↓ 1 callersMethodIsEqual
(t2 *Tree)
Tree/Tree.go:434
↓ 1 callersMethodIsEulerianCycle
()
Graph/Graph.go:1062
↓ 1 callersMethodIsHeap
()
Tree/Tree.go:748
↓ 1 callersMethodIsHeap2
()
Tree/Tree.go:763
↓ 1 callersFunctionIsMajority
(arr []int)
Searching/Searching.go:1513
↓ 1 callersFunctionIsMajority2
(arr []int)
Searching/Searching.go:1528
↓ 1 callersFunctionIsMaxHeap
(arr []int)
Heap/heap2.go:223
↓ 1 callersFunctionIsMaxHeap
(arr []int)
Heap/Heap.go:214
↓ 1 callersFunctionIsMinHeap
* [0 1 2 3 4 5 6 7 8 9] [9 8 7 6 5 4 3 2 1 0] */
Heap/heap2.go:208
↓ 1 callersFunctionIsMinHeap
* [0 1 2 3 4 5 6 7 8 9] [9 8 7 6 5 4 3 2 1 0] */
Heap/Heap.go:199
↓ 1 callersFunctionIsPowerOf2
(a int)
Searching/BitManipulation.go:22
← previousnext →401–500 of 1,518, ranked by callers