Skip to main content
Back to problems
#1228
Easy Algorithms

Missing number in arithmetic progression

Array Math
52.2% acceptance
Mar 31, 2026
330
45

No description available.

Solution

Rust
Time O(n)
Space O(1)
LeetCode
solution.rs
impl Solution {
  pub fn missing_number(arr: Vec<i32>) -> i32 {
    let n = arr.len();
    let diff = (arr[n - 1] - arr[0]) / n as i32;
    if diff == 0 { return arr[0]; }
    for i in 1..n {
      if arr[i] - arr[i - 1] != diff {
        return arr[i - 1] + diff;
      }
    }
    arr[0]
  }
}