Q. Peeking Iterator Implementation in Java (this was first round over phone with screen sharing) Onsite: First Round (by Hiring Manager): Q1: Design a Google Map kind of application, since this role was for Apple Maps team, lot of grilling on design and approach Second Round: Q1 : Write an algo to find one of local min. Ex : { 0, 1, 5, -1, 6} - this can have local min as 0 or -1, Local min is one which has right and left elements lower than current element. In case of 0, since right doesn't exists look at only left. Q2 : Design a service to shorten URL like google does. Third Round: Q1: Write an algo for Fibonnacci Q2: Design an Elevator System, lot of grilling on design approach and consideration/assumptions. Fourth Round: Q1: Design Web Service for finding shortest route Q2: Design Web service to find all positions in x radius of the given location.
