Available question text
Given n rooms and parity-driven movement rules determined by nextVisit, find the earliest day when every room has been visited (answer mod 1e9+7). The core challenge is to avoid slow simulation for n up to 1e5 by deriving and computing an efficient DP/recurrence that yields the first-visit day for each room under the parity-based transitions.
Related questions
Continue with questions that share topics or the same question type.
- Last Day Where You Can Still Cross
Coding
- Solve this impossible leetcode hard problem that involves figuring out an alogrithms that can crack any RSA encryption in O(1) time.
All jokes aside, it was a question about topological sorting. You have to find manager and employees given a list of their names and ids and print them out in a pyramid sideway pyramid.
Coding
- The first was leetcode Set Matrix Zeroes.
The LeetCode problem Set Matrix Zeroes is a classic 2D array manipulation problem. The description is as follows:
You are given an
𝑚
×
𝑛
m×n matrix of integers. If any element is 0, you must set its entire row and column to 0. In other words, for each cell that contains 0, all cells in the same row and column should be changed to 0.
Coding
- Build Array Where You Can Find The Maximum Exactly K Comparisons
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1997. First Day Where You Have Been in All the Rooms
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source