← Back to Infosys

Math

24 questions

1Palindrome NumberEasy
Math
Solve →
2Reverse IntegerMedium
Math
Solve →
3Fibonacci NumberEasy
MathDynamic ProgrammingRecursion
Solve →
4Count the Number of Ideal ArraysHard
MathDynamic ProgrammingCombinatorics
Solve →
5Climbing StairsEasy
MathDynamic ProgrammingMemoization
Solve →
6Sqrt(x)Easy
MathBinary Search
Solve →
7Determine the Minimum Sum of a k-avoiding ArrayMedium
MathGreedy
Solve →
8Greatest Common Divisor of StringsEasy
MathString
Solve →
9Pow(x, n)Medium
MathRecursion
Solve →
10Number of Beautiful Integers in the RangeHard
MathDynamic Programming
Solve →
11Minimum Addition to Make Integer BeautifulMedium
MathGreedy
Solve →
12Find the Minimum Possible Sum of a Beautiful ArrayMedium
MathGreedy
Solve →
13Count the Number of Ideal ArraysHard
MathDynamic ProgrammingCombinatorics
Solve →
14Determine the Minimum Sum of a k-avoiding ArrayMedium
MathGreedy
Solve →
15Number of Beautiful Integers in the RangeHard
MathDynamic Programming
Solve →
16Minimum Addition to Make Integer BeautifulMedium
MathGreedy
Solve →
17Find the Minimum Possible Sum of a Beautiful ArrayMedium
MathGreedy
Solve →
18Palindrome NumberEasy
Math
Solve →
19Fibonacci NumberEasy
MathDynamic ProgrammingRecursion
Solve →
20Reverse IntegerMedium
Math
Solve →
21Climbing StairsEasy
MathDynamic ProgrammingMemoization
Solve →
22Sqrt(x)Easy
MathBinary Search
Solve →
23Greatest Common Divisor of StringsEasy
MathString
Solve →
24Pow(x, n)Medium
MathRecursion
Solve →