I had two interviews, both LeetCode style. Usually, Google asks graph or tree questions, but I was given an array with Kadane's algorithm and a string parsing question. The interviewers were very nice, and it felt more like a collaboration than an interview. I wasn't able to code up the optimal solution, but was able to conceptually talk about it.

Given an array of integers, find the maximum sum of the integers between two indices where the indices have the same value.