Functions — github.com/Hemant-Jain-Author/Data-Structures-Algorithms-In-Go

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

↓ 4 callersFunctionCreateCompleteBinaryTree

(arr []int)

Tree/Tree.go:17

↓ 4 callersMethodGetSum

(start int, end int)

Tree/SegmentTree.go:40

↓ 4 callersMethodIsEmpty

()

Graph/hp.go:81

↓ 4 callersMethodIsEmpty

IsEmpty checks if the stack is empty.

Queue/QueueUsingStack.go:94

↓ 4 callersMethodIsEmpty

IsEmpty checks if the queue is empty.

Queue/QueueLL.go:21

↓ 4 callersFunctionMatchExp

(exp string, str string)

String/StringEx.go:7

↓ 4 callersFunctionNewItem

(weight, cost int)

AlgorithmsChapters/DP/Knapsack.go:13

↓ 4 callersMethodPrefixSum

Prefix sum in the range 0 to index.

Tree/BinaryIndexTree.go:55

↓ 4 callersMethodPrint

()

HashTable/HashTableLP.go:106

↓ 4 callersMethodPrintTree

()

Tree/AVLTree.go:181

↓ 4 callersMethodPush

(x interface{})

Collections/Heap.go:47

↓ 4 callersMethodResolverFun

(index int)

HashTable/HashTableLP.go:32

↓ 4 callersMethodReverse

()

LinkedLIst/LinkedLIst.go:160

↓ 4 callersFunctionfind

root element of set

Graph/Graph.go:566

↓ 4 callersMethodleftRotate

Function to left rotate subtree rooted with x

Tree/AVLTree.go:94

↓ 4 callersFunctionmax

(a, b int)

AlgorithmsChapters/DP/Knapsack.go:132

↓ 4 callersFunctionmin

(a, b int)

AlgorithmsChapters/DP/CoinChange.go:141

↓ 4 callersFunctionmin

(a, b int)

AlgorithmsChapters/DP/OptimalBST.go:69

↓ 4 callersFunctionnewNode

(c int, p int)

LinkedLIst/Polynomial.go:19

↓ 4 callersMethodremoveUtil

(node *Node, key int)

Tree/BTree.go:204

↓ 4 callersMethodrightRotate

Function to right rotate subtree rooted with x

Tree/AVLTree.go:77

↓ 4 callersMethodsplay

(node *Node)

Tree/SPLAYTree.go:114

↓ 4 callersMethodtransposeGraph

* isCyclePresent : false isCyclePresent : false isCyclePresent : true isCyclePresent : true */

Graph/Graph.go:748

↓ 3 callersMethodAdd

(key int, args ...int)

HashTable/HashTableLP.go:36

↓ 3 callersMethodAdd

(key int, args ...int)

HashTable/HashTableSC.go:28

↓ 3 callersMethodAdd

Add adds an element to the queue.

Queue/StackUsingQueue.go:88

↓ 3 callersMethodAdd

Add adds an element to the queue.

Queue/QueueUsingStack.go:11

Add adds an element to the rear of the queue.

Queue/QueueLL.go:35

↓ 3 callersMethodAddTail

(value int)

LinkedLIst/LinkedLIst.go:48

↓ 3 callersMethodAddTail

(value int)

LinkedLIst/DoublyCircularLIst.go:88

↓ 3 callersMethodBack

()

Queue/QueueEX.go:717

↓ 3 callersFunctionCreateBinarySearchTree

(arr []int)

Tree/Tree.go:976

↓ 3 callersMethodDelete

(data int)

Tree/AVLTree.go:122

↓ 3 callersMethodFind

(value int)

Tree/Tree.go:286

↓ 3 callersMethodFind

(value string)

String/StringTree.go:60

↓ 3 callersMethodFind

(searchWord string)

String/TST.go:65

↓ 3 callersMethodFind

(s string)

String/Trie.go:63

↓ 3 callersFunctionFindRotationMaxUtil

* 8 8 */

Searching/Searching.go:1872

↓ 3 callersMethodGet

(key interface{})

HashTable/HashTableExercise.go:249

↓ 3 callersMethodGet

(key interface{})

Collections/Counter.go:16

↓ 3 callersMethodHas

(key interface{})

Collections/Counter.go:12

↓ 3 callersMethodInsert

(value string)

String/StringTree.go:32

↓ 3 callersMethodInsert

(word string)

String/TST.go:15

↓ 3 callersMethodInsert

(s string)

String/Trie.go:19

↓ 3 callersMethodInsert

(key interface{})

Collections/Counter.go:9

↓ 3 callersMethodIsEmpty

()

LinkedLIst/DoublyLinkedList.go:21

↓ 3 callersMethodIsEmpty

()

LinkedLIst/DoublyCircularLIst.go:21

↓ 3 callersMethodIsEmpty

()

Stack/StackLL.go:19

↓ 3 callersMethodIsEmpty

()

Queue/QueueEX.go:722

↓ 3 callersMethodLcaBST

(first int, second int)

Tree/Tree.go:836

↓ 3 callersFunctionNewHeap

(comp func(x interface{}, y interface{}) bool)

Collections/Heap.go:13

↓ 3 callersFunctionNewJob

(i1, i2, i3 int)

