MCPcopy Create free account

hub / github.com/Ayush7614/Daily-Coding-DS-ALGO-Practice / functions

Functions2,762 in github.com/Ayush7614/Daily-Coding-DS-ALGO-Practice

⨍ Functions 2,762◇ Types & classes 612
↓ 1 callersFunctionpathSum
Leetcode/C++/Path Sum III.cpp:37
↓ 1 callersFunctionpeakIndexInMountainArray
Leetcode/C++/peakIndexinAMountainArray.cpp:30
↓ 1 callersFunctionpearson
Hackerank/C++/Pearson Correlation Coefficient.cpp:8
↓ 1 callersFunctionpeek
(s)
Data Structures/Tree/postorder_traversal.py:15
↓ 1 callersFunctionpeek
Data Structures/Stack/C++/Stack-implementation_using_array.cpp:51
↓ 1 callersMethodperformDivision
(String temp, int s)
Gfg/Main.java:36
↓ 1 callersMethodpermutation
(char[] charArr, int start, int size)
Algorithms/Backtracking/Print_all_permutations_of_a_String.java:16
↓ 1 callersFunctionpermutationCoeff
Returns value of Permutation Coefficient P(n, k)
Gfg/C/Permutation Coefficient.c:9
↓ 1 callersFunctionpermute
Function to print permutations of string This function takes three parameters: 1. String 2. Starting index of the string 3. Ending index of the string
Algorithms/Backtracking/C++/print all permutations of a given string.cpp:12
↓ 1 callersFunctionpermute
variable defined to store the maximum value of happiness function defined to get all the permutation of starting string
Codeforces/C++/Shower_Line.cpp:34
↓ 1 callersFunctionplacer
Algorithms/Miscellaneous/C++/RatInMaze.cpp:44
↓ 1 callersFunctionplusMinus
Hackerank/C++/Plus-Minus.cpp:49
↓ 1 callersFunctionpop
Hackerank/C/Maximum Element.c:24
↓ 1 callersFunctionpop
Data Structures/Stack/C++/Stack-implementation_using_array.cpp:23
↓ 1 callersFunctionpop
Data Structures/Stack/C/array implementation of stack.c:71
↓ 1 callersMethodpop
()
Data Structures/Stack/Java/StackArray.java:29
↓ 1 callersFunctionpop_ll
Data Structures/Stack/C++/Reverse_ll_using_Stack.cpp:55
↓ 1 callersFunctionpossibleWays
Gfg/C++/Coin Change.cpp:5
↓ 1 callersFunctionpostOrder
Gfg/C++/postorder_traversal_of_binary_tree_iterative_approach.cpp:55
↓ 1 callersMethodpostOrder
Data Structures/Tree/Tree_Traversal.cpp:151
↓ 1 callersMethodpostOrder
(Node node)
Data Structures/Tree/Java/AVL_Tree.java:45
↓ 1 callersFunctionpostOrderTraversal
(root)
Data Structures/Tree/postorder_traversal.py:23
↓ 1 callersMethodpostorder
Post-Order traversal Left Subtree -> Right Subtree -> Node
Data Structures/Tree/C++/Red Black Tree (Insertion and Deletion operation).cpp:293
↓ 1 callersFunctionpower
Algorithms/Miscellaneous/C++/Recursive Modular Exponentiation.cpp:8
↓ 1 callersFunctionpower
Codechef/C++/XOR Equality (XOREQUAL).cpp:6
↓ 1 callersMethodpowerOf2
(int n)
Gfg/Java/Lucky_Person_Alive.java:91
↓ 1 callersFunctionpowerofTwo
(n)
Algorithms/Miscellaneous/Python/Setbitposition.py:18
↓ 1 callersFunctionpreOrder
Pre-Order Traverse
Data Structures/LinkedList/C++/Sorted_LinkedList_to_BST.cpp:32
↓ 1 callersFunctionpreOrder
A utility function to print preorder traversal of BST */
Gfg/C++/Convert sorted Array to BST.cpp:84
↓ 1 callersMethodpreOrder
Data Structures/Tree/Tree_Traversal.cpp:109
↓ 1 callersMethodpreOrder
(Node node)
Data Structures/Tree/Java/AVL_Tree.java:36
↓ 1 callersFunctionprefix_to_infix
Function to convert prefix to Infix expression
Data Structures/Stack/C++/prefix_infix.cpp:17
↓ 1 callersFunctionprefixtoinfix
(prefix)
Data Structures/Stack/Python/Prefixtoinfix.py:1
↓ 1 callersFunctionpreorder
Function to perform preorder traversal on a given binary tree
Leetcode/C++/Invert binary tree.cpp:30
↓ 1 callersFunctionpreorder
Function to perform preorder traversal on a given binary tree
Gfg/C++/Mirror tree.cpp:23
↓ 1 callersMethodpreorder
Pre-Order traversal Node->Left Subtree->Right Subtree
Data Structures/Tree/C++/Red Black Tree (Insertion and Deletion operation).cpp:279
↓ 1 callersFunctionpreorder_traversal
Data Structures/Tree/C++/Binary_Search_Tree.cpp:145
↓ 1 callersFunctionpreprocess
Atcoder dp/N - Slimes.cpp:33
↓ 1 callersFunctionprint
print function
Data Structures/LinkedList/C++/LinkedList.cpp:9
↓ 1 callersMethodprint2D
(int mat[][])
Leetcode/Java/SetZeroes.java:48
↓ 1 callersMethodprintArr
(int dist[], int V)
Gfg/Java/Bellman_Ford.java:59
↓ 1 callersFunctionprintArray
A utility function to print elements of array
Algorithms/Miscellaneous/C/stockspanprob.c:22
↓ 1 callersFunctionprintArray
A utility function to print an array of size n
Algorithms/Searching and Sorting/C++/Insertion Sort.cpp:27
↓ 1 callersFunctionprintArray
Function to print an array */
Algorithms/Searching and Sorting/C++/Quick Sort.cpp:56
↓ 1 callersFunctionprintArray
Function to print an array */
Algorithms/Searching and Sorting/C++/Selection Sort.cpp:31
↓ 1 callersFunctionprintArray
Print an array
Algorithms/Searching and Sorting/C++/Radix_Sort.cpp:53
↓ 1 callersFunctionprintArray
(arr,size)
Gfg/Python/RotateArray.py:23
↓ 1 callersFunctionprintArray
( a)
Gfg/Python/Sort012.py:18
↓ 1 callersFunctionprintArray
Gfg/C++/Merge k Sorted Arrays.cpp:23
↓ 1 callersFunctionprintArray
A utility function to print array of size n */
Gfg/C++/implementation of Heap Sort.cpp:49
↓ 1 callersMethodprintArray
(int arr[], int arr_size)
Algorithms/Searching and Sorting/sort012.java:35
↓ 1 callersMethodprintArray
(int arr[], int n)
Gfg/negitivenumber.java:22
↓ 1 callersMethodprintCurrentLevel
(TreeNode root ,int level)
Leetcode/Java/BinaryTreeFromPreorderAndInorder.java:87
↓ 1 callersMethodprintDimaSeraja
(int[] arr)
Codeforces/Java/DimaSerejaProblem.java:32
↓ 1 callersFunctionprintFirstNegativeInteger
Function to return solution
Gfg/C++/First negative integer in every window of size k .cpp:37
↓ 1 callersMethodprintGantChart
Operating System/CPU Scheduler/Round Robin.cpp:70
↓ 1 callersFunctionprintHuffCodes
Gfg/C++/Huffman Encoding.cpp:23
↓ 1 callersFunctionprintIntersection
Data Structures/union_and_intersection.cpp:59
↓ 1 callersFunctionprintIntersection
Data Structures/Array/C++/intersection of two sorted arrays.cpp:5
↓ 1 callersFunctionprintJobScheduling
(arr, t)
Algorithms/Greedy Algorithms/Job Sequencing Problem.py:1
↓ 1 callersFunctionprintJobScheduling
Returns minimum number of platforms reqquired
Algorithms/Greedy Algorithms/C++/Job Sequencing Problem.cpp:22
↓ 1 callersFunctionprintKMax
Method to find the maximum for each and every contiguous subarray of size k.
Gfg/C++/Maximum of all subarrays of size k.cpp:8
↓ 1 callersMethodprintLevelOrder
(TreeNode root)
Leetcode/Java/BinaryTreeFromPreorderAndInorder.java:58
↓ 1 callersFunctionprintList
(node)
Data Structures/Merge k sorted linkedlist.py:17
↓ 1 callersFunctionprintList
Function to print LinkedList data It takes one argument head the starting node It traverse till the node is not equal to null and prints the data insi
Data Structures/LinkedList/C++/Reverse_LinkedList_in_a_group_of_given_size.cpp:72
↓ 1 callersFunctionprintList
Function to printList
Data Structures/LinkedList/C++/Reorder_list.cpp:28
↓ 1 callersFunctionprintList
A utility function to print a given linked list
Data Structures/LinkedList/C++/Pallindrome_Linked_List.cpp:153
↓ 1 callersFunctionprintList
Data Structures/LinkedList/C++/reverse_LL.cpp:31
↓ 1 callersFunctionprintList
function to print the current linked list data
Data Structures/LinkedList/C++/Reverse_a_sublist_of_a_list.cpp:64
↓ 1 callersFunctionprintList
Gfg/RotateALinkedList.cpp:46
↓ 1 callersFunctionprintList
Function to print linked list */
Gfg/C++/reverse_link_list_grup.cpp:31
↓ 1 callersFunctionprintList
Gfg/C++/Add two numbers represented by linked lists.cpp:45
↓ 1 callersFunctionprintList
Gfg/C++/Flatten_a_linked_list.cpp:27
↓ 1 callersFunctionprintList
{ Driver Code Starts. Function to print nodes in a given linked list */
Gfg/C++/merge_k_sorted_linked_lists.cpp:82
↓ 1 callersFunctionprintList
Function to print linked list */
Gfg/C++/Delete_without_head_pointer.cpp:54
↓ 1 callersMethodprintList
()
Leetcode/Java/Swap Nodes in Pairs.java:69
↓ 1 callersMethodprintList
(self)
Gfg/Python/merge_two_sorted_linkedlists.py:18
↓ 1 callersMethodprintList
(Node head)
Gfg/Java/Merge_two_sorted_LL.java:48
↓ 1 callersMethodprintList
(Node node)
Gfg/Java/Add-1-to-a-number-represented-as-linked-list.java:29
↓ 1 callersFunctionprintMajority
(A)
Data Structures/MajorityElement.py:29
↓ 1 callersFunctionprintMatrix
Function for print matrix
Gfg/C++/rotate matrix.cpp:27
↓ 1 callersMethodprintMatrix
(int arr[][])
Gfg/Java/rotate matrix.java:31
↓ 1 callersMethodprintMaxActivities
(int s[], int f[], int n)
Algorithms/Greedy Algorithms/Java/Activity Selection Problem.java:14
↓ 1 callersMethodprintNQueens
(int[][] chess, String qsf, int row)
Algorithms/Backtracking/Java/NQueens.java:32
↓ 1 callersMethodprintNodes
()
Algorithms/LinkedList/doublyll.java:42
↓ 1 callersFunctionprintParenthesis
(str, n)
Gfg/Python/Generate_Balanced_parenthesis.py:30
↓ 1 callersFunctionprintPascal
C program for Pascal’s Triangle A O(n^2) time and O(n^2) extra space method for Pascal's Triangle
Algorithms/Miscellaneous/C/pascaltriangle.c:4
↓ 1 callersMethodprintPascal
(int n)
Gfg/Java/PascalsTriangle.java:19
↓ 1 callersFunctionprintPath
Gfg/C++/Rat in a Maze Problem.cpp:58
↓ 1 callersFunctionprintPattern
Defination Of printPattern Function:
Hackerank/C/concentric square pattern.c:8
↓ 1 callersFunctionprintSolution
A utility function to print the constructed distance array
Algorithms/Greedy Algorithms/C++/Dijkstra’s shortest path algorithm.cpp:25
↓ 1 callersFunctionprintSolution
( sol )
Algorithms/Backtracking/Python/ratInMaze.py:8
↓ 1 callersFunctionprintSolution
(dist)
Algorithms/Dynamic Problems/Python/FlodyWarshall.py:36
↓ 1 callersFunctionprintSolution
(dist)
Algorithms/Dynamic Problems/Python/FloydWarshall.py:12
↓ 1 callersFunctionprintSolution
Algorithms/Dynamic Problems/C++/FloydWarshall.cpp:31
↓ 1 callersFunctionprintSolution
A utility function to print the constructed distance array
Gfg/C++/dijkstras algo.cpp:25
↓ 1 callersMethodprintSolution
(int dist[][])
Algorithms/Dynamic Problems/Java/FloydWarshall.java:34
↓ 1 callersMethodprintSpiral
(int[][] arr)
Gfg/Java/SpiralDisplay.java:28
↓ 1 callersFunctionprintUnion
Data Structures/union_and_intersection.cpp:22
↓ 1 callersFunctionprintUnion
Data Structures/Array/C++/union of two sorted arrays.cpp:5
← previousnext →1,101–1,200 of 2,762, ranked by callers