Hey there! Welcome to ClearUrDoubt.com. In this post, we will look at a Scala program that replaces multiple strings with their corresponding replacement strings in Scala. We can achieve this in an elegant way using the foldLeft() function. Let’s look at Read more
Hey there! Welcome to ClearUrDoubt.com. In this post, we will look at a Scala program to separate even and odd numbers in a List of Integers. We can achieve this using “partition” function defined on List. partition function takes a predicate Read more
Hey there! Welcome to ClearUrDoubt.com. In this post, we will look at a Scala program to convert an Array into an instance of Map. Let’s look at the program:
|
1 2 3 4 5 6 7 8 9 10 11 12 13 |
object ArrayToMap extends App { val ints = Array(1, 2, 3, 4) val strings = Array("ONE", "TWO", "THREE", "FOUR") //Convert above ints and strings arrays into a Map val mapIntToStrings = (ints zip strings).toMap println("Int to String Map = " + mapIntToStrings.mkString(", ")) //Convert above ints and corresponding indices into a Map val mapIntsToIndices = (ints zipWithIndex).toMap println("Int to Index Map = " + mapIntsToIndices.mkString(", ")) } |
Output: Happy learning. Please leave a reply in case of any Read more
Hey there! Welcome to ClearUrDoubt.com. In this post, we will look at a Scala program to find the largest number in a given list of integers using reduceLeft. Let’s look at the program:
|
1 2 3 4 5 6 7 8 9 10 11 12 |
package com.clearurdoubt.practice object FindMax extends App { val l = List(1,-5,10,3,9) val max = l.reduceLeft( (a, b) => if(a > b) a else b ) println("Maximum number in (1,-5,10,3,9): " + max) } |
Output: Happy learning. Please leave a reply Read more
Hey there! Welcome to ClearUrDoubt.com. In this post, we will look at a Scala program to find the largest number in a given list of integers. Let’s look at the program:
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 |
package com.clearurdoubt.practice object FindMax extends App { def max(xs: List[Int]): Int = { @annotation.tailrec def max(xs: List[Int], maximum: Int) : Int = xs match { case Nil => throw new java.util.NoSuchElementException("Empty List") case x :: Nil => if(x > maximum) x else maximum case x :: y :: xs1 => if (x >= y) max(xs1, x) else max(xs1, y) } max(xs, Int.MinValue) } println("Max of List(1,-5,10,3,9) is : " + max(List(1,-5,10,3,9))) } |
Output: Happy learning. Please leave a reply in Read more
Hey there! Welcome to ClearUrDoubt.com. In this post, we will look at a Scala program to add or update entries in a Map. we can use “+” method on the map instance to add/update elements. If called this method with Read more
Hey there! Welcome to ClearUrDoubt.com. In this post, we will look at a Scala program to find the sum of the elements of an Int List. We can achieve this using foldLeft or reduceLeft methods. foldLeft() method accepts an initial Read more
Hey there! Welcome to ClearUrDoubt.com. In this post, we will look at a Scala program to remove an element from a list. We can use “take()” and “drop()” methods to achieve our objective. take(n): This method return first n elements Read more
Hey there! Welcome to ClearUrDoubt.com. In this post, we will look at a Scala program to print Fibonacci series using Tail Recursion. Fibonacci Series: Finding n’th element: f(n) = f(n-1) + f(n-2)
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 |
package com.clearurdoubt object Fibonacci extends App { def fibonacci(n: Int): Int = { def fibonacci(n: Int, a: Int, b: Int): Int = n match { case 0 => a case _ => print(a + " "); fibonacci(n-1, b, a+b) } fibonacci(n, 0, 1) } fibonacci(10) } |
Output: The inner function fibonacci() is a Read more
Hey there! Welcome to ClearUrDoubt.com. In this post, we will look at a Scala program to print Fibonacci series using simple Recursion. Fibonacci Series: Finding n’th element: f(n) = f(n-1) + f(n-2)
|
1 2 3 4 5 6 7 8 9 10 11 12 |
package com.clearurdoubt object Fibonacci extends App { def fibonacci(n: Int): List[Int] = { def fibonacci(a: Int, b: Int): LazyList[Int] = a #:: fibonacci(b, a+b) fibonacci(0,1).take(n).toList } fibonacci(10) } |
Output: Happy learning. Please leave a reply Read more