Taro Logo

Junior Software Engineer Interview Experience - Israel

October 9, 2024
Neutral ExperienceNo Offer

Process

It was Wix Kickstart 24 recruitment for junior developers. We were about 200 people who were sat in a classroom and did a LeetCode style exam containing 4 questions. We had 2 hours to solve them.

Questions

Minimum time takes to reach destination without drowning:

You are given an n * m 0-indexed grid of string land. Right now, you are standing at the cell that contains "S", and you want to get to the cell containing "D". There are three other types of cells in this land:

".": These cells are empty. "X": These cells are stone. "*": These cells are flooded. At each second, you can move to a cell that shares a side with your current cell (if it exists). Also, at each second, every empty cell that shares a side with a flooded cell becomes flooded as well. There are two problems ahead of your journey:

You can't step on stone cells. You can't step on flooded cells since you will drown (also, you can't step on a cell that will be flooded at the same time as you step on it). Return the minimum time it takes you to reach the destination in seconds, or -1 if it is impossible.

Note that the destination will never be flooded.

Example 1:

Input: land = [["D",".","*"],[পূ,পূ,পূ],[পূ,"S",পূ]] Output: 3 Explanation: The picture below shows the simulation of the land second by second. The blue cells are flooded, and the gray cells are stone. Picture (0) shows the initial state and picture (3) shows the final state when we reach destination. As you see, it takes us 3 second to reach destination and the answer would be 3. It can be shown that 3 is the minimum time needed to reach from S to D.

Example 2:

Input: land = [["D","X","*"],[পূ,পূ,পূ],[পূ,পূ,"S"]] Output: -1 Explanation: The picture below shows the simulation of the land second by second. The blue cells are flooded, and the gray cells are stone. Picture (0) shows the initial state. As you see, no matter which paths we choose, we will drown at the 3rd second. Also the minimum path takes us 4 seconds to reach from S to D. So the answer would be -1.

Example 3:

Input: land = [["D",".",".",".","*","."],[পূ,"X",পূ,"X",পূ,পূ],[পূ,পূ,পূ,পূ,"S",পূ]] Output: 6 Explanation: It can be shown that we can reach destination in 6 seconds. Also it can be shown that 6 is the minimum seconds one need to reach from S to D.

Constraints:

2 <= n, m <= 100 Land consists only of "S", "D", ".", "*" and "X". Exactly one of the cells is equal to "S". Exactly one of the cells is equal to "D".

Was this helpful?

Interview Statistics

The following metrics were computed from 5 interview experiences for the Wix Junior Software Engineer role in Israel.

Success Rate

20%
Pass Rate

Wix's interview process for their Junior Software Engineer roles in Israel is very selective, failing most engineers who go through it.

Experience Rating

Positive20%
Neutral80%
Negative0%

Candidates reported having good feelings for Wix's Junior Software Engineer interview process in Israel.

Wix Work Experiences