Tesla·Software Engineer·Onsite - Coding / Algorithms
Jul 2026
Tesla SWE coding round, one graph problem the whole time. Not the hardest interview I've done but I definitely fumbled my way through the BFS part before it clicked.
- You have an n x n grid of 0s and 1s representing water and land. The grid contains exactly two islands. Find the minimum number of water cells you need to convert to land to connect the two islands.
“Took me a minute to even figure out how to separate the two islands first.”