In this post, we will solve **Sum of Odd Elements HackerRank Solution**. This problem** (Sum of Odd Elements)** is a part of **HackerRank Functional Programming** language.

**Task**

You are given a list. Return the sum of odd elements from the given list. The input and output portions will be handled automatically. You need to write a function with the recommended method signature.

**Constraints**

- The list will have
**1 – 100**elements. - Each element will be an integer
where**X****-100 <=**.*X*<= 100

**Sample Input**

```
3
2
4
6
5
7
8
0
1
```

**Sample Output**

`16`

**Explanation**

Sum of odd elements is **3 + 5 + 7 + 1 = 16**

**Method Signature**

```
Number Of Parameters: 1
Parameters: [list]
Returns: Number
```

**For Hackers Using Clojure**

This will be the outline of your function body (fill in the blank portion marked by underscores):

`(fn[lst]___________________________)`

**For Hackers Using Scala**

This will be the outline of your function body (fill in the blank portion marked by underscores):

` def f(arr:List[Int]):Int = __________________`

**For Hackers Using Haskell**

This will be the outline of your function body (fill in the blank portion marked by underscores):

`f arr = ______________________`

**For Hackers Using other Languages**

You have to read input from standard input and write output to standard output. Please follow the input/output format mentioned above.

**NOTE**: You only need to submit the code above after filling in the blanks appropriately. The input and output section will be handled by us. The focus is on writing the correct function.

**Solution – Sum of Odd Elements – HackerRank Solution**

def f(arr: List[Int]): Int = arr.filter(_ % 2 != 0).sum

**Note:** This problem **(Sum of Odd Elements)** is generated by **HackerRank** but the solution is provided by **CodingBroz**. This tutorial is only for **Educational** and **Learning** purpose.