it was a good experience overall. I learn so many things and I will implement this in next interview. Longest Alternating Subsequence: DP[i][0] = LAS ending at index i and last element greater than its previous element; DP[i][1] = LAS ending at index i and last element smaller than previous element.

There was an initial competitive coding round. The coding round was moderate and doable. The next step was a technical interview. The interviewer was very friendly and open. This helped me be more calm and focus in the interview. In the interview I had to solve two coding questions and the way of assessing was by evaluating how we approach problems and if we are able to arrive at a good solution. I did not make it past the technical interview but there was a HR round as well