In this post, we will solve **Lambda Calculus – Reductions #1 HackerRank Solution**. This problem **(Lambda Calculus – Reductions #1)** is a part of **HackerRank Functional Programming** series.

**Task**

Reduce the following expression to no more than **one term**. If the expression cannot be reduced, enter “CAN’T REDUCE”.

`((λx.(x y))(λz.z))`

Your answer should look like:

`u`

(This is not the actual answer, just a demonstration of how you should present it.)

**Solution – Lambda Calculus – Reductions #1 – HackerRank Solution**

y

**Note: **This problem **(Lambda Calculus – Reductions #1)** is generated by **HackerRank** but the solution is provided by **CodingBroz**. This tutorial is only for **Educational** and **Learning** purpose.