Pergunta de entrevista da empresa ZestMoney

Find max sum of a subsequence in array such that adjacent elements don't need to be considered. There is a matrix composed of either "." or "#", we have to traverse through "." from top left cell to bottom right cell with minimum steps. the min steps cannot be more than k. We can move left, right, top, bottom in a step.