AlgorithmsChapters/DP/JobScheduling.go:14

↓ 3 callersFunctionNewNode

Constructor

Tree/BTree.go:30

↓ 3 callersFunctionNewPoint

(a, b int)

AlgorithmsChapters/DAC/ClosestPair.go:14

↓ 3 callersMethodNumNodes

Pop removes and returns the element at the top of the stack.

Queue/QueueUsingStack.go:75

↓ 3 callersMethodPrint

()

Stack/StackLL.go:48

↓ 3 callersFunctionPrintSlice

(data []int)

Basics/untitled.go:44

↓ 3 callersMethodPrintTree

()

Tree/RBTree.go:132

↓ 3 callersMethodPush

(data interface{})

Stack/Stack.go:9

↓ 3 callersMethodRemove

()

AlgorithmsChapters/Greedy/HuffmanTree.go:136

↓ 3 callersMethodRemove

(key interface{})

HashTable/HashTableExercise.go:262

↓ 3 callersMethodRemove

(key int)

Tree/BTree.go:190

↓ 3 callersMethodRemove

Remove removes and returns the element at the front of the queue.

Queue/QueueUsingStack.go:16

↓ 3 callersMethodRemoveBack

()

Queue/QueueEX.go:706

↓ 3 callersFunctionReverseArray

(data []int, start int, end int)

IntroductoryChapters/Intro.go:87

↓ 3 callersMethodSize

()

LinkedLIst/LinkedLIst.go:27

↓ 3 callersFunctionStrcmp

* 25 */

String/StringEx.go:200

↓ 3 callersFunctiondistance

(a, b *Point)

AlgorithmsChapters/DAC/ClosestPair.go:18

↓ 3 callersMethodhamiltonianPath

* Shortest Paths: (1->0 @ 4) (1->2 @ 8) (1->2->3 @ 15) (1->2->5->4 @ 22) (1->2->5 @ 12) (1->7->6 @ 12) (1->7 @ 11) (1->2->8 @ 10) Edges are : ( 0->1

Graph/GraphAM.go:228

↓ 3 callersMethodisOnFun

()

Basics/Bulb.go:10

↓ 3 callersMethodjoinParentChild

(u *Node, v *Node)

Tree/RBTree.go:340

↓ 3 callersFunctionmax

(a, b int)

AlgorithmsChapters/DP/MinCostBinaryTree.go:15

↓ 3 callersFunctionmax

(i, j int)

AlgorithmsChapters/DP/JobScheduling.go:135

↓ 3 callersFunctionmax

(a int, b int)

Searching/Searching.go:2856

↓ 3 callersMethodmax

(first int, second int)

Tree/rangeMaxST.go:40

↓ 3 callersMethodmerge

Merge node's children at index and index+1.

Tree/BTree.go:375

↓ 3 callersFunctionmin

(a, b int)

AlgorithmsChapters/DP/MatrixCM.go:86

↓ 3 callersFunctionmin

(a, b int)

AlgorithmsChapters/DP/MinStairCost.go:25

↓ 3 callersFunctionmin

(a int, b int)

Searching/Searching.go:2849

↓ 3 callersMethodmin

(first int, second int)

Tree/rmqST.go:95

↓ 3 callersFunctionnewPolynomial

()

LinkedLIst/Polynomial.go:27

↓ 3 callersMethodpercolateDown

percolateDown moves the element at the given index down the heap to its correct position

AlgorithmsChapters/Greedy/JoinRopes.go:114

↓ 3 callersMethodpercolateDown

(parent int)

AlgorithmsChapters/Greedy/ChotaBhim.go:100

↓ 3 callersMethodpercolateDown

(parent int)

AlgorithmsChapters/Greedy/OptimalMergePattern.go:63

↓ 3 callersMethodpercolateDown

(parent int)

AlgorithmsChapters/Greedy/HuffmanTree.go:106

↓ 3 callersMethodpercolateDown

(parent int)

Heap/heap2.go:35

↓ 3 callersMethodpercolateDown

(parent int)

Heap/Heap.go:41

↓ 3 callersMethodprint

()

LinkedLIst/Polynomial.go:79

↓ 3 callersMethodprintPath

(previous []int, dist []int, count int, source int)

Graph/Graph.go:1163

↓ 3 callersFunctionreverseStringRange

(a []rune, lower int, upper int)

String/StringEx.go:251

↓ 3 callersFunctionsumAll

(freq []int, i int, j int)

AlgorithmsChapters/DP/OptimalBST.go:29

↓ 3 callersFunctionswap

(arr []int, first int, second int)

AlgorithmsChapters/DAC/NutsAndBolts.go:40

↓ 3 callersMethodtreeDepth

(root *Node)

Tree/Tree.go:421

↓ 2 callersMethodAdd

Add adds a new element to the heap

AlgorithmsChapters/Greedy/JoinRopes.go:144

↓ 2 callersMethodAdd

(value interface{})

AlgorithmsChapters/Greedy/ChotaBhim.go:124

↓ 2 callersMethodAdd

(value interface{})

AlgorithmsChapters/Greedy/OptimalMergePattern.go:87

↓ 2 callersMethodAdd

(value interface{})

AlgorithmsChapters/Greedy/HuffmanTree.go:130

← previous next →101–200 of 1,518, ranked by callers