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 callersFunctionfibonacciTDUtil
(n int, dp []int)
AlgorithmsChapters/DP/Fibo.go:45
↓ 1 callersFunctionfindBalancedPoint
* isAP : true isAP : true isAP : true */
Searching/Searching.go:2265
↓ 1 callersFunctionfindCeil
(arr []int, size int, value int)
Searching/Searching.go:2316
↓ 1 callersFunctionfindCelebrity
(relation [][]int, count int)
Stack/StackExercise.go:977
↓ 1 callersFunctionfindCelebrity2
(relation [][]int, count int)
Stack/StackExercise.go:994
↓ 1 callersFunctionfindCelebrity3
(relation [][]int, count int)
Stack/StackExercise.go:1019
↓ 1 callersFunctionfindDuplicateParenthesis
* Output: reverse Parenthesis is : 3 */
Stack/StackExercise.go:454
↓ 1 callersFunctionfindFloor
* BalancedPoint : 3 */
Searching/Searching.go:2294
↓ 1 callersMethodfindKey
Returns the index of first key which is greater than or equal to key.
Tree/BTree.go:230
↓ 1 callersFunctionfindKeyCount
(data []int, key int)
Searching/Searching.go:1678
↓ 1 callersFunctionfindKeyCount2
(data []int, key int)
Searching/Searching.go:1689
↓ 1 callersFunctionfindLargestIsland
(arr [][]int, maxCol int, maxRow int)
Queue/QueueEX.go:630
↓ 1 callersFunctionfindLargestIslandUtil
* 0 1 0 0 1 0 0 1 0 1 1 1 2 1 0 2 2 2 1 0 3 3 2 1 0 */
Queue/QueueEX.go:612
↓ 1 callersFunctionfindLastIndex
(data []int, start int, end int, key int)
Searching/Searching.go:1712
↓ 1 callersMethodfindMaxBT
(curr *Node)
Tree/Tree.go:932
↓ 1 callersFunctionfindMedian
* Purchase day is 2 at price 6 Sell day is 10 at price 150 Max Profit: 144 Purchase day is 2 at price 6 Sell day is 10 at price 150 Max Profit: 144
Searching/Searching.go:1798
↓ 1 callersMethodfindMin
(curr *Node)
Tree/Tree.go:365
↓ 1 callersFunctionfindTriplet
* Zero Sum Triplets are : (1 2 -3) (1 -4 3) (-4 7 -3) Zero Sum Triplets are : (-4 -3 7)(-4 1 3)(-3 1 2) */
Searching/Searching.go:1128
↓ 1 callersFunctionfindTriplet2
(arr []int, value int)
Searching/Searching.go:1143
↓ 1 callersMethodfindUtil
(curr *TreeNode, value string)
String/StringTree.go:64
↓ 1 callersMethodfindUtil
(currentNode *TSTNode, searchWord string, currentIndex int)
String/TST.go:45
↓ 1 callersMethodfindUtil
(curr *TrieNode, str string, index int)
String/Trie.go:71
↓ 1 callersFunctionfirstNegSlidingWindows
* Max of min is: 59 */
Queue/QueueEX.go:250
↓ 1 callersMethodfixBTree
Make sure that the node have at least min number of keys
Tree/BTree.go:300
↓ 1 callersMethodfixDoubleBlack
(x *Node)
Tree/RBTree.go:262
↓ 1 callersMethodfixRedRed
(x *Node)
Tree/RBTree.go:172
↓ 1 callersMethodfrequencyUtil
(curr *TreeNode, value string)
String/StringTree.go:83
↓ 1 callersFunctionfun1
(n int)
IntroductoryChapters/Analysis.go:8
↓ 1 callersFunctionfun10
(n int)
IntroductoryChapters/Analysis.go:100
↓ 1 callersFunctionfun11
(n int)
IntroductoryChapters/Analysis.go:110
↓ 1 callersFunctionfun12
(n int)
IntroductoryChapters/Analysis.go:125
↓ 1 callersFunctionfun13
(n int)
IntroductoryChapters/Analysis.go:136
↓ 1 callersFunctionfun2
(n int)
IntroductoryChapters/Analysis.go:16
↓ 1 callersFunctionfun3
(n int)
IntroductoryChapters/Analysis.go:26
↓ 1 callersFunctionfun4
(n int)
IntroductoryChapters/Analysis.go:38
↓ 1 callersFunctionfun5
(n int)
IntroductoryChapters/Analysis.go:50
↓ 1 callersFunctionfun6
(n int)
IntroductoryChapters/Analysis.go:60
↓ 1 callersFunctionfun7
(n int)
IntroductoryChapters/Analysis.go:70
↓ 1 callersFunctionfun8
(n int)
IntroductoryChapters/Analysis.go:80
↓ 1 callersFunctionfun9
(n int)
IntroductoryChapters/Analysis.go:90
↓ 1 callersFunctionfunction1
()
Stack/StackExercise.go:14
↓ 1 callersFunctionfunction1
()
IntroductoryChapters/Intro.go:30
↓ 1 callersFunctionfunction2
()
Stack/StackExercise.go:10
↓ 1 callersFunctionfunction2
()
IntroductoryChapters/Intro.go:26
↓ 1 callersFunctiongetHeight
(arr []int, height []int, index int)
Graph/Graph.go:933
↓ 1 callersMethodgetIntersity
()
Basics/Bulb.go:53
↓ 1 callersFunctiongetMajority
* 5 5 5 */
Searching/Searching.go:1441
↓ 1 callersFunctiongetMajority2
(data []int)
Searching/Searching.go:1464
↓ 1 callersFunctiongetMajority3
(data []int)
Searching/Searching.go:1482
↓ 1 callersFunctiongetMax
(arr []int, n int)
Sorting/RadixSort.go:15
↓ 1 callersFunctiongetMax
* 3 3 */
Searching/Searching.go:1371
↓ 1 callersFunctiongetMax2
(data []int)
Searching/Searching.go:1391
↓ 1 callersFunctiongetMax3
(data []int, dataRange int)
Searching/Searching.go:1413
↓ 1 callersFunctiongetMaxCost01TDUtil
(dp [][]int, items []*Item, n, capacity int)
AlgorithmsChapters/DP/Knapsack.go:75
↓ 1 callersFunctiongetMaxCost01Util
(items []*Item, n, capacity int)
AlgorithmsChapters/DP/Knapsack.go:43
↓ 1 callersMethodgetMaxUtil
(segStart int, segEnd int, queryStart int, queryEnd int, index int)
Tree/rangeMaxST.go:56
↓ 1 callersMethodgetMedian
()
Heap/heap2.go:292
↓ 1 callersMethodgetMedian
()
Heap/Heap.go:283
↓ 1 callersMethodgetMinUtil
(segStart int, segEnd int, queryStart int, queryEnd int, index int)
Tree/rmqST.go:83
↓ 1 callersMethodgetPred
To get predecessor of keys[index]
Tree/BTree.go:278
↓ 1 callersMethodgetSucc
To get successor of keys[index]
Tree/BTree.go:289
↓ 1 callersMethodgetSumUtil
(segStart int, segEnd int, queryStart int, queryEnd int, index int)
Tree/SegmentTree.go:49
↓ 1 callersFunctiongraphColouringUtil
(graph [][]bool, V int, m int, colour []int, i int)
AlgorithmsChapters/BT/GraphColouring.go:15
↓ 1 callersFunctiongraphColouringUtil2
(graph [][]bool, V int, m int, colour []int, i int)
AlgorithmsChapters/BT/GraphColouring.go:52
↓ 1 callersFunctiongreater
(value1 int, value2 int)
Sorting/ShellSort.go:5
↓ 1 callersMethodhamiltonianCycle
* Hamiltonian Path found :: 0 1 2 4 3 hamiltonianPath : true Hamiltonian Path found :: 0 3 1 2 4 hamiltonianPath : true */
Graph/GraphAM.go:316
↓ 1 callersMethodhamiltonianCycleUtil
(path []int, pSize int, added []int)
Graph/GraphAM.go:332
↓ 1 callersMethodhamiltonianPathUtil
(path []int, pSize int, added []int)
Graph/GraphAM.go:244
↓ 1 callersFunctionheightTreeParentArr
(arr []int)
Graph/Graph.go:896
↓ 1 callersFunctionheightTreeParentArr2
(arr []int)
Graph/Graph.go:941
↓ 1 callersMethodincrement1
()
Basics/AccesserModifier.go:7
↓ 1 callersMethodincrement2
()
Basics/AccesserModifier.go:11
↓ 1 callersFunctionindexArray
(arr []int, size int)
IntroductoryChapters/Intro.go:169
↓ 1 callersFunctionindexArray2
(arr []int, size int)
IntroductoryChapters/Intro.go:189
↓ 1 callersMethodinsert
(value int)
Heap/heap2.go:266
↓ 1 callersMethodinsert
(value int)
Heap/Heap.go:257
↓ 1 callersMethodinsertUtil
(node *Node, data int)
Tree/RBTree.go:159
↓ 1 callersMethodinsertUtil
(node *Node, data int)
Tree/AVLTree.go:44
↓ 1 callersMethodinsertUtil
Insert a new key in this node Arguments are parent, child, index of child and key.
Tree/BTree.go:121
↓ 1 callersMethodinsertUtil
(value string, curr *TreeNode)
String/StringTree.go:36
↓ 1 callersMethodinsertUtil
(currentNode *TSTNode, word string, currentIndex int)
String/TST.go:19
↓ 1 callersMethodinsertUtil
(curr *TrieNode, str string, index int)
String/Trie.go:28
↓ 1 callersFunctionisAP
(arr []int, size int)
Searching/Searching.go:2172
↓ 1 callersFunctionisAP2
(arr []int, size int)
Searching/Searching.go:2187
↓ 1 callersFunctionisAP3
(arr []int, size int)
Searching/Searching.go:2220
↓ 1 callersMethodisBST
(curr *Node, min int, max int)
Tree/Tree.go:658
↓ 1 callersMethodisBST2
(root *Node, count *int)
Tree/Tree.go:673
↓ 1 callersMethodisBST3
(root *Node)
Tree/Tree.go:641
↓ 1 callersMethodisCompleteTree
(root *Node)
Tree/Tree.go:699
↓ 1 callersMethodisCompleteTreeUtil
(curr *Node, index int, count int)
Tree/Tree.go:736
↓ 1 callersMethodisCyclePresentDFS
* Cycle Present: false Cycle Present: false Cycle Present: false IsConnectedUndirected: true Cycle Present: true Cycle Present: true Cycle Present: tr
Graph/Graph.go:657
↓ 1 callersMethodisCyclePresentDFSColor
(index int, visited []int)
Graph/Graph.go:692
↓ 1 callersMethodisCyclePresentUndirectedDFS
* Node - Level 1 - 0 2 - 1 0 - 1 5 - 2 4 - 2 6 - 3 3 - 3 BfsDistance : 3 */
Graph/Graph.go:475
↓ 1 callersMethodisEqual
(node1 *Node, node2 *Node)
Tree/Tree.go:438
↓ 1 callersFunctionisGraphColouredProperly
Check if the whole graph is coloured properly.
AlgorithmsChapters/BT/GraphColouring.go:33
↓ 1 callersFunctionisGraphColouredProperly2
Check if the whole graph is coloured properly.
AlgorithmsChapters/BT/GraphColouring.go:68
↓ 1 callersMethodisHeapUtil
(curr *Node, parentValue int)
Tree/Tree.go:753
↓ 1 callersMethodisHeapUtil2
(curr *Node, index int, count int, parentValue int)
Tree/Tree.go:769
↓ 1 callersFunctionisSafe
(board []int, col int)
AlgorithmsChapters/BT/NQueen.go:27
↓ 1 callersFunctionisValid
(arr []int, n int)
AlgorithmsChapters/BT/Permutations.go:34
← previousnext →801–900 of 1,518, ranked by callers