Bad experience. It takes a long time for things to move.

Then I got a home test that went very well. I passed all the tests, and in the end, they decided not to continue.

There is a board with N cells (numbered from 0 to N-1) arranged in a row. The board is described by an array points and a string tokens, both of length N. The K-th letter of the string tokens is either 'T' or 'E', indicating whether the K-th cell contains a token or is empty.

If the K-th cell contains a token, you score the number of points equal to points[K]. Additionally, you score another point for every pair of adjacent tokens. What is the total number of points you score?