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,890 questions

51,821 answers

573 users

How to find K most frequent elements in an unsorted array with Scala

1 Answer

0 votes
import scala.collection.mutable

def printKMostFrequentNumbers(arr: Array[Int], K: Int): Unit = {
  val mp = mutable.Map[Int, Int]()
  
  for (num <- arr) {
    mp(num) = mp.getOrElse(num, 0) + 1
  }
  
  val sortedMap = mp.toSeq.sortBy(-_._2)
  
  for (i <- 0 until K) {
    println(sortedMap(i)._1)
  }
}

val arr = Array(4, 5, 19, 50, 5, 19, 5, 8, 19, 3, 3, 6, 3, 27, 19, 3, 3)
val K = 2

printKMostFrequentNumbers(arr, K)

 
 
 
/*
run:
   
3
19
 
*/

 



answered Nov 29, 2024 by avibootz
edited Nov 29, 2024 by avibootz

Related questions

...