Zynga | SSE1 | DSA
Summary
I had my first Data Structures and Algorithms round for a Senior Software Engineer 1 position at Zynga after applying on Instahyre, where I was asked two specific LeetCode problems.
Full Experience
Hi all,
YOE : 6 years Applied on instahyre
I got contacted by recruiter after that had my first DSA round. I'll update this discussion as/if I move forward.
Round 1: 221. Maximal Square 1293. Shortest path in a grid with obstacle elimination
Interview Questions (2)
Maximal Square
Given a binary matrix filled with 0's and 1's, find the largest square containing only 1's and return its area.
Shortest Path in a Grid with Obstacle Elimination
You are given an m x n grid where each cell is either 0 (empty) or 1 (obstacle). In one step, you can move up, down, left, or right from your current cell. You can eliminate at most k obstacles. Return the minimum number of steps to walk from (0, 0) to (m - 1, n - 1). If it is impossible to find such a path, return -1.