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

↓ 1 callersFunctionfindLargestSubtreeSum
(root)
Gfg/Python/max_subtree_sum.py:54
↓ 1 callersFunctionfindLargestSubtreeSum
Function to find largest subtree sum.
Gfg/C++/Largest Subtree Sum In a Tree.cpp:45
↓ 1 callersFunctionfindLargestSubtreeSumUtil
(root, ans)
Gfg/Python/max_subtree_sum.py:13
↓ 1 callersFunctionfindLargestSubtreeSumUtil
Helper function to find largest subtree sum recursively.
Gfg/C++/Largest Subtree Sum In a Tree.cpp:23
↓ 1 callersMethodfindLength
(int[] A, int[] B)
Leetcode/Java/Maximum Length of Repeated Subarray.java:6
↓ 1 callersMethodfindMajority
(int arr[], int n)
Codeforces/Java/MajorityElement.java:5
↓ 1 callersFunctionfindMax
Algorithms/Searching and Sorting/C++/Count Sort.cpp:6
↓ 1 callersMethodfindMaximum
Gfg/C++/Bitonic_Point.cpp:19
↓ 1 callersFunctionfindMaximumXOR
Data Structures/Max_XOR_of_Two_Array.cpp:61
↓ 1 callersMethodfindMedian
(int arr[], int n, int brr[], int m)
Gfg/MedianOfTwoSortedArrayJava.java:40
↓ 1 callersMethodfindMedianSortedArrays
(int[] input1, int[] input2)
Leetcode/Median of Two Sorted Arrays.java:23
↓ 1 callersFunctionfindMiddle
Function for finding middle of the stack
Gfg/C++/middle element of stack.cpp:104
↓ 1 callersFunctionfindMin
Algorithms/Greedy Algorithms/C++/Greedy_algorithm_to_find_minimum_number_of_coins.cpp:11
↓ 1 callersFunctionfindMin
Leetcode/C++/FindMinimunInRotatedSearchArray_Leetcode.cpp:5
↓ 1 callersMethodfindMin
(int start, int a[])
codejam/Java/ReverSort.java:19
↓ 1 callersFunctionfindMinCoins
Data Structures/Indiancoinchange.c:4
↓ 1 callersFunctionfindMinDiff
Gfg/C++/Chocolate Distribution Problem.cpp:22
↓ 1 callersMethodfindMinimum
()
Data Structures/Stack/Java/Min_Element_In_Stack.java:27
↓ 1 callersFunctionfindMissing
(a, n)
Leetcode/Python/Smallest_positive_missingno.py:4
↓ 1 callersMethodfindMissingPositive
(int array[], int len)
Leetcode/Java/First_missing_positive_num.java:18
↓ 1 callersFunctionfindNext
Given a number as a char array number[], this function finds the next greater number. It modifies the same array to store the result
Leetcode/C++/next_permutations.cpp:17
↓ 1 callersFunctionfindNode
Gfg/C++/Delete_without_head_pointer.cpp:16
↓ 1 callersMethodfindPages
(int[]arr,int n,int m)
Gfg/Java/AllocateMinimumNumberOfPages.java:69
↓ 1 callersFunctionfindPair
Naive method to find a pair in an array with a given sum
Data Structures/Array/C/find-pair-with-given-sum-array.c:4
↓ 1 callersFunctionfindPosition
(n)
Algorithms/Miscellaneous/Python/Setbitposition.py:10
↓ 1 callersFunctionfindRange
(arr, n)
Gfg/Python/range_of_array.py:18
↓ 1 callersFunctionfindRank
Codechef/C++/BugCrush 2 Question 6 (BUGC206).cpp:20
↓ 1 callersFunctionfindSkyline
Leetcode/C++/SkyLine.cpp:69
↓ 1 callersFunctionfindSmallerInRight
Codechef/C++/BugCrush 2 Question 6 (BUGC206).cpp:9
↓ 1 callersFunctionfindTheLongestSubstring
Leetcode/C++/Find the longest substring containing vowels at even positions.cpp:16
↓ 1 callersFunctionfind_Small_Large
(array)
Data Structures/Array/Python/searching largest and smallest in array.py:1
↓ 1 callersFunctionfind_peak
function which return index of peak element */
Gfg/C++/peak_element.cpp:13
↓ 1 callersFunctionfind_two
Codechef/C++/Hail_XOR.cpp:8
↓ 1 callersFunctionfind_union
function to find the union of the lengths.
Algorithms/Miscellaneous/C++/Klee's Algorithm.cpp:22
↓ 1 callersMethodfindkThLargestElement
(int[] arr, int n, int k)
Miscellaneous problems/Java/kth_largest_number/kThLargestElement.java:18
↓ 1 callersFunctionfirst
(a, low, high, x, n)
Gfg/Python/Count occurrences of an element in a sorted array.py:34
↓ 1 callersFunctionfirstIndex
(arr, x)
Gfg/Firstindex.py:1
↓ 1 callersFunctionfirstIndex
Function to find first index.
Gfg/C++/first_index_of_array.cpp:5
↓ 1 callersFunctionfirstMissingPositive
Leetcode/C++/First Missing Positive.cpp:5
↓ 1 callersFunctionfirst_Missing_Positive_num
Leetcode/C/First Missing Positive.c:10
↓ 1 callersFunctionfirst_index
Gfg/C/firstindex.c:11
↓ 1 callersMethodfirst_index
(int[] a,int i,int s,int y)
Gfg/First_index.java:5
↓ 1 callersFunctionfirst_occurrence
Gfg/C++/count_occurrences_of_element.cpp:9
↓ 1 callersMethodflatlandSpaceStations
(int n, int[] c)
Hackerank/Java/Flatland Space stations.java:12
↓ 1 callersFunctionflatten
Function which returns the root of the flattened linked list. */
Gfg/C++/Flatten_a_linked_list.cpp:103
↓ 1 callersMethodfloodFill
Leetcode/C++/flood_Fill.cpp:35
↓ 1 callersFunctionfloydWarshall
(graph)
Algorithms/Dynamic Problems/Python/FloydWarshall.py:4
↓ 1 callersFunctionfloydWarshall
Algorithms/Dynamic Problems/C++/FloydWarshall.cpp:10
↓ 1 callersMethodfloydWarshall
(int graph[][])
Algorithms/Dynamic Problems/Java/FloydWarshall.java:13
↓ 1 callersFunctionfnx
Codechef/C++/mod-equality.cpp:104
↓ 1 callersMethodfractionalKnapsack
Algorithms/Greedy Algorithms/C++/Fractional_Knapsack_in_C++.cpp:62
↓ 1 callersFunctionfreeList
Function to freeList
Data Structures/LinkedList/C++/Reorder_list.cpp:36
↓ 1 callersFunctionfree_doubly_linked_list
Hackerank/C++/Reverse a Doubly Linked List.cpp:55
↓ 1 callersFunctionfree_singly_linked_list
Hackerank/C/Delete-Duplicate-Value-Node-From-Sorted-LinkedList.c:71
↓ 1 callersFunctionfront
Function to get front of queue
Gfg/C++/implementation Of Queue.cpp:69
↓ 1 callersMethodfunc
(int[] arr, int n, int d, int h)
Codechef/Java/RedAlert.java:21
↓ 1 callersFunctionfunnyString
Please either make the string static or allocate on the heap. For example, static char str[] = "hello world"; return str; OR char* str = "hello worl
Hackerank/C/Funny String.c:24
↓ 1 callersFunctiongcd
Codechef/C++/BugCrush 2 Question 3 (BUGC203).cpp:3
↓ 1 callersFunctiongeek_num
let us call the function to find geek number in this loop
Gfg/C++/Geek_onacci.cpp:11
↓ 1 callersMethodgetDegree
(int a[], int x, int y)
Algorithms/Miscellaneous/Java/WarnsdorffAlgorithm.java:25
↓ 1 callersFunctiongetMax
Function to get the largest element from an array
Algorithms/Searching and Sorting/C++/Radix_Sort.cpp:7
↓ 1 callersFunctiongetMax
(arr, n)
Gfg/Python/range_of_array.py:10
↓ 1 callersFunctiongetMaxGold
Returns maximum amount of gold that can be collected when journey started from first column and moves allowed are right, right-up and right-down
Algorithms/Dynamic Problems/C++/Gold Mine Problem.cpp:10
↓ 1 callersMethodgetMaxValue
(int[] wt, int[] val, int capacity)
Algorithms/Greedy Algorithms/Java/Fractional Knapsack Problem.java:8
↓ 1 callersMethodgetMaximumSum
(int []arr)
Gfg/Java/MaximizeSum.java:33
↓ 1 callersMethodgetMazepaths
(int sr, int sc, int dr, int dc)
Gfg/Java/Get_Maxinmum_Maze_Paths.java:26
↓ 1 callersFunctiongetMin
(arr, n)
Gfg/Python/range_of_array.py:3
↓ 1 callersFunctiongetMinDiff
Gfg/C++/minimize_the_heights.cpp:13
↓ 1 callersMethodgetNthFromLast
(Node head, int n)
Gfg/Java/Find_Nth_Node_From_End_of_LL.java:123
↓ 1 callersFunctiongetNthUglyNo
Function to get the nth ugly number
Algorithms/Dynamic Problems/C++/Ugly Number.cpp:30
↓ 1 callersFunctiongetRow
Leetcode/C++/pascal_triangle.cpp:9
↓ 1 callersMethodgetRow
Leetcode/C++/Pascal's_Triangle_II.cpp:35
↓ 1 callersMethodgetSize
Data Structures/QueueUsingLL.cpp:65
↓ 1 callersMethodgetSkyline
(int[][] buildings)
Leetcode/Java/SkyLine.java:6
↓ 1 callersFunctiongetSquareSum
(n)
Hackerank/Python/LuckyNumber.py:26
↓ 1 callersMethodgetSum
(TreeNode grandParent, TreeNode parent)
Leetcode/Java/SumOfNodesWithEvenValuedGrandparent.java:24
↓ 1 callersFunctiongetSumUtil
Codeforces/C++/Kuriyama_Mirai's_Stones.pp.cpp:18
↓ 1 callersMethodget_array
Operating System/CPU Scheduler/Round Robin.cpp:107
↓ 1 callersFunctionget_connected_components
this get_connected_components will count the number of connected components
Algorithms/Graph/C/connected_components.c:31
↓ 1 callersMethodget_firstelement
Data Structures/Tree/C++/Binary_tree_traversal.cpp:48
↓ 1 callersMethodgetmiddle
(Node head)
Algorithms/LinkedList/singlyll.java:117
↓ 1 callersMethodgetmiddle
(Node head)
Algorithms/LinkedList/linkedlist.java:120
↓ 1 callersFunctiongetsumUTil
-------------------------------------------------------------------------------------------------getsum------------------ A recursive function to get
Data Structures/Tree/C++/segment_tree_implementation.cpp:94
↓ 1 callersMethodgive_root
Data Structures/Tree/Tree_Traversal.cpp:40
↓ 1 callersFunctiongradingStudents
Hackerank/C++/Grading Students.cpp:47
↓ 1 callersFunctiongraphColoring
Gfg/C++/M-Coloring Problem.cpp:32
↓ 1 callersFunctiongroupAnagrams
Function to group Anagrams
Leetcode/C++/Group_Anagrams.cpp:11
↓ 1 callersMethodhammingDistance
(int x, int y)
Leetcode/Java/Hamming.java:4
↓ 1 callersMethodhandShake
Gfg/C++/Handshakes.cpp:36
↓ 1 callersFunctionheapSort
main function to do heap sort
Gfg/C++/implementation of Heap Sort.cpp:32
↓ 1 callersFunctionheight
this function calculate the height of the Binary Tree
Data Structures/Tree/C++/Binary_Tree_Symmetric_or_not.cpp:27
↓ 1 callersFunctionheight
Gfg/C++/normal_BST_to_Balanced_BST.cpp:95
↓ 1 callersMethodheight
(TreeNode root)
Leetcode/Java/BinaryTreeFromPreorderAndInorder.java:69
↓ 1 callersMethodheight
Data Structures/Tree/Tree_Traversal.cpp:207
↓ 1 callersFunctionheight_bst
Data Structures/Tree/C++/Binary_Search_Tree.cpp:296
↓ 1 callersFunctionhelp
helper function
Gfg/C++/Duplicate subtree in Binary Tree.cpp:29
↓ 1 callersFunctionhelper
Gfg/C++/normal_BST_to_Balanced_BST.cpp:42
↓ 1 callersFunctionhelper
Gfg/C++/k-th_smallest_element_in_BST.cpp:26
↓ 1 callersFunctionhelper
Gfg/C++/Sum_of_nodes_on_the_longest_path_from_root_to_leaf.cpp:30
↓ 1 callersMethodhelper
(char[] s, int left, int right)
Gfg/Java/reverse-string.java:2
← previousnext →701–800 of 2,762, ranked by callers