FastPrep
Problem · Hash Table

Top-K KOLs by Total Likes

Learn this problem
● EasyTiktok logoTiktokFULLTIMEONSITE INTERVIEW
See Tiktok hiring insights

Problem statement

You are given a sequence of like events. The i-th event contributes likeCounts[i] likes to creator kolIds[i].

Aggregate total likes per creator, then return the top k creators sorted by total likes descending. Break ties by creator ID ascending.

Return each ranked result as a single string formatted "creator totalLikes".

Function

topKKolsByLikes(kolIds: String[], likeCounts: int[], k: int) → String[]

Complete the function topKKolsByLikes in the editor below.

topKKolsByLikes has the following parameters:

  1. String[] kolIds: creator identifiers
  2. int[] likeCounts: likes contributed by each event
  3. int k: the number of creators to return

Returns

String[]: the top k ranked creator totals.

Examples

Example 1

kolIds = ["A", "B", "A", "C", "B", "D"]likeCounts = [1, 5, 3, 2, 1, 10]k = 2return = ["D 10", "B 6"]

D has the highest total likes, followed by B.

Example 2

kolIds = ["ann", "bob", "ann", "bob"]likeCounts = [2, 1, 1, 2]k = 2return = ["ann 3", "bob 3"]

Both creators tie at 3 total likes, so ID order breaks the tie.

Constraints

  • 1 <= kolIds.length == likeCounts.length <= 2 * 10^5
  • 1 <= k <= the number of distinct creators
  • 0 <= likeCounts[i] <= 10^9

More Tiktok problems

drafts saved locally
public String[] topKKolsByLikes(String[] kolIds, int[] likeCounts, int k) {
    // write your code here
}
kolIds["A", "B", "A", "C", "B", "D"]
likeCounts[1, 5, 3, 2, 1, 10]
k2
expected["D 10", "B 6"]
checking account