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 callersFunctionNewQueue
()
Queue/QueueLinkedLIst.go:12
↓ 1 callersFunctionNewRBTree
()
Tree/RBTree.go:10
↓ 1 callersFunctionNewRmqST
(input []int)
Tree/rmqST.go:13
↓ 1 callersFunctionNewSPLAYTree
()
Tree/SPLAYTree.go:9
↓ 1 callersFunctionNewSegmentTree
(input []int)
Tree/SegmentTree.go:13
↓ 1 callersFunctionNewStack
()
Stack/StackLinkedList.go:12
↓ 1 callersFunctionNewrangeMaxST
(input []int)
Tree/rangeMaxST.go:13
↓ 1 callersMethodNthInOrder
(index int)
Tree/Tree.go:128
↓ 1 callersMethodNthNodeFromEnd
(index int)
LinkedLIst/LinkedLIst.go:299
↓ 1 callersMethodNthNodeFromEnd2
(index int)
LinkedLIst/LinkedLIst.go:309
↓ 1 callersMethodNthPostOrder
(index int)
Tree/Tree.go:111
↓ 1 callersMethodNthPreOrder
(index int)
Tree/Tree.go:94
↓ 1 callersMethodNumFullNodesBT
()
Tree/Tree.go:515
↓ 1 callersMethodNumLeafNodes
()
Tree/Tree.go:559
↓ 1 callersFunctionNumberOfTriangles
* Triplet : 1 2 3 Triplet : 2 3 4 Triplet : 1 9 17 Triplet is : 1 3 9 */
Searching/Searching.go:1323
↓ 1 callersFunctionNumberOfTriangles2
(arr []int, size int)
Searching/Searching.go:1338
↓ 1 callersFunctionOddCount
* 12 15 16 20 22 12 15 16 20 22 12 15 16 20 22 */
Searching/Searching.go:511
↓ 1 callersFunctionOddCount2
(arr []int)
Searching/Searching.go:520
↓ 1 callersFunctionOddCountElements
(arr []int)
Searching/Searching.go:538
↓ 1 callersFunctionOptimalBSTCost
(keys []int, freq []int)
AlgorithmsChapters/DP/OptimalBST.go:8
↓ 1 callersFunctionOptimalBSTCostBU
(keys []int, freq []int)
AlgorithmsChapters/DP/OptimalBST.go:76
↓ 1 callersFunctionOptimalBSTCostBU2
(keys []int, freq []int)
AlgorithmsChapters/DP/OptimalBST.go:109
↓ 1 callersFunctionOptimalBSTCostTD
(keys []int, freq []int)
AlgorithmsChapters/DP/OptimalBST.go:37
↓ 1 callersFunctionOptimalMergePattern
(lists []int, size int)
AlgorithmsChapters/Greedy/OptimalMergePattern.go:7
↓ 1 callersFunctionOrEx
(a int, b int)
Searching/BitManipulation.go:50
↓ 1 callersFunctionPartition01
(arr []int, size int)
Sorting/SortingEx.go:21
↓ 1 callersFunctionPartition012
(arr []int, size int)
Sorting/SortingEx.go:73
↓ 1 callersFunctionPartition012_
(arr []int, size int)
Sorting/SortingEx.go:42
↓ 1 callersMethodPathExist
* Topological order of the given graph is: 1 3 4 5 6 7 8 0 2 */
Graph/Graph.go:240
↓ 1 callersMethodPerimeter
()
Basics/Shape.go:10
↓ 1 callersFunctionPermutation
(arr []int, i int, length int)
AlgorithmsChapters/BT/Permutations.go:8
↓ 1 callersFunctionPermutation
(data []int, i int, length int)
IntroductoryChapters/Intro.go:579
↓ 1 callersFunctionPermutation2
(arr []int, i int, length int)
AlgorithmsChapters/BT/Permutations.go:20
↓ 1 callersFunctionPermutation3
(arr []int, i int, length int)
AlgorithmsChapters/BT/Permutations.go:43
↓ 1 callersMethodPop
()
Stack/StackLinkedList.go:22
↓ 1 callersFunctionPow
* String is not a Palindrome String is a Palindrome */
String/StringEx.go:180
↓ 1 callersMethodPrimsMST
()
Graph/GraphAM.go:138
↓ 1 callersMethodPrimsMST
* Shortest Paths: (0->4->1 @ 0) (0->4->1->2 @ 1) (0->4->1->2->3 @ 2) (0->4 @ 2) */
Graph/Graph.go:1315
↓ 1 callersMethodPrint
()
AlgorithmsChapters/Greedy/JobSequencing.go:46
↓ 1 callersMethodPrint
()
AlgorithmsChapters/Greedy/HuffmanTree.go:58
↓ 1 callersMethodPrint
()
Graph/GraphAM.go:34
↓ 1 callersMethodPrint
()
HashTable/HashTableSC.go:93
↓ 1 callersMethodPrint
()
Stack/StackLinkedList.go:41
↓ 1 callersMethodPrint
()
Queue/Queue.go:43
↓ 1 callersMethodPrintAllPath
()
Tree/Tree.go:783
↓ 1 callersFunctionPrintAnagram
* elppa world hello */
String/StringEx.go:288
↓ 1 callersMethodPrintBreadthFirst
()
Tree/Tree.go:145
↓ 1 callersMethodPrintDLL
()
Tree/Tree.go:623
↓ 1 callersMethodPrintDataInRange
(min int, max int)
Tree/Tree.go:877
↓ 1 callersMethodPrintDepthFirst
()
Tree/Tree.go:232
↓ 1 callersFunctionPrintFirstRepeating
* Repeating elements are: 4 1 */
HashTable/HashTableExercise.go:102
↓ 1 callersFunctionPrintLargerHalf
(arr []int, size int)
Heap/heap2.go:499
↓ 1 callersFunctionPrintLargerHalf
(arr []int, size int)
Heap/Heap.go:484
↓ 1 callersFunctionPrintLargerHalf2
(arr []int, size int)
Heap/heap2.go:507
↓ 1 callersFunctionPrintLargerHalf2
(arr []int, size int)
Heap/Heap.go:492
↓ 1 callersFunctionPrintLargerHalf3
(arr []int, size int)
Heap/heap2.go:519
↓ 1 callersFunctionPrintLargerHalf3
(arr []int, size int)
Heap/Heap.go:504
↓ 1 callersMethodPrintLevelOrderLineByLine
()
Tree/Tree.go:169
↓ 1 callersMethodPrintLevelOrderLineByLine2
()
Tree/Tree.go:207
↓ 1 callersMethodPrintPostOrder
()
Tree/Tree.go:66
↓ 1 callersMethodPrintPreOrder
()
Tree/Tree.go:52
↓ 1 callersFunctionPrintRepeating
* Missing number is: 4 */
HashTable/HashTableExercise.go:80
↓ 1 callersMethodPrintSpiralTree
()
Tree/Tree.go:251
↓ 1 callersMethodPush
(data interface{})
Stack/StackLinkedList.go:18
↓ 1 callersFunctionQuickSelect
(arr []int, key int)
Sorting/QuickSelect.go:5
↓ 1 callersFunctionQuickSort
(arr []int)
Sorting/QuickSort.go:5
↓ 1 callersFunctionRadixSort
(arr []int)
Sorting/RadixSort.go:5
↓ 1 callersFunctionRainWater
* 6 6 */
Searching/Searching.go:2709
↓ 1 callersFunctionRainWater2
(arr []int, size int)
Searching/Searching.go:2738
↓ 1 callersFunctionRangePartition
(arr []int, size int, lower int, higher int)
Sorting/SortingEx.go:104
↓ 1 callersMethodRangeSum
Range sum in the range start to end.
Tree/BinaryIndexTree.go:45
↓ 1 callersMethodRemove
()
AlgorithmsChapters/Greedy/ChotaBhim.go:130
↓ 1 callersMethodRemove
(key int)
HashTable/HashTableLP.go:90
↓ 1 callersMethodRemove
(key int)
HashTable/HashTableSC.go:43
↓ 1 callersMethodRemove
()
Queue/QueueLinkedLIst.go:22
↓ 1 callersFunctionRemoveDuplicate
* IsAnagram: true IsAnagram: false */
HashTable/HashTableExercise.go:35
↓ 1 callersMethodRemoveDuplicate
()
LinkedLIst/LinkedLIst.go:193
↓ 1 callersMethodRemoveDuplicate
()
LinkedLIst/DoublyLinkedList.go:206
↓ 1 callersFunctionRemoveDuplicates
* Repeating elements: 7 Repeating elements: 7 Repeating elements: 7 Repeating elements: 7 */
Searching/Searching.go:236
↓ 1 callersFunctionRemoveDuplicates2
(arr []int)
Searching/Searching.go:249
↓ 1 callersMethodRemoveHead
()
LinkedLIst/LinkedLIst.go:102
↓ 1 callersMethodRemoveHead
()
LinkedLIst/CircularLinkedList.go:56
↓ 1 callersMethodRemoveHead
()
LinkedLIst/DoublyCircularLIst.go:105
↓ 1 callersMethodRemoveLoop
()
LinkedLIst/LinkedLIst.go:390
↓ 1 callersMethodRemoveNode
(key int)
LinkedLIst/CircularLinkedList.go:100
↓ 1 callersMethodRemoveNode
(key int)
LinkedLIst/DoublyLinkedList.go:77
↓ 1 callersMethodRemoveTail
()
LinkedLIst/DoublyCircularLIst.go:127
↓ 1 callersFunctionResetRightMostBit
(a int)
Searching/BitManipulation.go:54
↓ 1 callersFunctionReverseArr
(arr []int, start int, stop int)
IntroductoryChapters/Intro.go:346
↓ 1 callersMethodReverseList
()
LinkedLIst/DoublyLinkedList.go:135
↓ 1 callersMethodReverseListLoopDetect
()
LinkedLIst/LinkedLIst.go:358
↓ 1 callersFunctionReverseString
* 1 0 -1 */
String/StringEx.go:235
↓ 1 callersFunctionReverseWords
(str string)
String/StringEx.go:259
↓ 1 callersFunctionRightMostBit
(a int)
Searching/BitManipulation.go:58
↓ 1 callersFunctionRightShiftEx
(a int)
Searching/BitManipulation.go:62
↓ 1 callersFunctionRobinKarp
(text string, pattern string)
String/StringMatching.go:24
↓ 1 callersFunctionRotateArray
(data []int, k int)
IntroductoryChapters/Intro.go:80
↓ 1 callersFunctionRotationMax
(arr []int)
Searching/Searching.go:1888
↓ 1 callersFunctionRotationMax2
(arr []int)
Searching/Searching.go:1898
↓ 1 callersFunctionRottenFruit
(arr [][]int, maxCol int, maxRow int)
Queue/QueueEX.go:301
← previousnext →601–700 of 1,518, ranked by callers