Chef and GirlFriend - Beautiful Array's definition in Beginner Challenges Contest

In Beginner Challenges’s last problem Chef and GirlFriend(CHEF1005) : the Beautiful Array is defined as " An array is beautiful if the sum of | arr[i] - arr[i-1] | among 0<i<n is minimal.
Problem Link :
Contest Link :
P.S- I am a general user not linked with the organisers, I solved the question ago in HackerRank.
That’s why I am posting this for other user’s help . THANKS !!!

Most of the problem is copied. This question is from HackeRank. The problem is named “Lily’s Homework”. The link is below:

Yup !!!

It should have mentioned the definition of “beautiful array”.

1 Like

should have mentioned the definition of “unique natural numbers” as well in problem no. 4

The problems are copied.
Chef and Ice Cream: Check for pair… (GFG)
Chef and Loss: Minimum Loss (Hackerrank)
Chef and Power: Count ways… (GFG)
Chef and Missing Numbers: Find elements… (GFG)
Chef and Girlfriend: Lily’s Homework (Hackerrank)