MCPcopy Create free account

hub / github.com/Vishruth-S/CompetitiveCode / functions

Functions692 in github.com/Vishruth-S/CompetitiveCode

↓ 1 callersFunctionmaxset
(A)
InterviewBit_problems/Sorting/Max NonNegative SubArray/solution.py:14
↓ 1 callersFunctionmergeSort
GeeksForGeeks/Merge_Sort_for_Linked_List/Solution.cpp:67
↓ 1 callersFunctionmidPoint
Function to find the mid point of the linked list
GeeksForGeeks/Merge_Sort_for_Linked_List/Solution.cpp:28
↓ 1 callersFunctionmigratoryBirds
(arr)
Hackerrank_problems/Migratory Birds/solution.py:15
↓ 1 callersFunctionminiMaxSum
(arr)
Hackerrank_problems/Mini-Max Sum/solution.py:3
↓ 1 callersFunctionmissing_num
(n)
CSES_Problems/Missing Number/solution.py:1
↓ 1 callersFunctionmoney
GeeksForGeeks/Sister_and_Coins/Solution.cpp:18
↓ 1 callersFunctionmove
Hackerrank_problems/Tower_of_Hanoi_Recursion/solution.cpp:4
↓ 1 callersFunctionmyAtoi
(str: str)
LeetCode_problems/String to Integer (ATOI)/Solution.py:12
↓ 1 callersFunctionmyFunction
Hackerrank_problems/Let's Review/solution.C:6
↓ 1 callersFunctionn_squared
project_euler_problems/integer right triangle/solution.cpp:36
↓ 1 callersFunctionnum_solutions
project_euler_problems/integer right triangle/solution.cpp:51
↓ 1 callersFunctionnumberOfOperations
HackerEarth_problems/Balancing cubes/solution.cpp:18
↓ 1 callersFunctionnumberVocab
create function for load vocab from number base on index
Hackerrank_problems/Time_In_Words/solution.cpp:6
↓ 1 callersFunctionorganizingContainers
(container)
Hackerrank_problems/Organizing_container_of_balls/solution.py:5
↓ 1 callersMethodpageCount
(int n, int p)
Hackerrank_problems/DrawingBook/Solution2.java:19
↓ 1 callersMethodpath
(self,x,y)
HackerEarth_problems/Edges on a path/solution.py:64
↓ 1 callersFunctionpermutationEquation
Hackerrank_problems/Sequence Equation/solution.cpp:29
↓ 1 callersFunctionpermutationEquation
(p)
Hackerrank_problems/Sequence Equation/solution3.py:10
↓ 1 callersMethodpermutationEquation
(int[] p)
Hackerrank_problems/Sequence Equation/Solution.java:12
↓ 1 callersFunctionpickingNumbers
(a)
Hackerrank_problems/Picking Numbers/solution.py:13
↓ 1 callersFunctionpopulateMyPrimes
Spoj_problems/PRIME1/solution.cpp:9
↓ 1 callersMethodprintArray
(int arr[])
Misc/Heap_Sort/solution.java:94
↓ 1 callersFunctionprintList
Function to print the linked list
GeeksForGeeks/Merge_Sort_for_Linked_List/Solution.cpp:86
↓ 1 callersFunctionprintNcR
(n, r)
CodeChef_problems/CHEFINSQ/solution.py:7
↓ 1 callersMethodprintOutput
CodeChef_problems/MINDSUM/solution.cpp:71
↓ 1 callersFunctionprint_singly_linked_list
(node, sep, fptr)
Hackerrank_problems/Reverse Linked List/solution.py:30
↓ 1 callersMethodprint_top
(self)
Hackerrank_problems/Queue using Two Stacks/solution.py:25
↓ 1 callersFunctionpush
Function to push elements into the linked list
GeeksForGeeks/Merge_Sort_for_Linked_List/Solution.cpp:95
↓ 1 callersFunctionread
Codeforces_problems/RockPaperScissors/solution.cpp:30
↓ 1 callersFunctionreadAndSortLanterns
Codeforces_problems/Vanya and Lanterns/solution.cpp:13
↓ 1 callersFunctionremoveNum
Funtion to remove dupliocates in an array
GeeksForGeeks/Remove duplicate elements from sorted Array/Solution.cpp:5
↓ 1 callersFunctionrepeat_counts
(n)
CSES_Problems/Repetitions/solution.py:1
↓ 1 callersFunctionrepeatedString
(s, n)
Hackerrank_problems/Repeated String/Solution.py:13
↓ 1 callersFunctionreturnMaxDistanceBetweenLanterns
Codeforces_problems/Vanya and Lanterns/solution.cpp:25
↓ 1 callersFunctionreverse
we are making a finction to reverse the given string
Hackerrank_problems/BeautifulDaysAtTheMovies/solution.cpp:9
↓ 1 callersFunctionreverse
(x)
Hackerrank_problems/BeautifulDaysAtTheMovies/solution.py:7
↓ 1 callersFunctionrotate
Function to rotate the matrix by 90 degrees
GeeksForGeeks/Rotate_by_90_degrees/Solution.cpp:21
↓ 1 callersFunctionrpn
Spoj_problems/ONP/solution.cpp:12
↓ 1 callersFunctionsearch
HackerEarth_problems/Prasanjeet verma and his sorrow/Solution.cpp:36
↓ 1 callersFunctionsearchall
HackerEarth_problems/Hey! Please help Pradyumn!/Solution.cpp:57
↓ 1 callersFunctionsearchtrie
HackerEarth_problems/Shubham and Subarray Xor/solution.cpp:39
↓ 1 callersFunctionselectCandidate
LeetCode_problems/Majority Element/solution2.cpp:22
↓ 1 callersFunctionshift
this function shifts the position of an existing list or string and returns it as a new list
Misc/Caesar_Cipher_Encryptor/solution2.py:4
↓ 1 callersFunctionsockMerchant
(n, ar)
Hackerrank_problems/Sales by Match/solution.py:10
↓ 1 callersFunctionsolve
Here, in this method, we will solve this problem using a odd and even pattern. And, we will check if the given x,y points lies on line x=y or x-y=2 *
Spoj_problems/NSTEPS/solution.cpp:9
↓ 1 callersFunctionsolve
Spoj_problems/FCTRL/solution.cpp:16
↓ 1 callersFunctionsolve
Spoj_problems/FCTRL2/solution.cpp:46
↓ 1 callersFunctionsolve
GeeksForGeeks/Longest Palindrome in String/solution.cpp:4
↓ 1 callersFunctionsolve
CodeChef_problems/CENS20D/solution.cpp:25
↓ 1 callersFunctionsolve
CodeChef_problems/EVENM/Solution.cpp:24
↓ 1 callersFunctionsolve
CodeChef_problems/The Tom and Jerry Game!/solution2.cpp:25
↓ 1 callersFunctionsolve
()
CodeChef_problems/Bob and His Friends/Solution.py:21
↓ 1 callersFunctionsolve
CodeChef_problems/Multiple of 3/solution.cpp:25
↓ 1 callersFunctionsolve
CodeChef_problems/GCD operations/solution.cpp:9
↓ 1 callersFunctionsolve
CodeChef_problems/Chef and Street Food/solution.cpp:22
↓ 1 callersFunctionsolve
CodeChef_problems/Lapindromes/solution.cpp:21
↓ 1 callersFunctionsolve
CodeChef_problems/CHFICRM/Solution.cpp:27
↓ 1 callersFunctionsolve
CodeChef_problems/Ada King/solution.cpp:59
↓ 1 callersFunctionsolve
Codeforces_problems/RockPaperScissors/solution.cpp:38
↓ 1 callersFunctionsolve
this is a classic dp problem, very similar to the knapsack problem. the DP's state will be the current column, row, how many numbers we picked in the
Codeforces_problems/Zero Remainder Sum/solution.cpp:22
↓ 1 callersFunctionsolve
Codeforces_problems/Team/solution.cpp:5
↓ 1 callersFunctionsolve
Codeforces_problems/Next Round/solution.cpp:5
↓ 1 callersFunctionsolve
Codeforces_problems/Mike And Cellphones 689A/solution.cpp:52
↓ 1 callersFunctionsolve
Codeforces_problems/Chef Monokarp/solution.cpp:27
↓ 1 callersFunctionsolve
The main clue of this question is the equation (n*(n-1))/2 -1. When we sort an array by swapping elements, the Worst case happens when the array is s
Codeforces_problems/Cubes Sorting1420A/Solution.cpp:16
↓ 1 callersFunctionsolve
LeetCode_problems/First Missing Positive/Solution.cpp:4
↓ 1 callersFunctionsolve
project_euler_problems/Largest Product in a Grid/solution.cpp:14
↓ 1 callersFunctionsolve
The following function explains the inorder traversal of a Binary Tree , i.e. leftchild--node--right child :being its basic form.
InterviewBit_problems/Symmetric_Traversal/Solution.cpp:21
↓ 1 callersFunctionsolve
Recursive function for the solution
InterviewBit_problems/LeastCommonAncestor/solution.cpp:19
↓ 1 callersFunctionsolve
InterviewBit_problems/BinaryTree_PreorderTraversal/Solution.cpp:16
↓ 1 callersFunctionsolve
Given below is th solve function
Hackerrank_problems/Operators/Solution.cpp:5
↓ 1 callersFunctionsolve
this is the alghorithm to calculate the permutation since it's said that it wants only the one starts with 1 so we just need to calculate
Hackerrank_problems/Sherlock_and_Permutation/solution.py:6
↓ 1 callersFunctionsolveMeFirst
(a, b)
Hackerrank_problems/Solve_me_first/solution1_MultipleWays.py:6
↓ 1 callersMethodsolveMeFirst
(int a, int b)
Hackerrank_problems/Solve_me_first/solution.java:7
↓ 1 callersFunctionsolve_elevatr
/
CodeChef_problems/ELEVTR/solution.cpp:122
↓ 1 callersFunctionsolvingUsingLogicalOperations
(a, b)
Hackerrank_problems/Solve_me_first/solution1_MultipleWays.py:19
↓ 1 callersFunctionsplit
Hackerrank_problems/Hackfest2020/StrictlyIncreasingSequence/strictlyIncreasingSequence.cpp:99
↓ 1 callersFunctionsplit
Hackerrank_problems/Hackfest2020/GameOfMaximization/gameOfMaximization.cpp:94
↓ 1 callersFunctionsplit
Hackerrank_problems/diagonal-difference/solution.cpp:95
↓ 1 callersFunctionsplit_string
Hackerrank_problems/kangaroo/solution5.cpp:86
↓ 1 callersFunctionsplit_string
Hackerrank_problems/BeautifulDaysAtTheMovies/solution.cpp:57
↓ 1 callersFunctionsplit_string
Hackerrank_problems/3D_Surface_Area/solution2.cpp:86
↓ 1 callersFunctionstaircase
Complete the staircase function below.
Hackerrank_problems/staircase/solution.cpp:7
↓ 1 callersFunctionsumOfDigits
(n)
Misc/SumOfAllDigits/solution1.py:12
↓ 1 callersFunctionsum_of
(n)
Codeforces_problems/Merge It A/solution.py:4
↓ 1 callersFunctionsummingSeries
the formula it's self if tn = n^2 - (n-1)^2 sn = t1+ t2 + ... + tn but if we look it closely we can make a shortcut by just returnin
Hackerrank_problems/Summing_n_series/solution.py:6
↓ 1 callersFunctionsumuptosingledigit
Recursively find sum of digits till the number is single digit
Misc/SumOfAllDigits/solution2.cpp:20
↓ 1 callersFunctionsurfaceArea
Hackerrank_problems/3D_Surface_Area/solution2.cpp:17
↓ 1 callersMethodswap
method to swap ith character with jth character inside charArray @param charArray @param i @param j
Hackerrank_problems/Bigger is Greater/BiggerIsGreater.java:65
↓ 1 callersFunctiontimeInWords
Hackerrank_problems/Time_In_Words/solution.cpp:18
↓ 1 callersFunctiontowersofhanoi
(disks, source, middle, destination)
Hackerrank_problems/Tower_of_Hanoi_Recursion/solution.py:11
↓ 1 callersFunctionwhoIsTheWinner
Hackerrank_problems/Hackfest2020/StrictlyIncreasingSequence/strictlyIncreasingSequence.cpp:16
MethodDinic
HackerEarth_problems/New Friends/solution.cpp:53
MethodFastReader
()
CodeChef_problems/Chef Wars - Return of the Jedi/Solution.java:29
MethodFlowEdge
HackerEarth_problems/New Friends/solution.cpp:41
FunctionHiveMaker
(sticks)
Misc/HiveMaker/solution_2.py:1
MethodHotelApartment
Hackerrank_problems/Hotel Price/solution.cpp:22
MethodHotelRoom
Hackerrank_problems/Hotel Price/solution.cpp:8
MethodNode
GeeksForGeeks/Palindrome_Linked_List/Solution.cpp:8
← previousnext →201–300 of 692, ranked by callers