MCPcopy Create free account

hub / github.com/CodeToExpress/dailycodebase / functions

Functions801 in github.com/CodeToExpress/dailycodebase

⨍ Functions 801◇ Types & classes 143
↓ 1 callersFunctioncountUniques
(data)
day18/Python/B_Count_Uniques.py:6
↓ 1 callersMethodcountUniques
(int arr[])
day18/Java/Unique.java:14
↓ 1 callersFunctioncount_uniques
(frequency_dictionary)
day18/Python/count_uniques.py:7
↓ 1 callersFunctioncount_vowels
=begin @author: aaditkamat @date: 25/12/2018 =end
day4/Ruby/partA_sol.rb:5
↓ 1 callersFunctiondeletable
day7/C/One_edit_away.c:52
↓ 1 callersMethoddequeue
(element)
day43/JavaScript/queueReversal.js:37
↓ 1 callersMethoddisplay
()
day38/Java/Stack.java:53
↓ 1 callersFunctiondist
(first, second)
day8/Python/levenshtein_distance.py:10
↓ 1 callersFunctiondist
day8/C++/levenshtein_distance.cpp:16
↓ 1 callersFunctiondist
(first, second)
day8/Ruby/levenshtein_distance.rb:9
↓ 1 callersMethoddist
(String first, String second)
day8/Java/LevenshteinDistance.java:14
↓ 1 callersFunctioneighth_pattern
day5/C++/eighth_pattern.cpp:10
↓ 1 callersFunctionfact
day13/C++/factorialDay13.cpp:10
↓ 1 callersFunctionfact
day13/C/factorial.c:8
↓ 1 callersFunctionfactorial
(no)
day13/Python/factorial.py:7
↓ 1 callersFunctionfactorial
(n)
day13/Python/fact.py:6
↓ 1 callersFunctionfactorial
* @desc: recursive function to compute factorial of the Number. * @param: integer N. * @return: factorial of N. */
day13/C++/FACTORIAL_RECURSION.cpp:20
↓ 1 callersMethodfactorial
(int num)
day13/Java/Factorial.java:9
↓ 1 callersFunctionfactorial_iterative
(num)
day13/Python/factorial_aadit.py:13
↓ 1 callersFunctionfactorial_iterative
(num)
day13/Ruby/factorial.rb:16
↓ 1 callersFunctionfactorial_recursive
(num, result)
day13/Python/factorial_aadit.py:6
↓ 1 callersFunctionfactorial_recursive
(num, result)
day13/Ruby/factorial.rb:6
↓ 1 callersFunctionfib
* @desc: recursive function to calculate the Nth Fibonacci number. * @param: the integer N. * @return: Nth Fibonacci number. */
day13/C++/FIBONACCI_RECURSION.cpp:21
↓ 1 callersFunctionfib_num
day13/C++/day13b.cpp:9
↓ 1 callersFunctionfibonacci
(num)
day13/JavaScript/fibo_madhav.js:13
↓ 1 callersFunctionfibonacci
day13/C++/fibonacci.cpp:9
↓ 1 callersFunctionfibonacci
* Fibonacci Series Using Recursion * @author MadhavBahl * @date 18/01/2019
BONUS/Recursion/Fibonacci/fibonacci.js:7
↓ 1 callersFunctionfibonacci_iterative_sequence
(num)
day13/Python/fibonacci_aadit.py:36
↓ 1 callersFunctionfibonacci_iterative_sequence
(num)
day13/Python/fibonacci.py:36
↓ 1 callersFunctionfibonacci_iterative_sequence
(num)
day13/Ruby/fibonacci.rb:44
↓ 1 callersFunctionfibonacci_recursive_sequence
(num, arr)
day13/Python/fibonacci_aadit.py:23
↓ 1 callersFunctionfibonacci_recursive_sequence
(num, arr)
day13/Python/fibonacci.py:23
↓ 1 callersFunctionfibonacci_recursive_sequence
(num, arr)
day13/Ruby/fibonacci.rb:28
↓ 1 callersFunctionfifth_pattern
day5/C++/fifth_pattern.cpp:10
↓ 1 callersFunctionfill_table
(num)
day15/Python/pascal.py:6
↓ 1 callersFunctionfill_table
(num)
day15/Ruby/pascal.rb:6
↓ 1 callersFunctionfindArraySum
* @author MadhavBahl * @date 18/01/2019 * Array Elements Sum using Recursion
BONUS/Recursion/ArraySum/arraySum.js:7
↓ 1 callersMethodfindArraySum
(int arr[], int num)
BONUS/Recursion/ArraySum/ArraySum.java:10
↓ 1 callersMethodfindElement
(int num)
BONUS/Recursion/Fibonacci/Fibonacci.java:10
↓ 1 callersFunctionfindFactorial
* Factorial usinig recursion * @author MadhavBahl * @date 18/01/2019
BONUS/Recursion/Recursion/factorial.js:7
↓ 1 callersMethodfindFactorial
(int num)
BONUS/Recursion/Recursion/Factorial.java:10
↓ 1 callersMethodfindMax
()
day39/JavaScript/maxElement.js:45
↓ 1 callersFunctionfindPascal
* @author MadhavBahl * @date 09/01/2018
day15/JavaScript/pascal_MadhavBahlMD.js:6
↓ 1 callersFunctionfindPower
* Finding `a` raised to the power `n` rercursively * @author MadhavBahl * @date 18/01/2019
BONUS/Recursion/Power/power.js:7
↓ 1 callersMethodfindPower
(double a, double n)
BONUS/Recursion/Power/Power.java:9
↓ 1 callersFunctionfindProduct
* Find Product of array elements * @author MadhavBahl * @date 18/01/2019
BONUS/Recursion/ArrayProduct/arrayProd.js:7
↓ 1 callersMethodfindProduct
(double arr[], int n)
BONUS/Recursion/ArrayProduct/ArrayProd.java:10
↓ 1 callersMethodfindcommon
(int a[],int b[])
day22/Java/Common2.java:14
↓ 1 callersMethodfindcommon
(int a[],int b[],int c[])
day22/Java/Common3.java:14
↓ 1 callersFunctionfirst_pattern
day5/C++/first_pattern.cpp:10
↓ 1 callersFunctionfisherYates
* Fisher Yates Shuffle Algorithm * Implemented in JavaScript by @MadhavBahl * Algorithm * Step 1: Write down the numbers from 1 through N. * S
day19/JavaScript/fisherYates.js:13
↓ 1 callersFunctionfisher_yates
(lst)
day19/Python/fisher_yates.py:11
↓ 1 callersFunctionfizzBuzz
Day1/Kotlin/FizzBuzz.kts:6
↓ 1 callersMethodfizzBuzz
(int n)
Day1/Java/FizzBuzzPrabhat.java:12
↓ 1 callersFunctionfizzBuzz1
Day1/C++/FizzBuzz_Program.cpp:10
↓ 1 callersFunctionfizzBuzz2
Day1/C++/FizzBuzz_Program.cpp:30
↓ 1 callersFunctionfizzbuzz
(num)
Day1/JavaScript/sol2.js:13
↓ 1 callersFunctionfizzbuzz
(num)
Day1/JavaScript/sol1.js:13
↓ 1 callersFunctionfourth_pattern
day5/C++/fourth_pattern.cpp:10
↓ 1 callersFunctionfreqCounter
* @author MadhavBahl * @date 01/14/2018 * Frequency Ccounter using object
day18/JavaScript/freqCounter_madhav.js:7
↓ 1 callersMethodgenerate
(String str,char c[])
day9/Java/minSubstring.java:29
↓ 1 callersMethodgenerateLPSArray
(int[] lps, String subs)
day12/Java/KMPAlgo.java:44
↓ 1 callersMethodgenerator
(String prev, char[] in)
day10/Java/permutations.java:17
↓ 1 callersFunctionget_input
(word)
day18/Python/frequency_counter.py:17
↓ 1 callersFunctionget_result
(num)
Day1/Ruby/fizzbuzz.rb:6
↓ 1 callersFunctionhamming
hamming distance of two strings
Day3/C++/00x3.cpp:11
↓ 1 callersFunctionhammingDistance
Day3/C++/hamming.cpp:5
↓ 1 callersFunctionhammingDistance
Day3/C++/Day03.cpp:10
↓ 1 callersFunctionhammingDistance
Day3/C/hamming.c:10
↓ 1 callersFunctionhanoi
(start_rod, aux_rod, end_rod, num)
day16/Ruby/hanoi.rb:6
↓ 1 callersFunctionind
(m, n)
day8/Python/levenshtein_distance.py:6
↓ 1 callersFunctionind
day8/C++/levenshtein_distance.cpp:12
↓ 1 callersFunctionind
=begin @author: aaditkamat @date: 31/12/2018 =end
day8/Ruby/levenshtein_distance.rb:5
↓ 1 callersMethodind
(char m, char n)
day8/Java/LevenshteinDistance.java:10
↓ 1 callersMethodinputArr
(int arr[], int num)
BONUS/Arrays/Reverse/Reverse.java:10
↓ 1 callersMethodinputArr
(int arr[], int num)
BONUS/Misc/Reverse/Reverse.java:10
↓ 1 callersFunctioninsertionSort
(arr)
day32/JavaScript/insertionsort.js:1
↓ 1 callersFunctioninsertionSort
day33/C++/insertionSort.cpp:10
↓ 1 callersMethodisEmpty
()
day43/JavaScript/queueReversal.js:65
↓ 1 callersMethodisEmpty
()
day38/JavaScript/stack1.js:16
↓ 1 callersMethodisFull
()
day43/JavaScript/queueReversal.js:71
↓ 1 callersMethodisFull
()
day38/JavaScript/stack2.js:25
↓ 1 callersMethodisFull
()
day38/JavaScript/stack1.js:22
↓ 1 callersMethodisFull
()
day38/Java/Stack.java:41
↓ 1 callersMethodisFull
()
day39/JavaScript/stackReverse.js:15
↓ 1 callersMethodisFull
()
day39/JavaScript/maxElement.js:15
↓ 1 callersFunctionisValid
day17/C++/Day17.cpp:18
↓ 1 callersFunctionis_correct
(chessboard)
day17/Python/n_queens.py:57
↓ 1 callersFunctionlcs
(str1, str2)
day11/Python/lcs.py:7
↓ 1 callersFunctionlevenshtein_distance
day8/Cpp/day8.cpp:14
↓ 1 callersFunctionlevenshtein_distance
day8/C/levenshtein_distance.c:19
↓ 1 callersFunctionlinear_search
day28/C/Linear_Search.c:9
↓ 1 callersFunctionlongest_common_substring
(str1, str2)
day11/Python/longest_common_substring.py:17
↓ 1 callersFunctionmain
()
day13/Python/factorial_aadit.py:23
↓ 1 callersFunctionmain
()
day13/Python/fibonacci_aadit.py:66
↓ 1 callersFunctionmain
()
day13/Python/fibonacci.py:66
↓ 1 callersFunctionmain
()
day7/Python/one_edit_distance.py:36
↓ 1 callersFunctionmain
()
day8/Python/levenshtein_distance.py:36
↓ 1 callersFunctionmain
()
day8/Python/minimum_edit_distance.py:37
↓ 1 callersFunctionmain
()
day10/Python/permutations.py:23
← previousnext →201–300 of 801, ranked by callers