Leetcode 347: Find k most frequent numbers in the array - C# solution

July 28, 2016

Find k most frequent numbers in the array

Problem:

  // nums = [5, 3, 1, 1, 1, 3, 73, 1]

  // k = 1

  // return [1]

  // k = 2

  // return [1, 3]

  // k = 3

  // return [1, 3, 5]

 C# solution using Dictionary<int,int> and language Integrate Query (LINQ):

First, go through the array once, and keep the count for every distinct value:

We can use Language Integrated Query (LINQ) to call order by and then get Top k values.

Write a solution using C# first, post code here.

1. First practice, using LINQ, OrderByDescending, Take

https://gist.github.com/jianminchen/1941a6b82525feefe15a2c477e0a0a0b

LINQ reference:

http://stackoverflow.com/questions/5344805/linq-orderby-descending-query

http://stackoverflow.com/questions/192203/whats-the-linq-to-sql-equivalent-to-top-or-limit-offset

Actionable Item:

Write one solution using bucket sort to get k most frequent numbers in the array.