Introduction Q1: Given an m x n grid (pixels) where each index represents a color, change all connected pixels from the source point to a new color. (Basically, paint the grid 🎨) Q2: Given two sorted arrays, find the median. Follow-up: Can you do it in O(log(m+n))? 😲 And then came the curveballs: Q1: Tell me about a major success that isn’t in your resume. Q2: Explain any interesting project not mentioned in your resume. Duration : 1 hr