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 array of integers in Scala

1 Answer

0 votes
def longestConsecutive(nums: Array[Int]): Int = {
  val numSet = nums.toSet
  var longestStreak = 0

  for (num <- numSet) {
    if (!numSet.contains(num - 1)) {
      var currentNum = num
      var currentStreak = 1

      while (numSet.contains(currentNum + 1)) {
        currentNum += 1
        currentStreak += 1
      }

      longestStreak = math.max(longestStreak, currentStreak)
    }
  }

  longestStreak
}

val nums = Array(680, 4, 590, 3, 1, 2)

println("Longest consecutive sequence length: " + longestConsecutive(nums))  
 


 
/*
run:
  
Longest consecutive sequence length: 4
  
*/

 



answered Aug 19, 2025 by avibootz
...