Archives factorial - Pavol Pidanič

Hackerrank – Evaluating e^x

Problem Statement A description of the problem can be found on Hackerrank. Solution

object EvaluatingEx extends App {
  def f(x: Double): Double =
    {
      f2(x, 9)
    }

  def fact(x: Int): Int = if (x <= 1) 1 else x * fact(x - 1)

  def f2(x: Double, i: Int): Double =
    {
      if (i == 0) 1 else Math.pow(x, i) / fact(i) + f2(x, i - 1)
    }

  val n = readInt
  (1 to n) foreach (x => println(f(readFloat())))
}

object EvaluatingEx extends App {

def f(x: Double): Double =

{

f2(x, 9)

}

def fact(x: Int): Int = if (x <= 1) 1 else x * fact(x - 1)

def f2(x: Double, i: Int): Double =

{

if (i == 0) 1 else Math.pow(x, i) / fact(i) + f2(x, i - 1)

}

val n = readInt

(1 to n) foreach (x => println(f(readFloat())))

}

Solution also available on my GitHub.

Hackerrank – Pascal’s Triangle

Problem Statement A description of the problem can be found on Hackerrank. Solution I created recursive function for factorial . Then create all combinations of rows and column indexes. For input 4 it looks like:

(0,0)
(1,0), (1,1)
(2,0), (2,1), (2,2)
(3,0), (3,1), (3,2), (3,3)

(0,0)

(1,0), (1,1)

(2,0), (2,1), (2,2)

(3,0), (3,1), (3,2), (3,3)

Apply function for pascal triangle for each combination. I created solution in Scala: The solution […]

Hackerrank – Extra Long Factorials

Problem Statement A description of the problem can be found on Hackerrank. Solution Read input and implement factorial function (recursive or imperative) using Big Integer if desired language does not support automatic conversion to Big Integers by default. I created solution in 3 languages: Scala Java Ruby Normally, I implement a solution also in JavaScript. […]

Pavol Pidanič

I can count to 1023 with 10 fingers

Tag: factorial

Hackerrank – Evaluating e^x

Hackerrank – Pascal’s Triangle

Hackerrank – Extra Long Factorials