I applied through college or university. The process took 4 weeks.

Obviously , first started with the self intro then the interviewer briefly asked about my projects and my resume and some data structures questions. Then asked me to code a DSA problem.

Assume you are the manager of a simulation world, where it’s raining. Each raindrop occupies one tile in an N x N matrix. If a drop has adjacent neighbors (only via edges), it merges to form a puddle.

You're given a stream of drop placements and later, queries asking whether two drops belong to the same puddle.” Part 1: You had to maintain the matrix state and dynamically manage merging puddles. Like how to define where rain drops are falling on which tile I approached it using a DFS traversal — tracked drops and grouped puddles recursively. While this solved the basic problem What they expected: A Disjoint Set Union solution — precisely the kind of efficient structure needed for dynamic connectivity checks.