MCPcopy Create free account

hub / github.com/Lakhankumawat/LearnCPP / functions

Functions805 in github.com/Lakhankumawat/LearnCPP

↓ 1 callersMethodset_roll_number
O-OOPS/I-Inheritance/Multilevel-Inheritance.cpp:15
↓ 1 callersFunctionshellSort
S-SortingAlgorithms/ShellSort.cpp:15
↓ 1 callersFunctionshortestPath
give shortest path for which is to be find from source to destination .
G-GraphAlgorithms/MultistageGraphShortestPath.cpp:33
↓ 1 callersFunctionshortestSuperSequence
Function to find length of the shortest supersequence of X and Y.
D-DynamicProgramming/ShortestCommonSuperSequence.cpp:16
↓ 1 callersFunctionshow
Function for shwoing the linked list
P-Problem Statements & Solution/1-Level 1/two_pointer_on_doubly_linked_list.cpp:43
↓ 1 callersFunctionshow
S-Stack/SortStack.cpp:16
↓ 1 callersMethodshow
O-OOPS/B-Binding/LateBinding.cpp:8
↓ 1 callersMethodshow
O-OOPS/B-Binding/EarlyBinding.cpp:13
↓ 1 callersMethodshow
O-OOPS/I-Inheritance/Multiple-Inheritance.cpp:38
↓ 1 callersMethodshow
Miscellaneous/F-Friend/FriendClass.cpp:31
↓ 1 callersFunctionsolve
T-Tree/G-GenricTree/MirrorOfGenricTree.cpp:96
↓ 1 callersFunctionsolve
M-MathematicalAlgorithms/Factorial of large numbers/FactorialLargeNumbers.cpp:40
↓ 1 callersMethodsolveKnapsack
D-DynamicProgramming/01KnapSack.cpp:8
↓ 1 callersFunctionsolveNQ
This function solves the N Queen problem using Backtracking. It mainly uses solveNQUtil() to solve the problem. It returns false if queens
B-Backtracking/N-Queen.cpp:79
↓ 1 callersFunctionsolveNQUtil
A recursive utility function to solve N Queen problem */
B-Backtracking/N-Queen.cpp:30
↓ 1 callersFunctionsortArray
Method to sort the array using only 3 variables and single traversal Also known as Dutch National Flag Algorithm. */
A-Array/Sort_0_1_2.cpp:19
↓ 1 callersFunctionsortInWave
This function sorts arr[0..n-1] in wave form
A-Array/SortingInWaveForm.cpp:14
↓ 1 callersMethodsortedArrayToBST
sorting thr array to bst funtion
T-Tree/B-BinarySearchTree/Arraytobst.cpp:25
↓ 1 callersMethodspirallyTraverse
Function to return a list of integers denoting spiral traversal of matrix.
A-Array/SpiralTraversalMatrix.cpp:8
↓ 1 callersFunctionsquare
recursive function to calculate square of a number
R-Recursion/Types of Recursion/DirectRecursion.cpp:5
↓ 1 callersFunctionstackCount
----------------This function return the stack count--------------------------*/
S-Stack/stackADTUsingLL.cpp:80
↓ 1 callersFunctionstackTop
----------------This function retrieves stack top--------------------------*/
S-Stack/stackADTUsingLL.cpp:67
↓ 1 callersFunctionsubsetSum
subsetSum function
D-DynamicProgramming/Equal_Sum_Partition.cpp:29
↓ 1 callersMethodsum
O-OOPS/I-Inheritance/Hierarchical-Inheritance.cpp:43
↓ 1 callersMethodsum_derived
O-OOPS/I-Inheritance/Hierarchical-Inheritance.cpp:51
↓ 1 callersFunctiontakeArrayFromUser
S-SortingAlgorithms/ShellSort.cpp:42
↓ 1 callersFunctiontakeInput
function to take input for linked list and return the head pointer to the linked list
L-LinkedList/Merge K Sorted LinkedList/merge_k_ll.cpp:16
↓ 1 callersFunctiontakeinput
T-Tree/B-BinaryTree/Diameter.cpp:39
↓ 1 callersFunctiontaylorHornerRec
Taylor Series by horner rule using recursion
R-Recursion/TaylorsSerieHornersRule.cpp:5
↓ 1 callersFunctionto_print
-------------------To print solution---------------------------*/
P-Problem Statements & Solution/2-Level 2/WordWrapProblem.cpp:86
↓ 1 callersMethodtopoSort
S-SortingAlgorithms/T-TopologicalSorting/TopologicalSortDFS.cpp:21
↓ 1 callersFunctiontotalPaths
D-DynamicProgramming/UniquePaths2.cpp:7
↓ 1 callersFunctiontotalPaths
D-DynamicProgramming/UniquePaths.cpp:8
↓ 1 callersFunctiontotalWays
D-DynamicProgramming/ClimbingStairs.cpp:9
↓ 1 callersFunctiontravllingSalesmanProblem
implementation of traveling Salesman Problem
D-DynamicProgramming/TravelingSalesPerson.cpp:8
↓ 1 callersFunctiontree
T-Tree/B-BinaryTree/Height_of_Tree.cpp:23
↓ 1 callersFunctiontree
T-Tree/B-BinaryTree/No_of_leaf_nodes.cpp:31
↓ 1 callersFunctiontree
T-Tree/B-BinaryTree/InternalNodes.cpp:29
↓ 1 callersMethodunionSet
D-DisjointSetUnion/DSU.cpp:69
↓ 1 callersFunctionuniquePaths
D-DynamicProgramming/UniquePaths.cpp:26
↓ 1 callersFunctionuniquePathsWithObstacles
D-DynamicProgramming/UniquePaths2.cpp:29
↓ 1 callersFunctionupdate
the update function
T-Tree/F-FenwickTree/K_Query.cpp:23
↓ 1 callersFunctionupdateBit
B-BitManipulation/BitManipulation.cpp:24
↓ 1 callersFunctionupdateValue
The function to update a value in input array and segment tree. It uses updateValueUtil() to update the value in segment tree
A-AdvancedDataStructures/SegmentTree.cpp:61
↓ 1 callersFunctionupdateValueUtil
A recursive function to update the nodes which have the given index in their range. The following are parameters st, si, ss and se are same as g
A-AdvancedDataStructures/SegmentTree.cpp:41
↓ 1 callersFunctionvalid
function to be called
T-Tree/B-BinarySearchTree/Check Valid BST/checkValidBST.cpp:15
↓ 1 callersFunctionverticalTraversal
Function to print vertical order traversal of the binary tree with given node
T-Tree/T-TreeTraversals/verticalTraversal.cpp:67
↓ 1 callersMethodwordStartWith
T-Trie/CountPrefix.cpp:57
↓ 1 callersFunctionword_wrap
--------------------Word wrap function---------------------------*/
P-Problem Statements & Solution/2-Level 2/WordWrapProblem.cpp:30
↓ 1 callersFunctionzigzagLevelOrder
T-Tree/T-TreeTraversals/zigzag_levelorderTraversal.cpp:60
Method Stack
Initialization of stack
S-Stack/StacksWithoutSTL.cpp:23
Method isEmpty
Check stack is empty or not
S-Stack/StacksWithoutSTL.cpp:35
Method isFull
Check stack is full or not
S-Stack/StacksWithoutSTL.cpp:29
Method peek
Return value of item at top of stack
S-Stack/StacksWithoutSTL.cpp:41
Method pop
Delete item from stack
S-Stack/StacksWithoutSTL.cpp:68
Method push
Insert item into stack
S-Stack/StacksWithoutSTL.cpp:53
Method sort
S-Stack/SortStack.cpp:53
MethodA
Creating a constructor for class A
O-OOPS/diamondInheritance.cpp:19
MethodB
Creating a constructor for class B
O-OOPS/diamondInheritance.cpp:35
MethodB
Miscellaneous/F-Friend/FriendClass.cpp:25
MethodC
Creating a constructor for class C
O-OOPS/diamondInheritance.cpp:50
MethodC
Miscellaneous/F-Friend/FriendClass.cpp:35
MethodCar
O-OOPS/I-Inheritance/Hybrid-Inheritance.cpp:14
MethodD
Creating a constructor for class D
O-OOPS/diamondInheritance.cpp:65
MethodDSU
G-Graphs/M-MinimumSpanningTree/kruskalDSU.cpp:16
MethodFerrari
O-OOPS/I-Inheritance/Hybrid-Inheritance.cpp:30
MethodGraph
G-Graphs/ConnectedComponentUndirectedGraph.cpp:45
MethodGraph
G-Graphs/I-Implementation/AdjacencyList.cpp:10
MethodGraph
G-Graphs/M-MinimumSpanningTree/primsPriorityQueue.cpp:13
MethodGraph
G-Graphs/M-MinimumSpanningTree/kruskalDSU.cpp:68
MethodHamiltonian
Hamiltonian class constructor
B-Backtracking/HamiltonianCycle.cpp:45
FunctionIterativeSearch
Iterative C++ program to search an element in linked list
L-LinkedList/S-SinglyLinkedList/SearchingInALinkedList.cpp:29
MethodLRUCache
L-LinkedList/LRU Cache/LRUCache.cpp:27
MethodLinkedList
L-LinkedList/S-SinglyLinkedList/ReverseLinkedList.cpp:19
MethodListNode
L-LinkedList/S-SinglyLinkedList/RemovingDuplicates.cpp:7
MethodNode
G-GreedyAlgorithms/HuffmanCoding.cpp:12
MethodNode
L-LinkedList/S-SinglyLinkedList/ReverseLinkedList.cpp:10
MethodNode
L-LinkedList/S-SinglyLinkedList/SegregateEvenOdd.cpp:8
MethodNode
L-LinkedList/Merge K Sorted LinkedList/merge_k_ll.cpp:9
MethodNode
L-LinkedList/Clone a List with Random pointers/LinkedListClone.cpp:10
MethodNode
constructor to initialize node
P-Problem Statements & Solution/1-Level 1/two_pointer_on_doubly_linked_list.cpp:19
MethodNode
T-Tree/G-GenricTree/MirrorOfGenricTree.cpp:15
MethodNode
Constructors
T-Tree/T-TreeTraversals/zigzag_levelorderTraversal.cpp:17
MethodNode
T-Tree/T-TreeTraversals/DiagonalTraversal.cpp:21
MethodNode
T-Tree/T-TreeTraversals/verticalTraversal.cpp:22
MethodNode
T-Tree/B-BinarySearchTree/Check Valid BST/checkValidBST.cpp:8
MethodNode
T-Tree/B-BinaryTree/LargestBSTinBT.cpp:12
MethodNumberClass
O-OOPS/OperatorOverloadingBinary.cpp:6
MethodP
Miscellaneous/F-Friend/FriendFunction.cpp:11
MethodPair
T-Tree/B-BinaryTree/LargestBSTinBT.cpp:24
MethodPerson
Person constructor ---Empty one / Default one
P-PriorityQueue/PriorityQueueSTLComparator.cpp:14
MethodRacing
O-OOPS/I-Inheritance/Hybrid-Inheritance.cpp:22
MethodStack1
S-Stack/StacksUsingQueue.cpp:20
MethodStack2
S-Stack/StacksUsingQueue.cpp:73
MethodStudent
Constructor to make Students
H-HashMap/UnorderedMaps-CustomHashmaps-OperatorOverloading.cpp:14
MethodTreeNode
T-Tree/B-BinaryTree/CousinsBinaryTree.cpp:14
MethodTrie
T-Trie/CountPrefix.cpp:21
MethodUnionFind
D-DisjointSetUnion/DSU.cpp:13
Methodaddnode
L-LinkedList/LRU Cache/LRUCache.cpp:34
MethodbinaryTreeNode
T-Tree/B-BinaryTree/Diameter.cpp:23
← previousnext →401–500 of 805, ranked by callers