Package g2501_2600.s2512_reward_top_k_students

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    2512 - Reward Top K Students.

    Medium

    You are given two string arrays positive_feedback and negative_feedback, containing the words denoting positive and negative feedback, respectively. Note that no word is both positive and negative.

    Initially every student has 0 points. Each positive word in a feedback report increases the points of a student by 3, whereas each negative word decreases the points by 1.

    You are given n feedback reports, represented by a 0-indexed string array report and a 0-indexed integer array student_id, where student_id[i] represents the ID of the student who has received the feedback report report[i]. The ID of each student is unique.

    Given an integer k, return the top k students after ranking them in non-increasing order by their points. In case more than one student has the same points, the one with the lower ID ranks higher.

    Example 1:

    Input: positive\_feedback = "smart","brilliant","studious", negative\_feedback = "not", report = "this student is studious","the student is smart", student\_id = 1,2, k = 2

    Output: 1,2

    Explanation: Both the students have 1 positive feedback and 3 points but since student 1 has a lower ID he ranks higher.

    Example 2:

    Input: positive\_feedback = "smart","brilliant","studious", negative\_feedback = "not", report = "this student is not studious","the student is smart", student\_id = 1,2, k = 2

    Output: 2,1

    Explanation:

    • The student with ID 1 has 1 positive feedback and 1 negative feedback, so he has 3-1=2 points.

    • The student with ID 2 has 1 positive feedback, so he has 3 points. Since student 2 has more points, 2,1 is returned.

    Constraints:

    • <code>1 <= positive_feedback.length, negative_feedback.length <= 10<sup>4</sup></code>

    • 1 &lt;= positive_feedback[i].length, negative_feedback[j].length &lt;= 100

    • Both positive_feedback[i] and negative_feedback[j] consists of lowercase English letters.

    • No word is present in both positive_feedback and negative_feedback.

    • n == report.length == student_id.length

    • <code>1 <= n <= 10<sup>4</sup></code>

    • report[i] consists of lowercase English letters and spaces ' '.

    • There is a single space between consecutive words of report[i].

    • 1 &lt;= report[i].length &lt;= 100

    • <code>1 <= student_idi<= 10<sup>9</sup></code>

    • All the values of student_id[i] are unique.

    • 1 &lt;= k &lt;= n

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description