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 callersMethodIsPresent
(data int)
LinkedLIst/CircularLinkedList.go:72
↓ 1 callersMethodIsPresent
(key int)
LinkedLIst/DoublyCircularLIst.go:33
↓ 1 callersFunctionIsPrime
* true */
String/StringEx.go:66
↓ 1 callersMethodIsStronglyConnected
()
Graph/Graph.go:802
↓ 1 callersMethodIsStronglyConnected2
()
Graph/Graph.go:1029
↓ 1 callersFunctionJoinRopes
JoinRopes joins the ropes and returns the total cost
AlgorithmsChapters/Greedy/JoinRopes.go:9
↓ 1 callersFunctionJoinRopes2
JoinRopes2 joins the ropes using a heap and returns the total cost
AlgorithmsChapters/Greedy/JoinRopes.go:41
↓ 1 callersFunctionJosephus
(n int, k int)
Queue/QueueEX.go:19
↓ 1 callersFunctionKLargestElements
* (1 : 2) (2 : 3) (1 : 2) (2 : 3) (1 : 2) (2 : 3) (1 : 2) (2 : 3) */
Searching/Searching.go:2486
↓ 1 callersFunctionKLargestElements2
(arrIn []int, size int, k int)
Searching/Searching.go:2530
↓ 1 callersFunctionKMP
(text string, pattern string)
String/StringMatching.go:79
↓ 1 callersFunctionKMPFindCount
(text string, pattern string)
String/StringMatching.go:101
↓ 1 callersFunctionKS01UnboundedBU
(items []*Item, capacity int)
AlgorithmsChapters/DP/Knapsack.go:20
↓ 1 callersFunctionKSmallestProduct
* Kth Smallest :: 5 Kth Smallest :: 5 */
Heap/heap2.go:381
↓ 1 callersFunctionKSmallestProduct
* Kth Smallest :: 5 Kth Smallest :: 5 */
Heap/Heap.go:366
↓ 1 callersFunctionKSmallestProduct2
(arr []int, size int, k int)
Heap/heap2.go:390
↓ 1 callersFunctionKSmallestProduct2
(arr []int, size int, k int)
Heap/Heap.go:375
↓ 1 callersFunctionKSmallestProduct3
(arr []int, size int, k int)
Heap/heap2.go:441
↓ 1 callersFunctionKSmallestProduct3
(arr []int, size int, k int)
Heap/Heap.go:426
↓ 1 callersFunctionKSmallestProduct4
(arr []int, size int, k int)
Heap/heap2.go:449
↓ 1 callersFunctionKSmallestProduct4
(arr []int, size int, k int)
Heap/Heap.go:434
↓ 1 callersFunctionKthBitCheck
(a int, k int)
Searching/BitManipulation.go:30
↓ 1 callersFunctionKthBitReset
(a int, k int)
Searching/BitManipulation.go:34
↓ 1 callersFunctionKthBitSet
(a int, k int)
Searching/BitManipulation.go:38
↓ 1 callersFunctionKthBitToggle
(a int, k int)
Searching/BitManipulation.go:42
↓ 1 callersFunctionKthSmallest
* Median after insertion of 1 is 1 Median after insertion of 9 is 5 Median after insertion of 2 is 2 Median after insertion of 8 is 5 Median after ins
Heap/heap2.go:331
↓ 1 callersFunctionKthSmallest
* Median after insertion of 1 is 1 Median after insertion of 9 is 5 Median after insertion of 2 is 2 Median after insertion of 8 is 5 Median after ins
Heap/Heap.go:322
↓ 1 callersFunctionKthSmallest2
(arr []int, size int, k int)
Heap/heap2.go:336
↓ 1 callersFunctionKthSmallest2
(arr []int, k int)
Heap/Heap.go:327
↓ 1 callersFunctionKthSmallest3
(arr []int, size int, k int)
Heap/heap2.go:351
↓ 1 callersFunctionKthSmallest3
(arr []int, k int)
Heap/Heap.go:338
↓ 1 callersMethodLCAUtil
(curr *Node, first int, second int)
Tree/Tree.go:813
↓ 1 callersFunctionLargestBitonicSubseq
(arr []int)
AlgorithmsChapters/DP/LargestBitonicSubseq.go:12
↓ 1 callersFunctionLargestIncreasingSubseq
(arr []int)
AlgorithmsChapters/DP/LargestIncreasingSubseq.go:5
↓ 1 callersFunctionLargestPalindromicSubsequence
(str string)
AlgorithmsChapters/DP/LargestPalindromicSubsequence.go:12
↓ 1 callersFunctionLargestPalindromicSubstr
(str string)
AlgorithmsChapters/DP/LargestPalindromicSubstr.go:5
↓ 1 callersMethodLcaBSTUtil
(curr *Node, first int, second int)
Tree/Tree.go:840
↓ 1 callersFunctionLeftShiftEx
(a int)
Searching/BitManipulation.go:46
↓ 1 callersMethodLen
()
Stack/StackLinkedList.go:33
↓ 1 callersMethodLen
()
Queue/QueueLinkedLIst.go:33
↓ 1 callersMethodLen
()
Queue/Queue.go:39
↓ 1 callersFunctionLongestCommonSubseq
(X string, Y string)
AlgorithmsChapters/DP/LongestCommonSubseq.go:5
↓ 1 callersMethodLoopPointDetect
()
LinkedLIst/LinkedLIst.go:413
↓ 1 callersMethodLoopTypeDetect
()
LinkedLIst/LinkedLIst.go:371
↓ 1 callersFunctionMain10A
()
Searching/Searching.go:824
↓ 1 callersMethodMakeLoop
()
LinkedLIst/LinkedLIst.go:330
↓ 1 callersFunctionMakePairs
(nuts []int, bolts []int)
AlgorithmsChapters/DAC/NutsAndBolts.go:7
↓ 1 callersFunctionMatchPattern
* true true true false */
String/StringEx.go:41
↓ 1 callersFunctionMatrixChainMulBU
(p []int, n int)
AlgorithmsChapters/DP/MatrixCM.go:63
↓ 1 callersFunctionMatrixChainMulBU2
(p []int, n int)
AlgorithmsChapters/DP/MatrixCM.go:93
↓ 1 callersFunctionMatrixChainMulBruteForce
(p []int, n int)
AlgorithmsChapters/DP/MatrixCM.go:9
↓ 1 callersFunctionMatrixChainMulTD
(p []int, n int)
AlgorithmsChapters/DP/MatrixCM.go:35
↓ 1 callersFunctionMaxActivities
(s, f []int, n int)
AlgorithmsChapters/Greedy/ActivitySelection.go:19
↓ 1 callersFunctionMaxConSub
* (0 to 1) (3 to 3) (4 to 6) (7 to 7) (8 to 9) */
Searching/Searching.go:2625
↓ 1 callersFunctionMaxConSubArr
* 15 */
Searching/Searching.go:2649
↓ 1 callersFunctionMaxConSubArr2
(A []int, sizeA int, B []int, sizeB int)
Searching/Searching.go:2675
↓ 1 callersMethodMaxLengthPathBT
()
Tree/Tree.go:532
↓ 1 callersFunctionMaxMinArr
(arr []int, size int)
IntroductoryChapters/Intro.go:330
↓ 1 callersFunctionMaxMinArr2
(arr []int, size int)
IntroductoryChapters/Intro.go:354
↓ 1 callersFunctionMaxProfit
* 4 4 */
Searching/Searching.go:1739
↓ 1 callersFunctionMaxProfit2
(stocks []int)
Searching/Searching.go:1758
↓ 1 callersFunctionMaxRobbery
(house []int)
AlgorithmsChapters/DP/HouseRobber.go:8
↓ 1 callersFunctionMaxRobbery2
(house []int)
AlgorithmsChapters/DP/HouseRobber.go:22
↓ 1 callersFunctionMaxSubArraySum
(data []int)
IntroductoryChapters/Intro.go:114
↓ 1 callersFunctionMaxValueJobs
MaxValueJobs calculates the maximum value of jobs that can be performed. It uses a recursive approach.
AlgorithmsChapters/DP/JobScheduling.go:24
↓ 1 callersFunctionMaxValueJobsBU
MaxValueJobsBU calculates the maximum value of jobs that can be performed. It uses bottom-up dynamic programming to avoid recursion.
AlgorithmsChapters/DP/JobScheduling.go:107
↓ 1 callersFunctionMaxValueJobsTD
MaxValueJobsTD calculates the maximum value of jobs that can be performed. It uses top-down memoization (dynamic programming) to avoid redundant calcu
AlgorithmsChapters/DP/JobScheduling.go:61
↓ 1 callersFunctionMergeSort
(arr []int)
Sorting/MergeSort.go:5
↓ 1 callersFunctionMinCoins
Greedy
AlgorithmsChapters/DP/CoinChange.go:11
↓ 1 callersFunctionMinCoins2
Brute Force
AlgorithmsChapters/DP/CoinChange.go:32
↓ 1 callersFunctionMinCoinsBU
(coins []int, n int, val int)
AlgorithmsChapters/DP/CoinChange.go:52
↓ 1 callersFunctionMinCoinsBU2
(coins []int, n int, val int)
AlgorithmsChapters/DP/CoinChange.go:73
↓ 1 callersFunctionMinCoinsTD
(coins []int, n int, val int)
AlgorithmsChapters/DP/CoinChange.go:111
↓ 1 callersFunctionMinCoinsTDUtil
(minCoins []int, coins []int, val int)
AlgorithmsChapters/DP/CoinChange.go:119
↓ 1 callersFunctionMinCost
(cost [][]int, m int, n int)
AlgorithmsChapters/DP/GridMinCost.go:5
↓ 1 callersFunctionMinCostBSTBU
(arr []int)
AlgorithmsChapters/DP/MinCostBinaryTree.go:69
↓ 1 callersFunctionMinCostBSTTD
(arr []int)
AlgorithmsChapters/DP/MinCostBinaryTree.go:22
↓ 1 callersFunctionMinCostBU
(cost [][]int, m int, n int)
AlgorithmsChapters/DP/GridMinCost.go:15
↓ 1 callersFunctionMinCostTravel
days are must travel days, costs are cost of tickets.
AlgorithmsChapters/DP/Vacation.go:20
↓ 1 callersFunctionMinDiffPair
(arr1 []int, arr2 []int)
Searching/Searching.go:919
↓ 1 callersFunctionMinDiffPair2
(arr1 []int, arr2 []int)
Searching/Searching.go:939
↓ 1 callersFunctionMinStairCost
(cost []int, n int)
AlgorithmsChapters/DP/MinStairCost.go:5
↓ 1 callersFunctionMissingValues
* 7 true 7 true 7 true 7 true 7 true 7 true 7 true 7 true */
Searching/Searching.go:431
↓ 1 callersFunctionMissingValues2
(arr []int)
Searching/Searching.go:459
↓ 1 callersFunctionMissingValues3
(arr []int)
Searching/Searching.go:476
↓ 1 callersFunctionNQueens
(n int)
AlgorithmsChapters/BT/NQueen.go:8
↓ 1 callersFunctionNewActivity
(a, b int)
AlgorithmsChapters/Greedy/ActivitySelection.go:12
↓ 1 callersFunctionNewBTree
Constructor
Tree/BTree.go:14
↓ 1 callersFunctionNewBinaryIndexTree
(arr []int)
Tree/BinaryIndexTree.go:10
↓ 1 callersFunctionNewHashTable
(tableSize int)
HashTable/HashTableLP.go:18
↓ 1 callersFunctionNewHashTableSC
()
HashTable/HashTableSC.go:16
↓ 1 callersFunctionNewHuffmanTree
(arr []rune, freq []int)
AlgorithmsChapters/Greedy/HuffmanTree.go:26
↓ 1 callersFunctionNewItem
(weight, cost int)
AlgorithmsChapters/Greedy/Knapsack.go:14
↓ 1 callersFunctionNewItems
(a, b int)
AlgorithmsChapters/Greedy/FractionalKnapsack.go:13
↓ 1 callersFunctionNewJob
(id rune, deadline int, profit int)
AlgorithmsChapters/Greedy/JobSequencing.go:14
↓ 1 callersFunctionNewJobSequencing
(ids []rune, deadlines []int, profits []int, n int)
AlgorithmsChapters/Greedy/JobSequencing.go:28
↓ 1 callersFunctionNewMedianHeap
()
Heap/heap2.go:256
↓ 1 callersFunctionNewMedianHeap
()
Heap/Heap.go:247
↓ 1 callersFunctionNewNode
(data int, left, right *Node)
Tree/AVLTree.go:17
↓ 1 callersFunctionNewNode
(d int, l, r *Node)
Tree/SPLAYTree.go:20
← previousnext →501–600 of 1,518, ranked by callers