Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/Lakhankumawat/LearnCPP
/ functions
Functions
805 in github.com/Lakhankumawat/LearnCPP
⨍
Functions
805
◇
Types & classes
146
↓ 1 callers
Function
longest_word
S-Strings/LongestWordInSentence.cpp:14
↓ 1 callers
Function
make_list
L-LinkedList/S-SinglyLinkedList/RemovingDuplicates.cpp:12
↓ 1 callers
Function
make_sieve
M-MathematicalAlgorithms/S-SegmentedSieve/SegmentedSieve.cpp:4
↓ 1 callers
Function
maxProfit
function to calculate max profit
D-DynamicProgramming/KnapsackwithDuplicateItems.cpp:8
↓ 1 callers
Function
maxProfit
A-Array/Stock Buy And Sell.cpp:8
↓ 1 callers
Function
maxSubArraySum1
Brute force Approach
A-Array/MaximumSumSubarray.cpp:7
↓ 1 callers
Function
maxSubArraySum2
Cumulative Sum Approach
A-Array/MaximumSumSubarray.cpp:28
↓ 1 callers
Function
maxSubArraySum3
kadene's algorithm
A-Array/MaximumSumSubarray.cpp:54
↓ 1 callers
Function
max_of_size_k
P-Problem Statements & Solution/1-Level 1/max_of_size_k_window.cpp:13
↓ 1 callers
Function
maximizingTheExpression
Function to return the value of the maximized expression
B-BitManipulation/MaximizeExpression.cpp:7
↓ 1 callers
Function
merge
L-LinkedList/Merge K Sorted LinkedList/merge_k_ll.cpp:42
↓ 1 callers
Function
merge
function to merge two sorted arrays
D-DivideAndConquerAlgorithms/MergeSort.cpp:7
↓ 1 callers
Function
merge_k_ll
L-LinkedList/Merge K Sorted LinkedList/merge_k_ll.cpp:54
↓ 1 callers
Function
mergesort
D-DivideAndConquerAlgorithms/MergeSort.cpp:59
↓ 1 callers
Function
middle
Function will find the middle element of the linked list
L-LinkedList/S-SinglyLinkedList/middleElementOfLinkedList.cpp:29
↓ 1 callers
Function
minCoins
D-DynamicProgramming/CoinChange.cpp:6
↓ 1 callers
Function
minCost
D-DynamicProgramming/MinCostClimbingStairs.cpp:10
↓ 1 callers
Function
minCostClimbingStairs
D-DynamicProgramming/MinCostClimbingStairs.cpp:26
↓ 1 callers
Function
minFallingPathSum
D-DynamicProgramming/MinimumFallingPathSum.cpp:25
↓ 1 callers
Function
minSum
D-DynamicProgramming/MinimumFallingPathSum.cpp:7
↓ 1 callers
Function
minValueNode
function to get minimum key value node
T-Tree/B-BinarySearchTree/AVL.cpp:130
↓ 1 callers
Function
min_computation
Calculating minimum computations to merge file optimally
G-GreedyAlgorithms/OptimalMergePattern.cpp:7
↓ 1 callers
Function
mirrorTransform
T-Tree/G-GenricTree/MirrorOfGenricTree.cpp:79
↓ 1 callers
Function
multiply
G-Graphs/I-Implementation/PathMatrix.cpp:89
↓ 1 callers
Function
myPow
D-DivideAndConquerAlgorithms/Pow.cpp:22
↓ 1 callers
Function
newNode
T-Tree/G-GenricTree/LevelOrderTraversalOfaGenricTree.cpp:12
↓ 1 callers
Function
newNode
A utility function to create a node
T-Tree/B-BinarySearchTree/ConstructBSTFromPreoderTraversal.cpp:18
↓ 1 callers
Function
newNode
function that allocates a new node
T-Tree/B-BinarySearchTree/AVL.cpp:31
↓ 1 callers
Function
oddevenchecker
L-LinkedList/S-SinglyLinkedList/SegregateEvenOdd.cpp:28
↓ 1 callers
Function
partition
S-SortingAlgorithms/QuickSort.cpp:26
↓ 1 callers
Function
pop
Printing the element from top of the stack
S-Stack/DecimalToBinary.cpp:30
↓ 1 callers
Function
popStack
----------------This function pops the data from the stack-----------------*/
S-Stack/stackADTUsingLL.cpp:45
↓ 1 callers
Function
pop_1
------------This function pops the element from the stack 1----------------------------------*/
S-Stack/twoStackArray.cpp:40
↓ 1 callers
Function
pop_2
-------------This function pops the element from the stack 2---------------------------------*/
S-Stack/twoStackArray.cpp:53
↓ 1 callers
Function
postOrderTraversal
---------------------Main Function--------------------------/// postOrder Traversal of Binary Tree
T-Tree/T-TreeTraversals/postorderTraversal.cpp:25
↓ 1 callers
Function
postorder
----------------------A function for postorder traversal of the tree-------------------*/
T-Tree/T-TreeTraversals/expressionTreeTraversal.cpp:79
↓ 1 callers
Function
power_matrix
compute pth power of matrix and store
G-Graphs/I-Implementation/PathMatrix.cpp:72
↓ 1 callers
Function
poweroftwo
R-Recursion/PowerOfTwo.cpp:7
↓ 1 callers
Function
powerthree
R-Recursion/PowerOfThree.cpp:7
↓ 1 callers
Function
preOrderTraversal
---------------------Main Function--------------------------/// preOrder Traversal of Binary Tree
T-Tree/T-TreeTraversals/preorderTraversal.cpp:25
↓ 1 callers
Function
preorder
-------------------A function for preorder traversal pf the tree----------------------*/
T-Tree/T-TreeTraversals/expressionTreeTraversal.cpp:90
↓ 1 callers
Function
primeSumDivision
M-MathematicalAlgorithms/primeSum.cpp:23
↓ 1 callers
Method
prims
G-Graphs/M-MinimumSpanningTree/primsPriorityQueue.cpp:23
↓ 1 callers
Function
print
print function
S-SortingAlgorithms/CountingSort.cpp:39
↓ 1 callers
Function
print
Print function print all the linklist elements
L-LinkedList/S-SinglyLinkedList/SegregateEvenOdd.cpp:45
↓ 1 callers
Function
print
function to print linked list
L-LinkedList/Merge K Sorted LinkedList/merge_k_ll.cpp:34
↓ 1 callers
Function
print
Utility function to print elements of an array
A-Array/Reversingofarray.cpp:6
↓ 1 callers
Function
print
A utility function to print an array
S-SearchingAlgorithms/RadixSort.cpp:59
↓ 1 callers
Method
printAdj
G-GraphAlgorithms/S-SingleSourceShortestPath/DijsktraSSSp.cpp:23
↓ 1 callers
Function
printArray
A utility function to print array of size n */
H-Heap/MaxHeap.cpp:65
↓ 1 callers
Function
printArray
H-Heap/MinHeap.cpp:5
↓ 1 callers
Function
printAugmentedPaths
G-Graphs/N-NetworkFlow/fordFulkerson.cpp:60
↓ 1 callers
Function
printCurrentLevel
Print nodes at a current level */
T-Tree/T-TreeTraversals/levelorderTraversal.cpp:31
↓ 1 callers
Function
printDiagonal
Perform preorder traversal on the tree & fill the map with diagonal elements
T-Tree/T-TreeTraversals/DiagonalTraversal.cpp:29
↓ 1 callers
Function
printFirstNegativeInteger
A-Array/FirstNegativeInEveryWindow.cpp:3
↓ 1 callers
Method
printGraph
G-Graphs/I-Implementation/AdjListUsingHashmap.cpp:20
↓ 1 callers
Function
printHeap
A utility function to print the array representation of Heap
H-Heap/Heapify.cpp:46
↓ 1 callers
Function
printInorder
A utility function to print inorder traversal of a Binary Tree
T-Tree/B-BinarySearchTree/ConstructBSTFromPreoderTraversal.cpp:84
↓ 1 callers
Function
printJugglerWithLoop
This function prints the juggler Sequence using loop
M-MathematicalAlgorithms/JugglerSequence/JugglerSequence.cpp:5
↓ 1 callers
Function
printJugglerWithRec
This function prints the juggler Sequence using recursion
M-MathematicalAlgorithms/JugglerSequence/JugglerSequence.cpp:33
↓ 1 callers
Function
printKnightsTour
B-Backtracking/TheKnight’stourproblem.cpp:17
↓ 1 callers
Function
printKthDistinct
Function for printing the Kth distinct character using sets
S-Sets/FindKthDistinctCharacterGivenString.cpp:8
↓ 1 callers
Function
printLevelOrder
Function to print level order traversal a tree*/
T-Tree/T-TreeTraversals/levelorderTraversal.cpp:22
↓ 1 callers
Function
printMST
G-Graphs/M-MinimumSpanningTree/Prims.cpp:15
↓ 1 callers
Function
printMinDelAndInsert
Function to print the output and find the Total number of insertions and total number of deletions
D-DynamicProgramming/MinimumInsertionDeletion.cpp:32
↓ 1 callers
Function
printNGE
prints element and NGE pair for all elements of arr[] of size n */
S-Stack/NextGreaterElement/nge.cpp:8
↓ 1 callers
Function
printRightView
T-Tree/T-TreeTraversals/RightSideViewOfBT.cpp:30
↓ 1 callers
Function
printSolution
A utility function to print solution */
B-Backtracking/N-Queen.cpp:19
↓ 1 callers
Function
printTargetSumSubsets
function to print subset sum
B-Backtracking/SubsetSum.cpp:10
↓ 1 callers
Function
printTwoElements
Finding missing and repeating element
A-Array/MissingAndRepeatingNumber.cpp:6
↓ 1 callers
Method
print_graph
G-Graphs/I-Implementation/AdjacencyList.cpp:22
↓ 1 callers
Function
print_list
L-LinkedList/S-SinglyLinkedList/RemovingDuplicates.cpp:23
↓ 1 callers
Function
print_primes
M-MathematicalAlgorithms/S-SegmentedSieve/SegmentedSieve.cpp:32
↓ 1 callers
Method
process
O-OOPS/I-Inheritance/Single-Inheritance.cpp:37
↓ 1 callers
Method
product
O-OOPS/I-Inheritance/Hierarchical-Inheritance.cpp:27
↓ 1 callers
Method
product_derived
O-OOPS/I-Inheritance/Hierarchical-Inheritance.cpp:59
↓ 1 callers
Function
push
UTILITY FUNCTIONS */ Function to insert a node at the beginning of the Doubly Linked List */
L-LinkedList/D-DoublyLinkedList/Reverse.cpp:42
↓ 1 callers
Function
push
Pusing the elements into the stack
S-Stack/DecimalToBinary.cpp:41
↓ 1 callers
Function
pushStack
----------------This function pushes the data into the node--------------------------*/
S-Stack/stackADTUsingLL.cpp:28
↓ 1 callers
Function
push_1
----------------This function is used to push elements into stack 1--------------------------*/
S-Stack/twoStackArray.cpp:16
↓ 1 callers
Function
push_2
------------This function is used to push elements in stack 2-------------------------------*/
S-Stack/twoStackArray.cpp:28
↓ 1 callers
Function
radixsort
The main function to that sorts arr[] of size n using Radix Sort
S-SearchingAlgorithms/RadixSort.cpp:46
↓ 1 callers
Function
ratInMaze
B-Backtracking/RatInMaze.cpp:7
↓ 1 callers
Function
rec_num
declaring function earlier so that it will not give error.
R-Recursion/Types of Recursion/LinearRecursion.cpp:4
↓ 1 callers
Function
reverse
Function to reverse a Doubly Linked List */
L-LinkedList/D-DoublyLinkedList/Reverse.cpp:16
↓ 1 callers
Function
reverse
function to reverse a string
S-Strings/StringReverse.cpp:8
↓ 1 callers
Function
reverse1
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 callers
Function
reverse2
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 callers
Function
reverseQueueWithRecursion
Reverse a queue using Recursion
Q-Queue/ReverseQueue.cpp:32
↓ 1 callers
Function
reverseQueueWithoutRecursion
Reverse a Queue without using Recursion
Q-Queue/ReverseQueue.cpp:6
↓ 1 callers
Function
reverseStr
D-DynamicProgramming/Minimum_insertions_form_palindrome.cpp:35
↓ 1 callers
Function
romanDec
function to convert roman number to integer
S-Strings/RomanDec.cpp:9
↓ 1 callers
Function
search
H-HashTable/HashCustomers.cpp:52
↓ 1 callers
Function
search
T-Tree/B-BinarySearchTree/AVL.cpp:228
↓ 1 callers
Function
setBit
B-BitManipulation/BitManipulation.cpp:13
↓ 1 callers
Method
setData
O-OOPS/I-Inheritance/Single-Inheritance.cpp:13
↓ 1 callers
Method
set_base1int
O-OOPS/I-Inheritance/Multiple-Inheritance.cpp:8
↓ 1 callers
Method
set_base2int
O-OOPS/I-Inheritance/Multiple-Inheritance.cpp:19
↓ 1 callers
Method
set_base3int
O-OOPS/I-Inheritance/Multiple-Inheritance.cpp:30
↓ 1 callers
Method
set_marks
O-OOPS/I-Inheritance/Multilevel-Inheritance.cpp:35
← previous
next →
301–400 of 805, ranked by callers