Pergunta de entrevista da empresa Microsoft

First Round- 1. Rotate the array k times and return it. 2. Subsequence sum in linked list equal to k. Round 2- 1. Least Common Ancestor