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 callersFunctionRottenFruit2
(arr [][]int, maxCol int, maxRow int)
Queue/QueueEX.go:342
↓ 1 callersFunctionRottenFruitUtil
* -2 -2 -6 -14 -14 NAN */
Queue/QueueEX.go:283
↓ 1 callersFunctionSearch01
* 6 */
Searching/Searching.go:1829
↓ 1 callersMethodSearchBT
(value int)
Tree/Tree.go:950
↓ 1 callersFunctionSearchRotateArray
(arr []int, key int)
Searching/Searching.go:1915
↓ 1 callersFunctionSelectionSort
* [1 2 3 4 5 6 7 8 9] [1 2 3 4 5 6 7 8 9] */
Sorting/SelectionSort.go:23
↓ 1 callersFunctionSelectionSort2
(arr []int)
Sorting/SelectionSort.go:36
↓ 1 callersFunctionSeparateEvenAndOdd
(data []int, size int)
Sorting/SortingEx.go:155
↓ 1 callersFunctionSeparateEvenAndOdd
* Water : 7 Water : 7 */
Searching/Searching.go:2777
↓ 1 callersFunctionSeparateEvenAndOdd2
(data []int, size int)
Sorting/SortingEx.go:173
↓ 1 callersMethodSet
(arr []int, ind int, val int)
Tree/SegmentTree.go:61
↓ 1 callersMethodSet
(arr []int, index int, val int)
Tree/BinaryIndexTree.go:36
↓ 1 callersFunctionShellSort
(arr []int)
Sorting/ShellSort.go:9
↓ 1 callersMethodShortestPath
* true */
Graph/Graph.go:1124
↓ 1 callersFunctionShuffle
* 123 132 213 231 321 312 */
String/StringEx.go:318
↓ 1 callersMethodSize
Size returns the size of the heap
AlgorithmsChapters/Greedy/JoinRopes.go:185
↓ 1 callersMethodSize
()
AlgorithmsChapters/Greedy/OptimalMergePattern.go:123
↓ 1 callersMethodSize
()
AlgorithmsChapters/Greedy/HuffmanTree.go:166
↓ 1 callersMethodSize
()
LinkedLIst/DoublyLinkedList.go:17
↓ 1 callersMethodSize
()
LinkedLIst/DoublyCircularLIst.go:17
↓ 1 callersMethodSize
Size returns the number of elements in the queue.
Queue/QueueLL.go:16
↓ 1 callersFunctionSmallerThenTripletCount
* AbcTriplet : 1 2 3 AbcTriplet : -3 -4 1 */
Searching/Searching.go:1222
↓ 1 callersFunctionSmallerThenTripletCount2
(arr []int, value int)
Searching/Searching.go:1237
↓ 1 callersFunctionSmallestPositiveMissingNumber
(arr []int, size int)
IntroductoryChapters/Intro.go:252
↓ 1 callersFunctionSmallestPositiveMissingNumber2
(arr []int, size int)
IntroductoryChapters/Intro.go:269
↓ 1 callersFunctionSmallestPositiveMissingNumber3
(arr []int, size int)
IntroductoryChapters/Intro.go:283
↓ 1 callersFunctionSmallestPositiveMissingNumber4
(arr []int, size int)
IntroductoryChapters/Intro.go:303
↓ 1 callersFunctionSort1toN
(arr []int, size int)
IntroductoryChapters/Intro.go:214
↓ 1 callersFunctionSort1toN2
(arr []int, size int)
IntroductoryChapters/Intro.go:229
↓ 1 callersFunctionSortByOrder
(arr []int, size int, arr2 []int, size2 int)
Sorting/SortingEx.go:226
↓ 1 callersFunctionStairUniqueWaysBU
(n int)
AlgorithmsChapters/DP/StairUniqueWays.go:5
↓ 1 callersFunctionStairUniqueWaysBU2
(n int)
AlgorithmsChapters/DP/StairUniqueWays.go:20
↓ 1 callersFunctionStepsOfKnight
(size int, srcX int, srcY int, dstX int, dstY int)
Queue/QueueEX.go:420
↓ 1 callersFunctionStepsOfKnight2
(size int, srcX int, srcY int, dstX int, dstY int)
Queue/QueueEX.go:442
↓ 1 callersFunctionStepsOfKnightUtil
* RottenFruit : 3 RottenFruit2 : 3 */
Queue/QueueEX.go:399
↓ 1 callersFunctionStockAnalystAdd
* GetMaxArea :: 20 GetMaxArea :: 20 */
Stack/StackExercise.go:784
↓ 1 callersFunctionStockBuySellMaxProfit
(arr []int)
AlgorithmsChapters/DP/StockBuySell.go:5
↓ 1 callersFunctionStockBuySellMaxProfit2
(arr []int)
AlgorithmsChapters/DP/StockBuySell.go:25
↓ 1 callersFunctionStockBuySellMaxProfitTC
(arr []int, t int)
AlgorithmsChapters/DP/StockBuySell.go:47
↓ 1 callersFunctionStockBuySellMaxProfitTC2
(arr []int, t int)
AlgorithmsChapters/DP/StockBuySell.go:66
↓ 1 callersFunctionStockSpanRange
* Output: Result after Evaluation: 288 */
Stack/StackExercise.go:674
↓ 1 callersFunctionStockSpanRange2
(arr []int)
Stack/StackExercise.go:688
↓ 1 callersMethodStronglyConnectedComponent
* IsStronglyConnected : true */
Graph/Graph.go:839
↓ 1 callersFunctionSubsetSum
(arr []int, n int, target int)
AlgorithmsChapters/BT/SubsetSum.go:5
↓ 1 callersMethodSum
Sum returns the sum of the list elements.
Basics/LinkedList.go:29
↓ 1 callersMethodSumAllBT
()
Tree/Tree.go:573
↓ 1 callersFunctionSumArray
(data []int)
IntroductoryChapters/Intro.go:12
↓ 1 callersFunctionSumDistinct
* Odd values: 30 Odd count is : 1 Odd count Elements are : 30 & 40 */
Searching/Searching.go:584
↓ 1 callersFunctionSumPairRestArray
* closest pair is : 1 & 5 closest pair is : 1 & 5 */
Searching/Searching.go:1044
↓ 1 callersFunctionTSP
Function to find the minimum weight Hamiltonian Cycle
AlgorithmsChapters/BT/TSP.go:9
↓ 1 callersMethodTop
()
Tree/Tree.go:1267
↓ 1 callersMethodTopologicalSort
* DFS Path is: [0 3 6 7 5 4 2 1] Path between 0 & 6: true DFS Path is: 0 1 4 7 5 2 6 3 Path between 0 & 6: true BFS Path is: [0 1 2 3 4 5 6 7] Path be
Graph/Graph.go:189
↓ 1 callersMethodTopologicalSortDFS
(index int, visited []bool, stk *Stack)
Graph/Graph.go:207
↓ 1 callersFunctionTotalArea
(shapes ...Shape)
Basics/Shape.go:38
↓ 1 callersFunctionTotalPerimeter
(shapes ...Shape)
Basics/Shape.go:46
↓ 1 callersFunctionTowerOfHanoi
(num int)
AlgorithmsChapters/BT/TOH.go:5
↓ 1 callersMethodTreeDepth
()
Tree/Tree.go:417
↓ 1 callersMethodTreeToListRec
()
Tree/Tree.go:584
↓ 1 callersMethodTrimOutsidedataRange
(min int, max int)
Tree/Tree.go:858
↓ 1 callersFunctionTwoComplementEx
(a int)
Searching/BitManipulation.go:66
↓ 1 callersFunctionUnionIntersectionSorted
(arr1 []int, size1 int, arr2 []int, size2 int)
Sorting/SortingEx.go:366
↓ 1 callersFunctionUnionIntersectionUnsorted
(arr1 []int, size1 int, arr2 []int, size2 int)
Sorting/SortingEx.go:408
↓ 1 callersFunctionUnique3Ways
Diagonal movement allowed.
AlgorithmsChapters/DP/GridUniqueWays.go:6
↓ 1 callersFunctionUniqueWays
(m int, n int)
AlgorithmsChapters/DP/GridUniqueWays.go:32
↓ 1 callersMethodUpdate
(ind int, val int)
Tree/rangeMaxST.go:68
↓ 1 callersFunctionWaveArray
(arr []int)
IntroductoryChapters/Intro.go:137
↓ 1 callersFunctionWaveArray2
(arr []int)
IntroductoryChapters/Intro.go:150
↓ 1 callersFunctionWildCharMatchExp
(exp string, str string)
AlgorithmsChapters/DP/WildCharMatch.go:10
↓ 1 callersFunctionWildCharMatchExpDP
(exp string, str string)
AlgorithmsChapters/DP/WildCharMatch.go:30
↓ 1 callersFunctionXorEx
(a int, b int)
Searching/BitManipulation.go:70
↓ 1 callersFunctionZeroSumTriplets
* Pair is: 3 & 7 */
Searching/Searching.go:1078
↓ 1 callersFunctionZeroSumTriplets2
(arr []int)
Searching/Searching.go:1093
↓ 1 callersFunctionabsBubbleSort
(arr []int, size int, reference int)
Sorting/SortingEx.go:202
↓ 1 callersFunctionabsGreater
(value1 int, value2 int, reference int)
Sorting/SortingEx.go:198
↓ 1 callersMethodadd
(poly2 *Polynomial)
LinkedLIst/Polynomial.go:51
↓ 1 callersMethodaddUtil
(n *Node, value int)
Tree/Tree.go:40
↓ 1 callersMethodancestor
(curr *Node, first int, second int)
Tree/Tree.go:457
↓ 1 callersFunctionappendValues
appendValues appends the elements of t to values in order and returns the resulting slice.
Tree/Tree.go:1026
↓ 1 callersFunctionbinarySearchRecursiveUtil
(data []int, low, high, value int)
Searching/Searching.go:51
↓ 1 callersMethodborrowFromLeft
Move a key from parent to right and left to parent.
Tree/BTree.go:320
↓ 1 callersMethodborrowFromRight
Move a key from parent to left and right to parent.
Tree/BTree.go:347
↓ 1 callersFunctioncheckReverse
(arr []int, size int)
Sorting/SortingEx.go:315
↓ 1 callersFunctionclosestPairUtil
(p []*Point, start int, stop int, q []*Point, n int)
AlgorithmsChapters/DAC/ClosestPair.go:59
↓ 1 callersMethodcompareListUtil
(head1 *ListNode, head2 *ListNode)
LinkedLIst/LinkedLIst.go:250
↓ 1 callersMethodconstructST
(input []int, start int, end int, index int)
Tree/SegmentTree.go:26
↓ 1 callersMethodconstructST
(input []int, start int, end int, index int)
Tree/rmqST.go:26
↓ 1 callersMethodconstructST
(input []int, start int, end int, index int)
Tree/rangeMaxST.go:26
↓ 1 callersMethodcopyMirrorTree
(curr *Node)
Tree/Tree.go:493
↓ 1 callersMethodcopyTree
(curr *Node)
Tree/Tree.go:476
↓ 1 callersMethodcountAllPath
(src int, dest int)
Graph/Graph.go:267
↓ 1 callersMethodcountAllPathDFS
(visited []bool, source int, dest int)
Graph/Graph.go:248
↓ 1 callersFunctioncountSort
(arr []int, n int, dividend int)
Sorting/RadixSort.go:25
↓ 1 callersFunctioncreateBinarySearchTreeUtil
(arr []int, start int, end int)
Tree/Tree.go:983
↓ 1 callersFunctioncreateCompleteBinaryTree
(arr []int, start int, size int)
Tree/Tree.go:23
↓ 1 callersMethoddeleteNode
(node *Node, value int)
Tree/Tree.go:386
↓ 1 callersMethoddeleteUtil
(node *Node, key int)
Tree/RBTree.go:219
↓ 1 callersMethoddeleteUtil
(node *Node, data int)
Tree/AVLTree.go:126
↓ 1 callersFunctioneditDistUtil
(str1, str2 string, m, n int)
AlgorithmsChapters/DP/EditDist.go:23
↓ 1 callersFunctionfastestWayUtilTD
(f, a, t [][]int, i int)
AlgorithmsChapters/DP/ALS.go:62
↓ 1 callersFunctionfibonacci
(n int)
IntroductoryChapters/Intro.go:568
← previousnext →701–800 of 1,518, ranked by callers