You are given an array, ratings, where ratings[i] represents the rating of the i-th child standing in a line. Your task is to distribute candies to each child based on the following rules:

1. Every child must receive at least one candy.

2. Children with a higher rating get more candies than their neighbors.

Determine the minimum total number of candies you must distribute to satisfy the above conditions.

Constraints:

• $1 \leq$ ratings.length $\leq 1000$

• $0 \leq$ ratings[i] $\leq 1000$

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding on how to solve this problem.

Implement your solution in the following coding playground.