Google Software Engineer II interview questions

Round 1 (Problem Solving): Given two list of strings, find the set of strings from the 2nd list which are a trans-addition of strings from the 1st list. Round 2 (Problem Solving): Given a matrix of size N x M, find the number of paths to go from the bottom left to the bottom right corner of the matrix. You can only move in three directions: diagonally upward right, right, and diagonally downward right. Round 3 (Problem Solving): Given an Android app with a list of APKs and the Android version it supports, partition all the android versions based on the unique set of APKs. Round 4 (Googliness): A cultural fitment with basic behavioural questions based on your work expectations, leadership abilities, etc.

Typical algorithm questions of the kind you can find in most interview prep resources. Not terribly difficult, but I was in a hurry and only had a few weeks to prepare.