Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

39,844 questions

51,765 answers

573 users

How to find the length of the longest consecutive sequence of an unsorted vector of integers in Rust

1 Answer

0 votes
use std::collections::HashSet;

fn longest_consecutive(nums: Vec<i32>) -> i32 {
    let num_set: HashSet<i32> = nums.into_iter().collect();
    let mut longest_streak = 0;

    for &num in &num_set {
        // Check if it's the start of a sequence
        if !num_set.contains(&(num - 1)) {
            let mut current_num = num;
            let mut current_streak = 1;

            // Count the length of the sequence
            while num_set.contains(&(current_num + 1)) {
                current_num += 1;
                current_streak += 1;
            }

            longest_streak = longest_streak.max(current_streak);
        }
    }

    longest_streak
}

fn main() {
    let nums = vec![680, 4, 590, 3, 1, 2];
    
    println!("Longest consecutive sequence length: {}", longest_consecutive(nums));
}




/*
run:

Longest consecutive sequence length: 4

*/
  

 



answered Aug 19, 2025 by avibootz
...