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 callersFunctionisValidSudoku
Leetcode/C++/valid_sudoku.cpp:12
↓ 1 callersFunctionisVowel
function to check whether the character is Vowel or not
Gfg/C++/Good_or_Bad_String.cpp:10
↓ 1 callersFunctionis_armstrong
Codechef/C++/BugCrush 2 Question 2 (BUGC202).cpp:3
↓ 1 callersFunctionis_cycle
Data Structures/Graph/C++/cycle_in_undirectedgraph_using_dfs.cpp:52
↓ 1 callersFunctionis_level_palindrome
This function checks if particular level of given binary tree forms palindrome
Data Structures/Tree/C++/Binary_Tree_Symmetric_or_not.cpp:49
↓ 1 callersFunctionis_ugly_num
(no)
Gfg/Python/ugly_num.py:21
↓ 1 callersFunctionis_valid_ip
return 1 if IP string is valid, else return 0 */
Gfg/C++/Validate_IP.cpp:67
↓ 1 callersFunctionis_vowel
(letter)
Hackerank/Python/Words Score.py:1
↓ 1 callersMethodisempty
Data Structures/Tree/C++/Binary_tree_traversal.cpp:55
↓ 1 callersFunctionisfactor
Hackerank/C/Largest palindrome product.c:25
↓ 1 callersMethodispar
(String x)
Gfg/Java/Parenthesis_Checker.java:55
↓ 1 callersFunctionispossible
this function ll tells us whether maximum number of pages to be alloacted to each student passed by mid is appropriate ot not
Gfg/C++/Allocate_minimum_number_of_pages.cpp:14
↓ 1 callersFunctionjohnson
Algorithms/JohnsonAlgorithm.cpp:132
↓ 1 callersFunctionjoinTheLists
Data Structures/LinkedList/C++/Majority Element.cpp:24
↓ 1 callersFunctionjoinTheLists
Data Structures/LinkedList/C++/Join Two Linklist.cpp:25
↓ 1 callersFunctionjoinTheLists
Gfg/C++/Join Two Linklist.cpp:24
↓ 1 callersFunctionjosephus
Leetcode/C++/josephus_problem_recursion.cpp:3
↓ 1 callersFunctionjumpSearch
Algorithms/Searching and Sorting/C++/Jump_search.cpp:7
↓ 1 callersMethodjump_Search
(int a[], int n, int item)
Algorithms/Searching and Sorting/Java/Jump Search.java:7
↓ 1 callersFunctionjumpingOnClouds
Complete the jumpingOnClouds function below.
Hackerank/C++/Jumping on the Clouds- Revisited.cpp:29
↓ 1 callersFunctionkClosest
Algorithms/Miscellaneous/C++/K_Closest_Points_to_Origin.cpp:31
↓ 1 callersFunctionkReverse
Data Structures/LinkedList/C++/KReverse.cpp:52
↓ 1 callersFunctionkadane
Gfg/C++/Kadane's Algorithm.cpp:3
↓ 1 callersFunctionkahn_topological_sort
Algorithms/Graph/C++/Kahn's Algo.cpp:16
↓ 1 callersFunctionkangaroo
(x1, v1, x2, v2)
Hackerank/Python/Number line jumps.py:20
↓ 1 callersFunctionkidsWithCandies
Leetcode/C++/kids-with-the-greatest-number-of-candies.cpp:16
↓ 1 callersFunctionknapSack
Gfg/C++/01 Knapsack.cpp:13
↓ 1 callersMethodknapSack_01_Rec
(int[] weight, int[] value, int cap, int n, int[][] dp)
Gfg/Java/Knapsack Problem.java:29
↓ 1 callersFunctionknapsack
Algorithms/Greedy Algorithms/0-1 KNAPSACK PROBLEM.c:9
↓ 1 callersMethodkosaraju
Function to find number of strongly connected components in the graph.
Gfg/C++/Strongly Connected Components.cpp:47
↓ 1 callersMethodkruskal
Algorithms/Graph/C++/Krushal's Algo.cpp:50
↓ 1 callersMethodkruskal_mst
Gfg/Minimum spanning tree.cpp:65
↓ 1 callersMethodkthlargest
(int [] arr,int k)
Data Structures/kthmaxmin.java:3
↓ 1 callersMethodkthsmallest
(int [] arr,int k)
Data Structures/kthmaxmin.java:20
↓ 1 callersFunctionlargestBst
Gfg/C++/largest_BST.cpp:61
↓ 1 callersFunctionlargestNumber
Leetcode/C++/LargestNumber_Leetcode.cpp:16
↓ 1 callersMethodlargestRectangleHistogram
(int [] h)
Leetcode/maximalrectangle.java:27
↓ 1 callersMethodlarrysArray
(List<Integer> A)
Hackerank/Java/Larrys Array.java:30
↓ 1 callersFunctionlast
(a, low, high, x, n)
Gfg/Python/Count occurrences of an element in a sorted array.py:50
↓ 1 callersFunctionlastIndex
(arr, x)
Gfg/Python/last_index_of_array.py:2
↓ 1 callersFunctionlastIndex
Gfg/C++/Lastindex.cpp:3
↓ 1 callersFunctionlast_index
Miscellaneous problems/Number's_last_index_in_array/REC_ARR.c:4
↓ 1 callersFunctionlast_occurrence
Gfg/C++/count_occurrences_of_element.cpp:30
↓ 1 callersFunctionlcs
Algorithms/Dynamic Problems/C++/Longes_common_sbsequnce.cpp:7
↓ 1 callersFunctionlcs
(X, Y, m, n)
Leetcode/Python/shortest_supersequence.py:18
↓ 1 callersFunctionlcs
Codechef/C++/LCS-3.cpp:13
↓ 1 callersFunctionleft
Hackerank/C++/Largest product in a grid.cpp:16
↓ 1 callersFunctionleft
function creates l[i] which will store the index of previous smaller element for ith element of the array.
Data Structures/Stack/C/histogram.c:26
↓ 1 callersMethodleftBracket
(char ch)
Gfg/Java/Parenthesis_Checker.java:72
↓ 1 callersFunctionleftRotatebyOne
(arr, n)
Gfg/Python/RotateArray.py:9
↓ 1 callersMethodlen
Data Structures/LinkedList/C++/Doubly-Linked-List2.cpp:58
↓ 1 callersMethodlen
Data Structures/LinkedList/C++/Doubly-Linked-List.cpp:57
↓ 1 callersFunctionlengthArr
Leetcode/C++/maximum_length_of_repeated_subarray.cpp:4
↓ 1 callersMethodlengthOfLongestSubstring
Algorithms/Miscellaneous/C++/Longest Substring without repeating characters.cpp:5
↓ 1 callersMethodlengthOfLongestSubstring
(String s)
Leetcode/Java/Longest_Substring.java:40
↓ 1 callersMethodletterCombinations
Leetcode/C++/Letter_Combinations_Phone_Number.cpp:59
↓ 1 callersFunctionlevelOrder
Data Structures/Tree/C++/Binary_tree_traversal.cpp:127
↓ 1 callersMethodlevelOrder
Data Structures/Tree/Tree_Traversal.cpp:181
↓ 1 callersFunctionlevel_order
This gives us the vector of values of all the nodes at the given height
Data Structures/Tree/C++/Binary_Tree_Symmetric_or_not.cpp:35
↓ 1 callersMethodlimits
(int x, int y)
Algorithms/Miscellaneous/Java/WarnsdorffAlgorithm.java:13
↓ 1 callersFunctionlis
lis() returns the length of the longest increasing subsequence in arr[] of size n
Algorithms/Miscellaneous/C++/longest increasing subsequence.cpp:6
↓ 1 callersMethodlis
(int a[],int n)
Algorithms/Dynamic Problems/Java/longest_increasing_subsequence.java:18
↓ 1 callersFunctionll_display
Data Structures/Stack/C++/Stack_operation.cpp:161
↓ 1 callersFunctionll_implementation
Data Structures/Stack/C++/Stack_operation.cpp:179
↓ 1 callersFunctionll_pop
Data Structures/Stack/C++/Stack_operation.cpp:134
↓ 1 callersFunctionll_push
Data Structures/Stack/C++/Stack_operation.cpp:115
↓ 1 callersFunctionll_top
Data Structures/Stack/C++/Stack_operation.cpp:149
↓ 1 callersMethodlongestConsecutive
(self, values)
Algorithms/Longest_Consecutive_Sequence.py:5
↓ 1 callersMethodlongestMountain
Leetcode/C++/Longest_Mountain_Array.cpp:35
↓ 1 callersMethodlongestOnes
Leetcode/C++/Max_Consecutive_Ones_III.cpp:41
↓ 1 callersMethodlongestValidParentheses
Leetcode/C++/Longest_valid_parentheses.cpp:13
↓ 1 callersFunctionloopHere
Gfg/C++/Detect_Loop_in_linked_list.cpp:54
↓ 1 callersMethodlower_bound
(long arr[], long N, long X)
Codechef/Java/TheWave.java:19
↓ 1 callersFunctionltrim
Hackerank/C++/Breaking The Records.cpp:130
↓ 1 callersFunctionltrim
Hackerank/C++/Day_Of_a_Programmer.cpp:101
↓ 1 callersFunctionltrim
Hackerank/C++/Birthday Cake Candles.cpp:59
↓ 1 callersFunctionltrim
Hackerank/C++/Bill Division.cpp:91
↓ 1 callersFunctionltrim
Hackerank/C++/hackerrank_birthdaycake.cpp:63
↓ 1 callersFunctionltrim
Hackerank/C++/Plus-Minus.cpp:91
↓ 1 callersFunctionltrim
Hackerank/C++/A Very Big Sum.cpp:78
↓ 1 callersFunctionltrim
Hackerank/C++/Bubble Sort.cpp:65
↓ 1 callersFunctionltrim
Hackerank/C++/Angry Professor.cpp:100
↓ 1 callersFunctionltrim
Hackerank/C++/Alternating Characters.cpp:80
↓ 1 callersFunctionltrim
Hackerank/C++/Strong Password.cpp:94
↓ 1 callersFunctionlucky_alive
(n:int)
Gfg/Python/Lucky alive person.py:3
↓ 1 callersFunctionlucky_number
(a,b)
Hackerank/Python/LuckyNumber.py:46
↓ 1 callersFunctionmain
()
Hackerank/Python/LuckyNumber.py:72
↓ 1 callersFunctionmain
()
Gfg/gold_mine.py:48
↓ 1 callersFunctionmain
()
Gfg/Python/ugly_num.py:52
↓ 1 callersMethodmajorityElement
Function to find majority element in the array a: input array size: size of input array
Gfg/C++/majority_elements.cpp:25
↓ 1 callersMethodmakeLoop
(Node head, int x)
Gfg/Java/Delete_Loop_from_LL.java:46
↓ 1 callersMethodmakeLoop
(Node head, Node tail, int x)
Gfg/Java/DetectCycleInLinkedlist.java:21
↓ 1 callersMethodmakeLoop
(Node head, Node tail, int x)
Gfg/Java/detect-loop-in-linked-list.java:21
↓ 1 callersFunctionmaketree
function for taking the input from user and assigning the node values accordingly. Queue has been used to assign the "keys" to left and right child al
Data Structures/Tree/C++/Top_View_in_Binary_Tree.cpp:26
↓ 1 callersFunctionmarsExploration
Hackerank/C++/Mars Exploration.cpp:35
↓ 1 callersMethodmatchingStrings
(List<String> strings, List<String> queries)
Hackerank/Java/Sparse Arrays.java:26
↓ 1 callersMethodmaxIndex
Gfg/C++/Maximum_Index.cpp:24
↓ 1 callersFunctionmaxLen
Gfg/C++/Largest subarray with 0 sum .cpp:25
↓ 1 callersMethodmaxMeetings
Gfg/C++/N meetings in one room.cpp:16
↓ 1 callersMethodmaxMeetings
(int start[], int end[], int n)
Gfg/Java/N meetings in one room.java:41
← previousnext →901–1,000 of 2,762, ranked by callers