Explain foldRight with code.
foldRight folds components from the right to the left; it works similarly to foldLeft.
val list = List(1, 2, 3, 4, 5)
val sum = list.foldRight(0)((elem, acc) => elem + acc)
println(sum) // Output: 15
Here, foldRight adds each item in the list to an initial value of 0, but in the opposite order.
Output
What are Folding Lists in Scala?
A basic operation in functional programming, which includes Scala, is folding lists. It enables you to use a binary operation to merge the components of a collection. This operation applies the action to each member of the collection iteratively, building up a result from the original value.
Table of Content
- 1. What is a folding list in Scala?
- 2. Explain foldLeft along with code.
- 3. Explain foldRight with code.
- 4. Explain fold.
- 5. Explain the Difference using Parallelism and Method Signature.
- 6. Conclusion
- 7. FAQs