How did you guys solve Construct Array [CARR]

[taran_1407]

Done.

CARR - Editorial

PROBLEM LINK: Practice Contest: Division 1 Contest: Division 2 Setter: Yusuf Kharodawala Tester: Teja Vardhan Reddy Editorialist: Taranpreet Singh DIFFICULTY: Easy-Medium PREREQUISITES: Dynamic Programming, Matrix Exponentiation. PROBLEM: Count the number of N length arrays such that all elements lie in the range [1, M] and no three consecutive elements are equal. QUICK EXPLANATION We can count the number of i length sequences such that last two elements are different, denoted by f(i, …