MCPcopy Create free account

hub / github.com/SAKET-SK/Programming-Aptitude-Interview-Prep / functions

Functions286 in github.com/SAKET-SK/Programming-Aptitude-Interview-Prep

⨍ Functions 286◇ Types & classes 198
↓ 6 callersMethodmin
(int x,int y)
GFG Practice Sets/Mathematical/Calculate nCr Combination/GFG.java:49
↓ 4 callersMethodcost
(int grid[][], int row1, int col1, int row2, int col2)
Cognizant/Que 22/Solution.java:4
↓ 4 callersMethodgcd
(int a, int b)
GFG Practice Sets/Mathematical/Add two Fractions/Fraction_Addition.java:53
↓ 3 callersFunctionLargeSmallSum
(arr)
Accenture/Que 6/AddOfArrayLargeinEvenAndSmallInOdd.py:1
↓ 2 callersFunctionfind
Cognizant/Que 25/RepresentBT.cpp:7
↓ 2 callersMethodgetTime
(String st)
Cognizant/Que 27/Application3.java:125
↓ 2 callersMethodpower
(int N,int R)
GFG Practice Sets/Divide and Conquer/Power of Numbers/Main.java:60
↓ 2 callersMethodsortArray
(int len,int arr[])
Wipro Elite NLTH/Que 22/Main.java:4
↓ 1 callersMethodCalculate
(int m, int n)
Accenture/Que 14/Main.java:5
↓ 1 callersFunctionHCF
This function find the Highest Common Factor of the two numbers
Cognizant/Que 15/lcm.cpp:16
↓ 1 callersFunctionLCM
This function find the Lowest Common Factor of the two numbers
Cognizant/Que 15/lcm.cpp:23
↓ 1 callersMethodNthRoot
(int n, int m)
GFG Practice Sets/Mathematical/Nth root of M/GFG.java:40
↓ 1 callersMethodNth_term
(int a, int r, int n)
GFG Practice Sets/Mathematical/Series Geometric Progression/GFG.java:28
↓ 1 callersMethodactivitySelection
(int start[], int end[], int n)
GFG Practice Sets/Greedy Algorithms/Activity Selection/Solution.java:45
↓ 1 callersMethodaddFraction
(int num1, int den1, int num2, int den2)
GFG Practice Sets/Mathematical/Add two Fractions/Fraction_Addition.java:27
↓ 1 callersMethodareSame
(int A[][], int B[][])
Wipro Elite NLTH/Que 1/Main.java:5
↓ 1 callersMethodarmstrongNumber
(int n)
GFG Practice Sets/Mathematical/Armstrong Number/Solution.java:22
↓ 1 callersMethodbalancedParenthesis
(String str)
Wipro Elite NLTH/Que 15 - Balanced Parenthesis/Main.java:4
↓ 1 callersMethodbfs
(long X, int i)
GFG Practice Sets/Mathematical/Jumping Numbers/GFG.java:34
↓ 1 callersMethodbinary_to_decimal
(String str)
GFG Practice Sets/Mathematical/Binary to Decimal/GFG.java:28
↓ 1 callersMethodcalc
(int n)
TCS - NINJA/Que 4/Main.java:28
↓ 1 callersMethodcalcPower
(int N, int R)
GFG Practice Sets/Divide and Conquer/Power of Numbers/Main.java:64
↓ 1 callersFunctioncalculateTime
TCS/Que 9/washingmachine_weight.cpp:4
↓ 1 callersFunctionceaser
TCS/Que 10/ceasarcipher.cpp:4
↓ 1 callersMethodcheck
(int n)
TCS/Que 18/Main.java:21
↓ 1 callersMethodcheckPassword
(String str, int n)
Accenture/Que 3 - Password Checker/Solution.java:5
↓ 1 callersMethodcheckPosition
(int n, int k)
GFG Practice Sets/Recursion/Josephus Problem/Recursion.java:34
↓ 1 callersMethodclosestNumber
(int N , int M)
GFG Practice Sets/Mathematical/Closest Number/GFG.java:27
↓ 1 callersMethodcollectMax
(int n, int m, int grid[][])
Cognizant/Que 22/Solution.java:78
↓ 1 callersMethodcount
(int N)
GFG Practice Sets/Recursion/Handshakes/GFG.java:26
↓ 1 callersMethodcount
(int i)
Accenture/Que 12/Main.java:4
↓ 1 callersMethodcountIsland
(int[][]arr)
Cognizant/Que 29/Solution.java:6
↓ 1 callersMethodcountSquares
(int N)
GFG Practice Sets/Puzzles/Count Squares/GFG.java:25
↓ 1 callersMethoddectoNBase
(int n, int num)
Accenture/Que 8/Main.java:4
↓ 1 callersMethoddifferenceOfSum
(int m, int n)
Accenture/Que 5/Solution.java:4
↓ 1 callersMethoddoOverlap
(int L1[], int R1[], int L2[], int R2[])
GFG Practice Sets/Puzzles/Overlapping Rectangles/GFG.java:37
↓ 1 callersMethodfactorial
(int N)
GFG Practice Sets/Mathematical/Factorial/GFG.java:22
↓ 1 callersMethodfibonacciDigits
(long N)
GFG Practice Sets/Puzzles/Last 2 Digits of Fibbonacci/GFG.java:27
↓ 1 callersMethodfindAutoCount
(String n)
Accenture/Que 20 - Autobiographical Number/Solution.java:5
↓ 1 callersFunctionfindCount
(arr, length, num, diff)
Accenture/Que 4/Main.py:2
↓ 1 callersMethodfindCount
(int arr[], int length, int num, int diff)
Accenture/Que 4/Main.java:4
↓ 1 callersMethodfindMaxElement
(int len1, int arr1[],int len2,int arr2[])
Wipro Elite NLTH/Que 22/Main.java:24
↓ 1 callersMethodfindPages
(int[]A,int N,int M)
GFG Practice Sets/Random Questions/Allocate Min. Pages/Solution.java:61
↓ 1 callersMethodfractionalKnapsack
Function to get the maximum total value in the knapsack.
GFG Practice Sets/Greedy Algorithms/Fractional Knapsack/Solution.cpp:25
↓ 1 callersMethodfunc
(int i, int cb, int t, int ww)
Cognizant/Que 21/Solution.java:9
↓ 1 callersMethodfunc
(int i, String res)
Cognizant/Que 20/Solution.java:7
↓ 1 callersMethodgcd
(int N , int arr[])
GFG Practice Sets/Mathematical/GCD of Array/Gfg.java:27
↓ 1 callersMethodgcd
(int A , int B)
GFG Practice Sets/Mathematical/GCD/GFG.java:27
↓ 1 callersMethodgetAngle
(int H , int M)
GFG Practice Sets/Puzzles/Angle Between Hands of the Clock/GFG.java:27
↓ 1 callersMethodgetDayOfWeek
(int d, int m, int y)
GFG Practice Sets/Puzzles/Days of the Week/GFG.java:29
↓ 1 callersMethodgetIslandSize
(int[][]grid, int i, int j, int islandId)
Cognizant/Que 29/Solution.java:27
↓ 1 callersMethodgetTable
(int N)
GFG Practice Sets/Mathematical/Multiplication Table/GFG.java:27
↓ 1 callersMethodhammingDistance
(int a, int b)
Cognizant/Que 28/Solution.java:4
↓ 1 callersMethodhelper
(StringBuffer s, int n)
GFG Practice Sets/Recursion/Remove Recursive Duplicates/GFG.java:22
↓ 1 callersMethodinitializeDp
(int dp[][][], int item)
Cognizant/Que 22/Solution.java:69
↓ 1 callersMethodinversionCount
(long arr[], long N)
GFG Practice Sets/Divide and Conquer/Counting Inversions/Solution.java:82
↓ 1 callersMethodisAllocationPossible
(long cutOff,int[] arr,int k)
GFG Practice Sets/Divide and Conquer/Painter's Partition Problem/GFG.java:56
↓ 1 callersMethodisDigitSumPalindrome
(int N)
GFG Practice Sets/Mathematical/Digital Sum Palindrome/GFG.java:25
↓ 1 callersMethodisPerfectNumber
(Long N)
GFG Practice Sets/Mathematical/Perfect Number/GFG.java:24
↓ 1 callersMethodisPossible
(int[]A,int N,int M,int mid)
GFG Practice Sets/Random Questions/Allocate Min. Pages/Solution.java:35
↓ 1 callersMethodisPowerOfAnother
(Long X, Long Y)
GFG Practice Sets/Puzzles/If power of another/GFG.java:27
↓ 1 callersFunctionisPrime
This function is identifying the number is prime or not
Cognizant/Que 18/prime.cpp:18
↓ 1 callersMethodisPrime
(int no)
Wipro Elite NLTH/Que 7 - Prime/Solution.java:4
↓ 1 callersMethodisPrime
(int N)
GFG Practice Sets/Mathematical/Prime Number/GFG.java:21
↓ 1 callersMethodisPrime
(int a)
GFG Practice Sets/Mathematical/Pairs of Primes/GFG.java:56
↓ 1 callersMethodisPrime
(int n)
GFG Practice Sets/Mathematical/Sum of Primes from 1 to N/GFG.java:27
↓ 1 callersMethodisSquare
(int x1, int y1, int x2, int y2, int x3, int y3, int x4, int y4)
GFG Practice Sets/Puzzles/Is Square/GFG.java:33
↓ 1 callersMethodisTriangular
(int N)
GFG Practice Sets/Puzzles/Triangular Numbers/GFG.java:24
↓ 1 callersMethodjosephus
(int n, int k)
GFG Practice Sets/Recursion/Josephus Problem/Recursion.java:42
↓ 1 callersMethodjumpingNums
(long X)
GFG Practice Sets/Mathematical/Jumping Numbers/GFG.java:24
↓ 1 callersMethodkaratsubaAlgo
(String A, String B)
GFG Practice Sets/Divide and Conquer/Karatsuba Algorithm/GFG.java:28
↓ 1 callersMethodkthDigit
(int A,int B,int K)
GFG Practice Sets/Mathematical/Print Kth Digit/GFG.java:27
↓ 1 callersMethodlargeSmallSum
(int[]arr,int n)
Accenture/Que 6/Main.java:4
↓ 1 callersMethodlargestNumber
(int n, int sum)
GFG Practice Sets/Greedy Algorithms/Largest Number with Given Sum/Solution.java:35
↓ 1 callersMethodlargestPrimeFactor
(int N)
GFG Practice Sets/Mathematical/Largest Prime Factor/GFG.java:36
↓ 1 callersMethodlcmAndGcd
(Long A , Long B)
GFG Practice Sets/Mathematical/LCM/GFG.java:26
↓ 1 callersFunctionmakeans
Cognizant/Que 25/RepresentBT.cpp:17
↓ 1 callersMethodmatrixMultiply
(int r1,int c1,int mat1[][],int r2,int c2,int mat2[][])
Wipro Elite NLTH/Que 10 - Matrix Multiply/Main.java:4
↓ 1 callersMethodmaxExponents
(int a, int b)
Accenture/Que 12/Main.java:16
↓ 1 callersMethodmaxInArray
(int arr[], int length)
Accenture/Que 19/Main.java:4
↓ 1 callersMethodmaxMeetings
GFG Practice Sets/Greedy Algorithms/N Meetings in a Room/Solution.cpp:14
↓ 1 callersMethodmerge
(long arr[],long temp[],int left,int mid,int right)
GFG Practice Sets/Divide and Conquer/Counting Inversions/Solution.java:35
↓ 1 callersMethodmerge_Sort
(long arr[],long temp[],int left,int right)
GFG Practice Sets/Divide and Conquer/Counting Inversions/Solution.java:64
↓ 1 callersMethodminTime
(int[] arr,int n,int k)
GFG Practice Sets/Divide and Conquer/Painter's Partition Problem/GFG.java:34
↓ 1 callersMethodmoveHyphen
(String str, int n)
Accenture/Que 9/Solution.java:4
↓ 1 callersMethodmoveRing
(int N, int from, int to, int aux)
GFG Practice Sets/Recursion/Tower of Hanoi/Recursion.java:44
↓ 1 callersMethodmultiply
(double number, int n)
GFG Practice Sets/Mathematical/Nth root of M/GFG.java:32
↓ 1 callersMethodnCr
(int n, int r)
GFG Practice Sets/Mathematical/Calculate nCr Combination/GFG.java:27
↓ 1 callersMethodnPr
(long n, long r)
GFG Practice Sets/Mathematical/Calculate Permuation nPr/GFG.java:26
↓ 1 callersMethodnoOfOpenDoors
(Long N)
GFG Practice Sets/Puzzles/Open Doors/GFG.java:25
↓ 1 callersMethodnthEvenFibonacci
(long n)
GFG Practice Sets/Puzzles/Nth even Fibbonacci Number/GFG.java:24
↓ 1 callersMethodnthTermOfAP
(int A1, int A2, int N)
GFG Practice Sets/Mathematical/Series Arithmetic Progression/GFG.java:26
↓ 1 callersMethodnumberOfCarries
(int num1, int num2)
Accenture/Que 10/Main.java:4
↓ 1 callersMethodoperationChoices
(int c, int a, int b)
Accenture/Que 13/Solution.java:4
↓ 1 callersMethodoperationsBinaryString
(String str)
Accenture/Que 2/Main.java:4
↓ 1 callersMethodpairCubeCount
(int N)
GFG Practice Sets/Mathematical/Pair Cube Count/GFG.java:24
↓ 1 callersMethodpalindrome
(int no1)
Accenture/Que 17/Main.java:7
↓ 1 callersMethodpattern
(int N)
GFG Practice Sets/Recursion/Print Pattern/GFG.java:26
↓ 1 callersMethodpower
(long a, int b)
GFG Practice Sets/Mathematical/Series Geometric Progression/GFG.java:36
↓ 1 callersMethodprime
(int n)
TCS/Que 18/Main.java:29
next →1–100 of 286, ranked by callers