MCPcopy Create free account

hub / github.com/Rishabh062/Hacktoberfest2021 / functions

Functions430 in github.com/Rishabh062/Hacktoberfest2021

⨍ Functions 430◇ Types & classes 64
↓ 1 callersFunctioncheckWinCondition
TIC TAC TOE PROJECT.cpp:69
↓ 1 callersFunctionchoiceToCords
TIC TAC TOE PROJECT.cpp:60
↓ 1 callersMethodcocktailSort
(int a[])
Java/CocktailSort.java:4
↓ 1 callersFunctioncoinChange
C++/Coin_Change.cpp:15
↓ 1 callersFunctionconstructST
Function to construct segment tree from given array. This function allocates memory for segment tree and calls constructSTUtil() to fill the allocated
C++/Segment_Tree.cpp:115
↓ 1 callersFunctionconstructSTUtil
A recursive function that constructs Segment Tree for array[ss..se]. si is index of current node in segment tree st
C++/Segment_Tree.cpp:94
↓ 1 callersFunctioncontains
Find if key is in array * Returns: True if key belongs to array, * False if key doesn't belong to array */
C++/binarytreeVariant.cpp:12
↓ 1 callersFunctionconvertMaxHeap
C++/Min_heap_to_Max_heap.cpp:20
↓ 1 callersFunctioncount
C++/CoinChange.cpp:17
↓ 1 callersFunctioncountSort
C/countSort.c:21
↓ 1 callersFunctioncountTriplets
C++/three-pointers.cpp:13
↓ 1 callersFunctioncount_substring
(string, sub_string)
HackerRank-Python-main/Find a String.py:1
↓ 1 callersFunctioncountingsort
C++/radix_sort.cpp:21
↓ 1 callersFunctioncreate
C++/element_deletion_from_begining_singly_linked_list.cpp:49
↓ 1 callersFunctioncreateBoard
TIC TAC TOE PROJECT.cpp:7
↓ 1 callersMethodcreateHeap
(T[] unsorted)
Java/HeapSort.java:52
↓ 1 callersFunctioncreateUser
C/Typing Tutor Project in C/Typing Tutor Coding/TT.C:260
↓ 1 callersFunctioncurrentTime
()
javascript/clock.js:1
↓ 1 callersFunctiondelete
C/queue_implement.c:61
↓ 1 callersFunctiondeleteq
C/Circular_Queue.c:83
↓ 1 callersFunctiondequeue
Deletion in queue
C/Queue.c:36
↓ 1 callersFunctiondfs
Yes or No, whether graph is Bipartite or Not
C++/Bipartite_Graph.cpp:36
↓ 1 callersFunctiondfs_helper
C++/Bipartite_Graph.cpp:17
↓ 1 callersMethoddijkstra
(List<List<Node>> adj,int src)
Java/graphs/DPQ.java:29
↓ 1 callersFunctiondisp
C/Doubly_linked_list_all_operation.c:146
↓ 1 callersFunctiondisplay
C/queue_implement.c:75
↓ 1 callersFunctiondisplay
C/Circular_Queue.c:63
↓ 1 callersMethode_Neighbours
(int u)
Java/graphs/DPQ.java:52
↓ 1 callersFunctioneiler
(p, q)
Python/rsa_encryption_algorithm.py:11
↓ 1 callersFunctionemail
(usermail,password,clientemail)
Web_scraping.py:43
↓ 1 callersFunctionemplist
C/Doubly_linked_list_all_operation.c:77
↓ 1 callersFunctionencrypt_string
($string)
php/encrypt.php:3
↓ 1 callersFunctionend
C/Doubly_linked_list_all_operation.c:98
↓ 1 callersFunctionext_evcl
(n_e, e)
Python/rsa_encryption_algorithm.py:29
↓ 1 callersMethodfactorial
(int num)
Java/Factorial.java:3
↓ 1 callersFunctionfetchPlayers
TIC TAC TOE PROJECT.cpp:137
↓ 1 callersFunctionfindCelebrity
C++/celebrity problem.cpp:17
↓ 1 callersFunctionfindRepeating
using bitwise operator xor x^x = 0 0^x = x
C++/duplicate_element_in_array.cpp:12
↓ 1 callersFunctionfind_nth_term
HackerRank-C-main/Calculate the Nth term.c:7
↓ 1 callersFunctionfirst
Find first occurrence index of key in array * Returns: an index in range [0, n-1] if key belongs * to array, -1 if key doesn't belong to array */
C++/binarytreeVariant.cpp:50
↓ 1 callersFunctionflipBits
C++/flip_bits.cpp:9
↓ 1 callersFunctiongame
()
Python/File_handling.py:3
↓ 1 callersFunctiongetSumUtil
A recursive function to get the sum of values in the given range of the array. The following are parameters for this function. st --> Pointe
C++/Segment_Tree.cpp:16
↓ 1 callersFunctionget_truncated_quotient_using_bit_magic
WE WILL USE BIT MANIPULATION HERE TO SOLVE THIS PROBLEM
C++/divide_two_integers_bit_manipulation.cpp:15
↓ 1 callersFunctionget_volume
HackerRank-C-main/Boxes through a Tunnel.c:13
↓ 1 callersFunctiongetmax
time complexity Od(n+k) space complexity O(n+k) k is range of input d is the number of digits in largest number
C++/radix_sort.cpp:14
↓ 1 callersFunctiongreatestlesser
Find index of last occurrence of greatest element less than key in array * Returns: an index in range [0, n-1] if key is not the least element in a
C++/binarytreeVariant.cpp:176
↓ 1 callersFunctionheapSort
main function to do heap sort
C++/Heap sort.cpp:31
↓ 1 callersFunctionhourglassSum
(arr)
HackerRank-Python-main/hourglass_sum.py:11
↓ 1 callersFunctioninitialize
C++/graph_ds.cpp:4
↓ 1 callersFunctioninsert
C/queue_implement.c:44
↓ 1 callersFunctioninsertionSort
(arr)
Python/insertion_sort.py:2
↓ 1 callersFunctioninsertq
C/Circular_Queue.c:40
↓ 1 callersFunctionisEmpty
Check whether queue is empty
C/Queue.c:19
↓ 1 callersFunctionisFull
Check whether queue is full
C/Queue.c:12
↓ 1 callersMethodisPalindromeNumber
(int target)
Java/PalindromeNumber.java:4
↓ 1 callersFunctionisSubsetSum
C++/SubsetSum.cpp:23
↓ 1 callersFunctionis_leap
(year)
HackerRank-Python-main/Write a function.py:1
↓ 1 callersFunctionis_lower_than_max_height
HackerRank-C-main/Boxes through a Tunnel.c:18
↓ 1 callersFunctionjob
(searchString)
Web_scraping.py:16
↓ 1 callersFunctionjobScheduling
C++/Max_profit.cpp:10
↓ 1 callersFunctionlabelBoard
TIC TAC TOE PROJECT.cpp:21
↓ 1 callersFunctionlast
Find last occurrence index of key in array * Returns: an index in range [0, n-1] if key belongs to array, * -1 if key doesn't belong to array */
C++/binarytreeVariant.cpp:91
↓ 1 callersFunctionlcs
Returns length of LCS for X, Y */
C++/LongestCommonSubsequence.cpp:10
↓ 1 callersFunctionleastgreater
Find index of first occurrence of least element greater than key in array * Returns: an index in range [0, n-1] if key is not the greatest element
C++/binarytreeVariant.cpp:133
↓ 1 callersFunctionlinconv
(f, a)
Python/pareto_optimal_vectors_search.py:56
↓ 1 callersFunctionlinear_Search
(list1, n, key)
Python/linear_search.py:1
↓ 1 callersFunctionlis
lis() returns the LIS */
C++/LongestIncreasingSubsequence.cpp:11
↓ 1 callersFunctionloadFiles
==========================================================*/
C/Typing Tutor Project in C/Typing Tutor Coding/TT.C:87
↓ 1 callersFunctionmain
C/Queue.c:54
↓ 1 callersFunctionmain_job
(year,month,date,hour,minute,second,name,username,password,clientmail)
Web_scraping.py:60
↓ 1 callersFunctionmainmenu
C/Typing Tutor Project in C/Typing Tutor Coding/TT.C:126
↓ 1 callersFunctionmakeBeautiful
C++/beautiful_string.cpp:12
↓ 1 callersFunctionmarks_summation
HackerRank-C-main/Students Marks Sum.c:8
↓ 1 callersMethodmaxMeetings
C++/N meetings in room.cpp:13
↓ 1 callersMethodmaxMeetings
Function to find the maximum number of meetings that can be performed in a meeting room.
C++/Activity_selection_greedy.cpp:31
↓ 1 callersFunctionmaxProfit
C++/bestTime ToBuyAndSellStock.cpp:5
↓ 1 callersFunctionmaxSubArraySum
(a, size)
javascript/kadanes_algorithm.js:1
↓ 1 callersMethodmaxSubarraySum
arr: input array n: size of array Function to find the sum of contiguous subarray with maximum sum.
C++/Kadane's_Algorithm.cpp:13
↓ 1 callersFunctionmax_of_four
Add `int max_of_four(int a, int b, int c, int d)` here. */
HackerRank-C-main/Functions in C.c:5
↓ 1 callersFunctionmaximum
C/countSort.c:12
↓ 1 callersFunctionmaxmin
(f, a)
Python/pareto_optimal_vectors_search.py:69
↓ 1 callersFunctionmerge
inversion_count.cpp:3
↓ 1 callersFunctionmerge
C++/Merge Sorted Array.cpp:35
↓ 1 callersFunctionmerge
C/mergeSort.c:10
↓ 1 callersFunctionmergeSort
low is for left index and high is right index of the sub-array of A to be sorted
C/mergeSort.c:42
↓ 1 callersFunctionmergesort
inversion_count.cpp:48
↓ 1 callersMethodminDistance
C++/minOperations.cpp:7
↓ 1 callersFunctionmin_trial_using_memoized_recursive_method
I have taken size of vector as 500, it can be changed as per requirement!
C++/egg_dropping_problem.cpp:44
↓ 1 callersFunctionmin_trial_using_recursive_method
C++/egg_dropping_problem.cpp:19
↓ 1 callersFunctionmin_trial_using_tabulation_method
C++/egg_dropping_problem.cpp:72
↓ 1 callersFunctionmomgean_shuffle
(new_msg)
Python/mongean.py:7
↓ 1 callersFunctionmutate_string
(string, position, character)
HackerRank-Python-main/Mutations.py:1
↓ 1 callersMethodnegPow
(double x, int n)
BinaryExponentiation.java:25
↓ 1 callersFunctionnewNode
Helper function that allocates a new node with the given data and NULL left and right pointers. */
C/BinarySearchTraversal.c:15
↓ 1 callersFunctionnposition
C/Doubly_linked_list_all_operation.c:114
↓ 1 callersFunctionpareto
(arr)
Python/pareto_optimal_vectors_search.py:32
↓ 1 callersFunctionpartition
C/quickSort.c:10
↓ 1 callersFunctionpartition
C/randomizedQuickSort.c:32
↓ 1 callersFunctionperformSwap
Function to perform the swapping of matrix elements in clockwise manner
C++/Rotate_Matrix_Except_Diagonals.cpp:26
← previousnext →101–200 of 430, ranked by callers