Skip to content

Latest commit

 

History

History
12 lines (9 loc) · 328 Bytes

File metadata and controls

12 lines (9 loc) · 328 Bytes

Problem 2: Dominant Occurrences

Problem Statement

Given an integer array nums and an integer k, return the k most frequent elements. You may return the answer in any order.

Input Format

  • An array of integers nums.
  • An integer k.

Example

Input: nums = [1, 1, 1, 2, 2, 3], k = 2
Output: [1, 2]