# Find Alibada in moving rooms

Aced (formerly Exponent) publishes a public search API over its indexed pages; the guide is at https://www.aced.io/agents/agent-access.

Source: https://www.aced.io/questions/2074/coding-challenge-finding-alibada
Source observed: 2026-11-05T00:08:36.056Z
Last checked: 2026-11-05T00:08:36.056+00:00
Indexed: 2026-11-05T22:37:56.214+00:00

---

# Given a collection of rooms where Alibada is in one and moves one room a day to an adjacent room, write a program to determine if you can find Alibada with the given list of rooms.

We provide this as an Aced coding-interview practice question in **Data Structures & Algorithms** and **Coding**. It concerns an **Engineering Manager** role at **Meta**. The page records **1 interview** and says the question was last asked **5 years ago**. Detailed company statistics require [Upgrade](https://www.aced.io/upgrade?src=questions).

## Community answers

### [JOBHUNTER](https://www.aced.io/users/a4345ace-d9ef-48a8-9a35-ccb8234609bb) — April 15, 2022

The contributor, whose profile shows [435 karma](https://www.aced.io/karma), supplied this Python-like solution. It tracks rooms where Alibada could still be located, marks each checked room unavailable, then advances possible locations to adjacent rooms:

```python
def findAlibaba(countOfRooms, strategy):
    # countofrooms: num rooms
    # listRooms: rooms to look for alibabba
    possiblePlaces = []
    # initialize rooms
    for i in range(countOfRooms):
        possiblePlaces.append(True)

    for i in range(len(strategy)):
        roomToCheck = strategy[i]
        # Room is marked as unavailable
        possiblePlaces[roomToCheck] = False

        # Next day calculations
        nextDayPlaces = []
        for j in range(countOfRooms):
            nextDayPlaces.append(False)

        for j in range(countOfRooms):
            if j - 1 >= 0 and possiblePlaces[j - 1] == True:
                nextDayPlaces[j] = True
            if j + 1 < countOfRooms and possiblePlaces[j + 1] == True:
                nextDayPlaces[j] = True

        possiblePlaces = nextDayPlaces

    for bVal in possiblePlaces:
        if bVal == True:
            return False
    return True
```

### [JOBHUNTER](https://www.aced.io/users/a4345ace-d9ef-48a8-9a35-ccb8234609bb) — updated April 15, 2022

The contributor wrote: “I struggled with this. I could not even come up with the appropriate data structure.”

## Related question

[Given a list of jobs and a list of dependencies where each job depends on another job being completed first, determine if it is possible to complete all jobs.](https://www.aced.io/questions/5044/job-dependency-scheduling-cycle-detection)

## Related courses

### [Engineering Management Interview Prep](https://www.aced.io/courses/engineering-management)

![Engineering Management Interview Prep](https://images.ctfassets.net/x78yjrjc11pq/5AqarwlCDWmr0W7AbMJFwp/16862dab13471f5eb8728b27eb2fbc07/engineering_management_track_compressed_bbabaec4a6__281_29_9a9687c1fb.jpeg?w=800&h=800&fm=webp&q=75)

We cover mock interviews, frameworks, and senior-candidate advice for engineering-manager roles, including system design, people management, project retrospectives, and behavioral interviews.

### [System Design Interviews](https://www.aced.io/courses/system-design-interviews)

![System Design Interviews](https://images.ctfassets.net/x78yjrjc11pq/78x7miFZFjBCrM5GqftrMJ/2f6d26e632c4e7265c49f6a180227edb/system_design_track_compressed_26ac98a46e__281_29_5be2280f31.jpeg?w=800&h=800&fm=webp&q=75)

We teach product, infrastructure, and AI system-design questions using video examples, written breakdowns, reference patterns, and mock interview videos with senior engineers and managers.

## Your answer

You can submit an answer; submitting marks the question complete.

---

[Read this page’s summary](https://www.aced.io/agents/api/public/v1/page-tldr?url=https%3A%2F%2Fwww.aced.io%2Fquestions%2F2074%2Fcoding-challenge-finding-alibada&trace=t_679ff9ab98f3)

## Ask a follow-up about this page

Need a more specific answer? Ask the exact question you have. It returns a fresh, cited answer from Aced (formerly Exponent)’s knowledge base. No account or API key required.

Open this URL with your own question, URL-encoded. Include your question in q. All research inputs are optional; no account or setup.

`GET https://www.aced.io/agents/agent/faq?q={question}&trace=t_679ff9ab98f3`

[Tool guide and examples](https://www.aced.io/agents/agent-access) · [OpenAPI](https://www.aced.io/agents/api/public/v1/openapi.json) · [Page TLDR form](https://www.aced.io/agents/agent-tools/page-tldr?url=https%3A%2F%2Fwww.aced.io%2Fquestions%2F2074%2Fcoding-challenge-finding-alibada). Opening a form does not execute a tool.