Home · mission-peace/interview Wiki

Home · mission-peace/interview Wiki

Given a large number tell where it is an aggregate number or not - AggregateNumber.java

Given an array of sorted numbers, tell if there are 3 numbers which form arithmetic progression - ArithemeticProgressionExists.java

Given a series of numbers as the input, the last one as the result.Use the rest numbers to calculate the result,only +, -, *, / are allowed - ArithmeticOperatorForFinalResult.java

Given two numbers in form of an array, multiply them - ArrayMultiplication.java

Given a number n and k, find binomial coefficient of n to k - BinomialCoefficient.java

Covert a decimal number into any other base N < 10 - ConvertToBaseN.java

Given a number n, find counts of 2 from 1 to n - CountNoOf2s.java

Given a number n, find number of numbers which does not have digit 4 in them - CountNumbersNotIncluding4.java

Given a dividend and a divisor, return remainder and quotient - DivisionWithoutDivisionOperator.java

Given two numbers find their GCD(greatest common divisor) - EuclideanAlgoForGCD.java

Given an array of numbers, generate a signature where D represent decrease and I represents increase. Now given Ds and Is generate pattern of number - GenerateSignature.java

Read full article from Home · mission-peace/interview Wiki