MCPcopy Create free account

hub / github.com/Lakhankumawat/LearnCPP / functions

Functions805 in github.com/Lakhankumawat/LearnCPP

↓ 1 callersFunctionlongest_word
S-Strings/LongestWordInSentence.cpp:14
↓ 1 callersFunctionmake_list
L-LinkedList/S-SinglyLinkedList/RemovingDuplicates.cpp:12
↓ 1 callersFunctionmake_sieve
M-MathematicalAlgorithms/S-SegmentedSieve/SegmentedSieve.cpp:4
↓ 1 callersFunctionmaxProfit
function to calculate max profit
D-DynamicProgramming/KnapsackwithDuplicateItems.cpp:8
↓ 1 callersFunctionmaxProfit
A-Array/Stock Buy And Sell.cpp:8
↓ 1 callersFunctionmaxSubArraySum1
Brute force Approach
A-Array/MaximumSumSubarray.cpp:7
↓ 1 callersFunctionmaxSubArraySum2
Cumulative Sum Approach
A-Array/MaximumSumSubarray.cpp:28
↓ 1 callersFunctionmaxSubArraySum3
kadene's algorithm
A-Array/MaximumSumSubarray.cpp:54
↓ 1 callersFunctionmax_of_size_k
P-Problem Statements & Solution/1-Level 1/max_of_size_k_window.cpp:13
↓ 1 callersFunctionmaximizingTheExpression
Function to return the value of the maximized expression
B-BitManipulation/MaximizeExpression.cpp:7
↓ 1 callersFunctionmerge
L-LinkedList/Merge K Sorted LinkedList/merge_k_ll.cpp:42
↓ 1 callersFunctionmerge
function to merge two sorted arrays
D-DivideAndConquerAlgorithms/MergeSort.cpp:7
↓ 1 callersFunctionmerge_k_ll
L-LinkedList/Merge K Sorted LinkedList/merge_k_ll.cpp:54
↓ 1 callersFunctionmergesort
D-DivideAndConquerAlgorithms/MergeSort.cpp:59
↓ 1 callersFunctionmiddle
Function will find the middle element of the linked list
L-LinkedList/S-SinglyLinkedList/middleElementOfLinkedList.cpp:29
↓ 1 callersFunctionminCoins
D-DynamicProgramming/CoinChange.cpp:6
↓ 1 callersFunctionminCost
D-DynamicProgramming/MinCostClimbingStairs.cpp:10
↓ 1 callersFunctionminCostClimbingStairs
D-DynamicProgramming/MinCostClimbingStairs.cpp:26
↓ 1 callersFunctionminFallingPathSum
D-DynamicProgramming/MinimumFallingPathSum.cpp:25
↓ 1 callersFunctionminSum
D-DynamicProgramming/MinimumFallingPathSum.cpp:7
↓ 1 callersFunctionminValueNode
function to get minimum key value node
T-Tree/B-BinarySearchTree/AVL.cpp:130
↓ 1 callersFunctionmin_computation
Calculating minimum computations to merge file optimally
G-GreedyAlgorithms/OptimalMergePattern.cpp:7
↓ 1 callersFunctionmirrorTransform
T-Tree/G-GenricTree/MirrorOfGenricTree.cpp:79
↓ 1 callersFunctionmultiply
G-Graphs/I-Implementation/PathMatrix.cpp:89
↓ 1 callersFunctionmyPow
D-DivideAndConquerAlgorithms/Pow.cpp:22
↓ 1 callersFunctionnewNode
T-Tree/G-GenricTree/LevelOrderTraversalOfaGenricTree.cpp:12
↓ 1 callersFunctionnewNode
A utility function to create a node
T-Tree/B-BinarySearchTree/ConstructBSTFromPreoderTraversal.cpp:18
↓ 1 callersFunctionnewNode
function that allocates a new node
T-Tree/B-BinarySearchTree/AVL.cpp:31
↓ 1 callersFunctionoddevenchecker
L-LinkedList/S-SinglyLinkedList/SegregateEvenOdd.cpp:28
↓ 1 callersFunctionpartition
S-SortingAlgorithms/QuickSort.cpp:26
↓ 1 callersFunctionpop
Printing the element from top of the stack
S-Stack/DecimalToBinary.cpp:30
↓ 1 callersFunctionpopStack
----------------This function pops the data from the stack-----------------*/
S-Stack/stackADTUsingLL.cpp:45
↓ 1 callersFunctionpop_1
------------This function pops the element from the stack 1----------------------------------*/
S-Stack/twoStackArray.cpp:40
↓ 1 callersFunctionpop_2
-------------This function pops the element from the stack 2---------------------------------*/
S-Stack/twoStackArray.cpp:53
↓ 1 callersFunctionpostOrderTraversal
---------------------Main Function--------------------------/// postOrder Traversal of Binary Tree
T-Tree/T-TreeTraversals/postorderTraversal.cpp:25
↓ 1 callersFunctionpostorder
----------------------A function for postorder traversal of the tree-------------------*/
T-Tree/T-TreeTraversals/expressionTreeTraversal.cpp:79
↓ 1 callersFunctionpower_matrix
compute pth power of matrix and store
G-Graphs/I-Implementation/PathMatrix.cpp:72
↓ 1 callersFunctionpoweroftwo
R-Recursion/PowerOfTwo.cpp:7
↓ 1 callersFunctionpowerthree
R-Recursion/PowerOfThree.cpp:7
↓ 1 callersFunctionpreOrderTraversal
---------------------Main Function--------------------------/// preOrder Traversal of Binary Tree
T-Tree/T-TreeTraversals/preorderTraversal.cpp:25
↓ 1 callersFunctionpreorder
-------------------A function for preorder traversal pf the tree----------------------*/
T-Tree/T-TreeTraversals/expressionTreeTraversal.cpp:90
↓ 1 callersFunctionprimeSumDivision
M-MathematicalAlgorithms/primeSum.cpp:23
↓ 1 callersMethodprims
G-Graphs/M-MinimumSpanningTree/primsPriorityQueue.cpp:23
↓ 1 callersFunctionprint
print function
S-SortingAlgorithms/CountingSort.cpp:39
↓ 1 callersFunctionprint
Print function print all the linklist elements
L-LinkedList/S-SinglyLinkedList/SegregateEvenOdd.cpp:45
↓ 1 callersFunctionprint
function to print linked list
L-LinkedList/Merge K Sorted LinkedList/merge_k_ll.cpp:34
↓ 1 callersFunctionprint
Utility function to print elements of an array
A-Array/Reversingofarray.cpp:6
↓ 1 callersFunctionprint
A utility function to print an array
S-SearchingAlgorithms/RadixSort.cpp:59
↓ 1 callersMethodprintAdj
G-GraphAlgorithms/S-SingleSourceShortestPath/DijsktraSSSp.cpp:23
↓ 1 callersFunctionprintArray
A utility function to print array of size n */
H-Heap/MaxHeap.cpp:65
↓ 1 callersFunctionprintArray
H-Heap/MinHeap.cpp:5
↓ 1 callersFunctionprintAugmentedPaths
G-Graphs/N-NetworkFlow/fordFulkerson.cpp:60
↓ 1 callersFunctionprintCurrentLevel
Print nodes at a current level */
T-Tree/T-TreeTraversals/levelorderTraversal.cpp:31
↓ 1 callersFunctionprintDiagonal
Perform preorder traversal on the tree & fill the map with diagonal elements
T-Tree/T-TreeTraversals/DiagonalTraversal.cpp:29
↓ 1 callersFunctionprintFirstNegativeInteger
A-Array/FirstNegativeInEveryWindow.cpp:3
↓ 1 callersMethodprintGraph
G-Graphs/I-Implementation/AdjListUsingHashmap.cpp:20
↓ 1 callersFunctionprintHeap
A utility function to print the array representation of Heap
H-Heap/Heapify.cpp:46
↓ 1 callersFunctionprintInorder
A utility function to print inorder traversal of a Binary Tree
T-Tree/B-BinarySearchTree/ConstructBSTFromPreoderTraversal.cpp:84
↓ 1 callersFunctionprintJugglerWithLoop
This function prints the juggler Sequence using loop
M-MathematicalAlgorithms/JugglerSequence/JugglerSequence.cpp:5
↓ 1 callersFunctionprintJugglerWithRec
This function prints the juggler Sequence using recursion
M-MathematicalAlgorithms/JugglerSequence/JugglerSequence.cpp:33
↓ 1 callersFunctionprintKnightsTour
B-Backtracking/TheKnight’stourproblem.cpp:17
↓ 1 callersFunctionprintKthDistinct
Function for printing the Kth distinct character using sets
S-Sets/FindKthDistinctCharacterGivenString.cpp:8
↓ 1 callersFunctionprintLevelOrder
Function to print level order traversal a tree*/
T-Tree/T-TreeTraversals/levelorderTraversal.cpp:22
↓ 1 callersFunctionprintMST
G-Graphs/M-MinimumSpanningTree/Prims.cpp:15
↓ 1 callersFunctionprintMinDelAndInsert
Function to print the output and find the Total number of insertions and total number of deletions
D-DynamicProgramming/MinimumInsertionDeletion.cpp:32
↓ 1 callersFunctionprintNGE
prints element and NGE pair for all elements of arr[] of size n */
S-Stack/NextGreaterElement/nge.cpp:8
↓ 1 callersFunctionprintRightView
T-Tree/T-TreeTraversals/RightSideViewOfBT.cpp:30
↓ 1 callersFunctionprintSolution
A utility function to print solution */
B-Backtracking/N-Queen.cpp:19
↓ 1 callersFunctionprintTargetSumSubsets
function to print subset sum
B-Backtracking/SubsetSum.cpp:10
↓ 1 callersFunctionprintTwoElements
Finding missing and repeating element
A-Array/MissingAndRepeatingNumber.cpp:6
↓ 1 callersMethodprint_graph
G-Graphs/I-Implementation/AdjacencyList.cpp:22
↓ 1 callersFunctionprint_list
L-LinkedList/S-SinglyLinkedList/RemovingDuplicates.cpp:23
↓ 1 callersFunctionprint_primes
M-MathematicalAlgorithms/S-SegmentedSieve/SegmentedSieve.cpp:32
↓ 1 callersMethodprocess
O-OOPS/I-Inheritance/Single-Inheritance.cpp:37
↓ 1 callersMethodproduct
O-OOPS/I-Inheritance/Hierarchical-Inheritance.cpp:27
↓ 1 callersMethodproduct_derived
O-OOPS/I-Inheritance/Hierarchical-Inheritance.cpp:59
↓ 1 callersFunctionpush
UTILITY FUNCTIONS */ Function to insert a node at the beginning of the Doubly Linked List */
L-LinkedList/D-DoublyLinkedList/Reverse.cpp:42
↓ 1 callersFunctionpush
Pusing the elements into the stack
S-Stack/DecimalToBinary.cpp:41
↓ 1 callersFunctionpushStack
----------------This function pushes the data into the node--------------------------*/
S-Stack/stackADTUsingLL.cpp:28
↓ 1 callersFunctionpush_1
----------------This function is used to push elements into stack 1--------------------------*/
S-Stack/twoStackArray.cpp:16
↓ 1 callersFunctionpush_2
------------This function is used to push elements in stack 2-------------------------------*/
S-Stack/twoStackArray.cpp:28
↓ 1 callersFunctionradixsort
The main function to that sorts arr[] of size n using Radix Sort
S-SearchingAlgorithms/RadixSort.cpp:46
↓ 1 callersFunctionratInMaze
B-Backtracking/RatInMaze.cpp:7
↓ 1 callersFunctionrec_num
declaring function earlier so that it will not give error.
R-Recursion/Types of Recursion/LinearRecursion.cpp:4
↓ 1 callersFunctionreverse
Function to reverse a Doubly Linked List */
L-LinkedList/D-DoublyLinkedList/Reverse.cpp:16
↓ 1 callersFunctionreverse
function to reverse a string
S-Strings/StringReverse.cpp:8
↓ 1 callersFunctionreverse1
1. Using Auxiliary Array we can create an auxiliary array of the same type and size as the input array, fill it with elements from the original array
A-Array/Reversingofarray.cpp:15
↓ 1 callersFunctionreverse2
1. Using high and low pointers we can initialize two poinetrs high and low and swapping arr[low] with arr[high] with reverse our main array(arr) wi
A-Array/Reversingofarray.cpp:35
↓ 1 callersFunctionreverseQueueWithRecursion
Reverse a queue using Recursion
Q-Queue/ReverseQueue.cpp:32
↓ 1 callersFunctionreverseQueueWithoutRecursion
Reverse a Queue without using Recursion
Q-Queue/ReverseQueue.cpp:6
↓ 1 callersFunctionreverseStr
D-DynamicProgramming/Minimum_insertions_form_palindrome.cpp:35
↓ 1 callersFunctionromanDec
function to convert roman number to integer
S-Strings/RomanDec.cpp:9
↓ 1 callersFunctionsearch
H-HashTable/HashCustomers.cpp:52
↓ 1 callersFunctionsearch
T-Tree/B-BinarySearchTree/AVL.cpp:228
↓ 1 callersFunctionsetBit
B-BitManipulation/BitManipulation.cpp:13
↓ 1 callersMethodsetData
O-OOPS/I-Inheritance/Single-Inheritance.cpp:13
↓ 1 callersMethodset_base1int
O-OOPS/I-Inheritance/Multiple-Inheritance.cpp:8
↓ 1 callersMethodset_base2int
O-OOPS/I-Inheritance/Multiple-Inheritance.cpp:19
↓ 1 callersMethodset_base3int
O-OOPS/I-Inheritance/Multiple-Inheritance.cpp:30
↓ 1 callersMethodset_marks
O-OOPS/I-Inheritance/Multilevel-Inheritance.cpp:35
← previousnext →301–400 of 805, ranked by callers