was given these two questions: https://leetcode.com/discuss/interview-question/1586927/Google-or-OA/1155548

Both passed all test cases.

First one: solved in O(n^2) was really hard

Second one: just used pointers to traverse the string. O(n) time

Hope that helped. waiting to hear back now.