Eddington Distance
Asked at Liftoff · Coding Questions · Difficulty: Medium · Last asked Jul 15, 2026
Given an array `A` where `A[i]` is the distance traveled on day `i` (non-negative integers), the **Eddington number E** is the largest integer `E` such that there are at least `E` days with distance `>= E`.
Loading the problem…
More Liftoff interview questions
- Terminal Tetris (No UI Required)
- LinkedIn Connection (Degrees of Separation)
- IPv6 Parser (Expand/Normalize/Validate)
- Encode and Decode Strings
- Run-Length Encoding (RLE) Encode/Decode with Max Run Length K; Minimize Encoding Length
- Print Matrix in Spiral Order