**Coding**\n- Jump Game 1 and then Jump Game 2: https://leetcode.com/problems/jump-game-ii/\nFollow up - Does the solution change if we have negative numbers\n\n- Given a number and intervals, find all intervals having that number effectively. Imagine the method is being called thousands of times.\nLet\'s say we want to create a simplified version of Google Search. Here, we have many fixed intervals and we want to be able to quickly find all intervals containing a number.\nFollow up: What if new intervals can be added over the time.\n- Topological Sort similar to Course Schedule 2: https://leetcode.com/problems/course-schedule-ii/\n\n**System Design**\n- Design Google Maps\n\nL5\nYOE: 10\nLOC: US

Coding\n- Jump Game 1 and then Jump Game 2: https://leetcode.com/problems/jump-game-ii/\nFollow up - Does the solution change if we have negative numbers\n\n- G