Available question text
Given initial marble positions, apply each move that relocates all marbles at position moveFrom[i] to moveTo[i], and return the sorted list of occupied positions after all moves. The key is efficiently tracking unique occupied positions through up to 1e5 moves with coordinates up to 1e9.
Related questions
Continue with questions that share topics or the same question type.
- Put Marbles in Bags
Coding · Array · Greedy · Heap (Priority Queue)
- 0/1 Knapsack Problem with Time Complexity Optimization
Coding
- 01 Matrix
Coding
- 1 leetcode hard complex dp questions
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
Servicetitan
Leetcode 2766. Relocate Marbles
Reported Dec 5, 2025 · 1 source report
STAFF
Source snapshot: Nov 12, 2026
View source