GoLang Solution For LeetCode Problem: Top K Frequent Elements
Solving Top K Frequent Elements in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Given a non-empty array of integers, return the k most frequent elements.
Input: nums = [1,1,1,2,2,3], k = 2 Output: [1,2]
Input: nums = , k = 1 Output: 
- Your algorithm's time complexity must be better than O(n log n), where n is the array's size.
See the full details of the problem Top K Frequent Elements at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go