Breaking News: Grepper is joining You.com. Read the official announcement!

DIY: Top K Frequent Elements

Sumit Rawal answered on September 17, 2023 Popularity 8/10 Helpfulness 1/10

answer DIY: Top K Frequent Elements

DIY: Top K Frequent Elements

Comment

import scala.collection.mutable

object TopKFrequentElements {

  def topKFrequent(nums: Array[Int], k: Int): List[Int] = {
    // Step 1: Create a frequency map
    val freqMap = nums.groupBy(identity).mapValues(_.length)

    // Step 2: Use a priority queue to keep track of top K frequent elements
    // The priority queue will be based on the frequency of elements
    val pq = mutable.PriorityQueue[(Int, Int)]()(Ordering.by(_._2))

    // Step 3: Iterate over the frequency map
    for ((num, freq) <- freqMap) {
      pq.enqueue((num, freq))
      if (pq.size > k) pq.dequeue()
    }

    // Step 4: Extract the top K frequent elements from the priority queue
    pq.map(_._1).toList
  }

  def main(args: Array[String]): Unit = {
    val nums = Array(1, 1, 1, 2, 2, 3)
    val k = 2
    println(s"Top $k frequent elements: ${topKFrequent(nums, k)}")  // Expected output: List(1, 2)
  }
}

Popularity 8/10 Helpfulness 1/10 Language scala

Source: chat.openai.com

Tags: elements k scala

Link to this answer
Share Copy Link

Contributed on Sep 17 2023

Sumit Rawal

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

DIY: Top K Frequent Elements

Contents

More Related Answers

DIY: Top K Frequent Elements

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.