Taro Logo

Software Engineer Interview Experience - Tel Aviv-Yafo, Israel

January 1, 2026
Negative ExperienceNo Offer

Process

I did not have a positive experience with the interview process.I was initially approached by the company through a referral, after which a company recruiter contacted me. We had a brief phone conversation, but she did not provide any meaningful information about the company, the product, or the role itself.Later, I was invited to the office for a two-stage interview process. The first stage was a technical interview focused on LeetCode-style questions, and the second stage—conditional on passing the first—was a system design interview.Regarding the first stage: it began with a short introduction where everyone briefly introduced themselves. Then I was asked a technical question. After that, I was sent on a break. About 10 minutes later, I was called back and informed whether I would proceed to the second stage or that I had not passed. This was a very odd and unpleasant process.

Questions

Design a data structure to manage a fixed-size pool of memory slots (indices 0 to N-1). You need to implement two functions:1. getSlot(): Returns a unique available slot index.2. releaseSlot(index): Frees the slot back to the pool so it can be reused.Follow-up the space complexity. Can you do this without using O(N) extra space for a stack or queue?Answer / Solution DescriptionI discussed two approaches to this problem:1. The Naive Approach (Stack)My initial solution was to use a Stack to hold all available indices.• Logic: Initialize a stack with all integers from 0 to N-1. getSlot pops from the stack, and releaseSlot pushes back onto it.• Time Complexity: O(1) for both operations.• Space Complexity: O(N).

This is suboptimal because we are allocating a separate data structure just to track the indices.2. The Optimal Approach (Implicit Linked List / Free List)To optimize space, I proposed using the empty slots themselves to form a linked list. Since the memory slots are essentially an array, we can use the value at array[i] to point to the next available slot.• Logic:• Initialize the array such that index[i] stores i + 1.

The last index stores a null/terminator value.• Maintain a variable head pointing to the first available slot.• To Allocate: Return the current head and move the head pointer to the value stored in that slot (the next link).• To Free: When an index comes back, update that slot to point to the current head, then update head to be the newly freed index.• Time Complexity: O(1) for both operations.• Space Complexity: O(1) auxiliary space (we only need the head variable; the list structure lives inside the unused memory).

Was this helpful?

Interview Statistics

The following metrics were computed from 1 interview experience for the Zenity Software Engineer role in Tel Aviv-Yafo, Israel.

Success Rate

0%
Pass Rate

Zenity's interview process for their Software Engineer roles in Tel Aviv-Yafo, Israel is extremely selective, failing the vast majority of engineers.

Experience Rating

Positive0%
Neutral0%
Negative100%

Candidates reported having very negative feelings for Zenity's Software Engineer interview process in Tel Aviv-Yafo, Israel.

Zenity Work Experiences