Hi,
I received this question in a hackerrank OA Assessment by Path AI. How does one approach such a problem? How does someone reach a level of solving this problem. I believe the question is related to dynamic programming (and obviously sliding windows) and maybe close to EditDistance question on leetcode. However, I wasnt sure of the recurrence relation and how to find the minimum number of changes in each channel. Can someone guide me to solve this question and even further questions.