Status: 1st year, BSc. Electrical and Electronic Engineering Top 10 UK EEE uni
Position: STEP Intern at Google
Location: London, UK
Date: January 7, 2021

2 Google Meet virtual interviews on same day. 15 minutes apart.

Brief conversation at start to talk about how the interview is going to go and time for questions at the end

Interview 1:
In a string, find the longest substring between a and b. e.g ‘adrhyhbyhjb’ – answer is the whole string in this case.
Follow-up: What happens if the string is a circular linked list.

Interview 2
Given a string, return the first duplicate item in the string. Give a solution optimized for time and another optimized for space. Maybe one optimized for both.

For second interview, I was asked to consider a hashtable of type bool not int to conserve further space