Skip to main content
Code Review

Return to Question

Tweeted twitter.com/StackCodeReview/status/1367127717087498244
Put the description of the programming challenge first.
Source Link
pacmaninbw ♦
pacmaninbw ♦
  • 24.8k
  • 11
  • 46
  • 109

The problem statement:

Alice is playing an arcade game and wants to climb to the top of the leaderboard and wants to track her ranking. The game uses Dense Ranking, so its leaderboard works like this:

  • The player with the highest score is ranked number 1 on the leaderboard.
  • Players who have equal scores receive the same ranking number, and the next player(s) receive the immediately following ranking number.

For example, the four players on the leaderboard have high scores of 100, 90, 90, and 80. Those players will have ranks 1, 2, 2, and 3, respectively. If Alice's scores are 70, 80 and 105, her rankings after each game are 4th, 3rd and 1st.

Function Description

Complete the climbingLeaderboard function in the editor below. It should return an integer array where each element res[j] represents Alice's rank after the jth game.

climbingLeaderboard has the following parameter(s):

scores: an array of integers that represent leaderboard scores alice: an array of integers that represent Alice's scores

Input Format

The first line contains an integer n, the number of players on the leaderboard. The next line contains n space-separated integers scores[i], the leaderboard scores in decreasing order. The next line contains an integer, m, denoting the number games Alice plays. The last line contains m space-separated integers alice[j], the game scores.

Constraints

  • 1 <= n <= 2 * 10^5
  • 1 <= m <= 2 * 10^5
  • 0 <= scores[i] <= 10^9 for 0 <= i < n
  • 0 <= alice[j] <= 10^9 for 0 <= j < m

The existing leaderboard, scores, is in descending order. Alice's scores, alice, are in ascending order.

Subtask

For 60% of the maximum score:

  • 1 <= n <= 200
  • 1 <= m <= 200

Output Format

Print m integers. The jth integer should indicate Alice's rank after playing the jth game.

My solution is failing to pass 4 test casesfailing to pass 4 test cases due to timeout. The code is as follows:

The problem statement:

Alice is playing an arcade game and wants to climb to the top of the leaderboard and wants to track her ranking. The game uses Dense Ranking, so its leaderboard works like this:

  • The player with the highest score is ranked number 1 on the leaderboard.
  • Players who have equal scores receive the same ranking number, and the next player(s) receive the immediately following ranking number.

For example, the four players on the leaderboard have high scores of 100, 90, 90, and 80. Those players will have ranks 1, 2, 2, and 3, respectively. If Alice's scores are 70, 80 and 105, her rankings after each game are 4th, 3rd and 1st.

Function Description

Complete the climbingLeaderboard function in the editor below. It should return an integer array where each element res[j] represents Alice's rank after the jth game.

climbingLeaderboard has the following parameter(s):

scores: an array of integers that represent leaderboard scores alice: an array of integers that represent Alice's scores

Input Format

The first line contains an integer n, the number of players on the leaderboard. The next line contains n space-separated integers scores[i], the leaderboard scores in decreasing order. The next line contains an integer, m, denoting the number games Alice plays. The last line contains m space-separated integers alice[j], the game scores.

Constraints

  • 1 <= n <= 2 * 10^5
  • 1 <= m <= 2 * 10^5
  • 0 <= scores[i] <= 10^9 for 0 <= i < n
  • 0 <= alice[j] <= 10^9 for 0 <= j < m

The existing leaderboard, scores, is in descending order. Alice's scores, alice, are in ascending order.

Subtask

For 60% of the maximum score:

  • 1 <= n <= 200
  • 1 <= m <= 200

Output Format

Print m integers. The jth integer should indicate Alice's rank after playing the jth game.

My solution is failing to pass 4 test cases due to timeout. The code is as follows:

The problem statement:

Alice is playing an arcade game and wants to climb to the top of the leaderboard and wants to track her ranking. The game uses Dense Ranking, so its leaderboard works like this:

  • The player with the highest score is ranked number 1 on the leaderboard.
  • Players who have equal scores receive the same ranking number, and the next player(s) receive the immediately following ranking number.

For example, the four players on the leaderboard have high scores of 100, 90, 90, and 80. Those players will have ranks 1, 2, 2, and 3, respectively. If Alice's scores are 70, 80 and 105, her rankings after each game are 4th, 3rd and 1st.

Function Description

Complete the climbingLeaderboard function in the editor below. It should return an integer array where each element res[j] represents Alice's rank after the jth game.

climbingLeaderboard has the following parameter(s):

scores: an array of integers that represent leaderboard scores alice: an array of integers that represent Alice's scores

Input Format

The first line contains an integer n, the number of players on the leaderboard. The next line contains n space-separated integers scores[i], the leaderboard scores in decreasing order. The next line contains an integer, m, denoting the number games Alice plays. The last line contains m space-separated integers alice[j], the game scores.

Constraints

  • 1 <= n <= 2 * 10^5
  • 1 <= m <= 2 * 10^5
  • 0 <= scores[i] <= 10^9 for 0 <= i < n
  • 0 <= alice[j] <= 10^9 for 0 <= j < m

The existing leaderboard, scores, is in descending order. Alice's scores, alice, are in ascending order.

Subtask

For 60% of the maximum score:

  • 1 <= n <= 200
  • 1 <= m <= 200

Output Format

Print m integers. The jth integer should indicate Alice's rank after playing the jth game.

The problem statement:

Alice is playing an arcade game and wants to climb to the top of the leaderboard and wants to track her ranking. The game uses Dense Ranking, so its leaderboard works like this:

  • The player with the highest score is ranked number 1 on the leaderboard.
  • Players who have equal scores receive the same ranking number, and the next player(s) receive the immediately following ranking number.

For example, the four players on the leaderboard have high scores of 100, 90, 90, and 80. Those players will have ranks 1, 2, 2, and 3, respectively. If Alice's scores are 70, 80 and 105, her rankings after each game are 4th, 3rd and 1st.

Function Description

Complete the climbingLeaderboard function in the editor below. It should return an integer array where each element res[j] represents Alice's rank after the jth game.

climbingLeaderboard has the following parameter(s):

scores: an array of integers that represent leaderboard scores alice: an array of integers that represent Alice's scores

Input Format

The first line contains an integer n, the number of players on the leaderboard. The next line contains n space-separated integers scores[i], the leaderboard scores in decreasing order. The next line contains an integer, m, denoting the number games Alice plays. The last line contains m space-separated integers alice[j], the game scores.

Constraints

  • 1 <= n <= 2 * 10^5
  • 1 <= m <= 2 * 10^5
  • 0 <= scores[i] <= 10^9 for 0 <= i < n
  • 0 <= alice[j] <= 10^9 for 0 <= j < m

The existing leaderboard, scores, is in descending order. Alice's scores, alice, are in ascending order.

Subtask

For 60% of the maximum score:

  • 1 <= n <= 200
  • 1 <= m <= 200

Output Format

Print m integers. The jth integer should indicate Alice's rank after playing the jth game.

My solution is failing to pass 4 test cases due to timeout. The code is as follows:

Added problem statement
Source Link
edit approved Jun 19, 2020 at 16:17
user
edit approved Jun 19, 2020 at 16:17
user
  • 529
  • 4
  • 17

The problem statement:

Alice is playing an arcade game and wants to climb to the top of the leaderboard and wants to track her ranking. The game uses Dense Ranking, so its leaderboard works like this:

  • The player with the highest score is ranked number 1 on the leaderboard.
  • Players who have equal scores receive the same ranking number, and the next player(s) receive the immediately following ranking number.

For example, the four players on the leaderboard have high scores of 100, 90, 90, and 80. Those players will have ranks 1, 2, 2, and 3, respectively. If Alice's scores are 70, 80 and 105, her rankings after each game are 4th, 3rd and 1st.

Function Description

Complete the climbingLeaderboard function in the editor below. It should return an integer array where each element res[j] represents Alice's rank after the jth game.

climbingLeaderboard has the following parameter(s):

scores: an array of integers that represent leaderboard scores alice: an array of integers that represent Alice's scores

Input Format

The first line contains an integer n, the number of players on the leaderboard. The next line contains n space-separated integers scores[i], the leaderboard scores in decreasing order. The next line contains an integer, m, denoting the number games Alice plays. The last line contains m space-separated integers alice[j], the game scores.

Constraints

  • 1 <= n <= 2 * 10^5
  • 1 <= m <= 2 * 10^5
  • 0 <= scores[i] <= 10^9 for 0 <= i < n
  • 0 <= alice[j] <= 10^9 for 0 <= j < m

The existing leaderboard, scores, is in descending order. Alice's scores, alice, are in ascending order.

Subtask

For 60% of the maximum score:

  • 1 <= n <= 200
  • 1 <= m <= 200

Output Format

Print m integers. The jth integer should indicate Alice's rank after playing the jth game.

The problem statement:

Alice is playing an arcade game and wants to climb to the top of the leaderboard and wants to track her ranking. The game uses Dense Ranking, so its leaderboard works like this:

  • The player with the highest score is ranked number 1 on the leaderboard.
  • Players who have equal scores receive the same ranking number, and the next player(s) receive the immediately following ranking number.

For example, the four players on the leaderboard have high scores of 100, 90, 90, and 80. Those players will have ranks 1, 2, 2, and 3, respectively. If Alice's scores are 70, 80 and 105, her rankings after each game are 4th, 3rd and 1st.

Function Description

Complete the climbingLeaderboard function in the editor below. It should return an integer array where each element res[j] represents Alice's rank after the jth game.

climbingLeaderboard has the following parameter(s):

scores: an array of integers that represent leaderboard scores alice: an array of integers that represent Alice's scores

Input Format

The first line contains an integer n, the number of players on the leaderboard. The next line contains n space-separated integers scores[i], the leaderboard scores in decreasing order. The next line contains an integer, m, denoting the number games Alice plays. The last line contains m space-separated integers alice[j], the game scores.

Constraints

  • 1 <= n <= 2 * 10^5
  • 1 <= m <= 2 * 10^5
  • 0 <= scores[i] <= 10^9 for 0 <= i < n
  • 0 <= alice[j] <= 10^9 for 0 <= j < m

The existing leaderboard, scores, is in descending order. Alice's scores, alice, are in ascending order.

Subtask

For 60% of the maximum score:

  • 1 <= n <= 200
  • 1 <= m <= 200

Output Format

Print m integers. The jth integer should indicate Alice's rank after playing the jth game.

Source Link
Mughees Asif
Mughees Asif
  • 79
  • 1
  • 6

Hackerrank problem: Climbing the Leaderboard (Java)

I am solving the following Hackerrank problem: Climbing the Leaderboard.

My solution is failing to pass 4 test cases due to timeout. The code is as follows:

 import java.util.*;
    
    public class Main {
        public static void main(String[] args) {

            Scanner scanner = new Scanner(System.in);

            int totalPlayers = scanner.nextInt();
            ArrayList<Integer> playerScores = new ArrayList<>();
            for(int i = 0; i < totalPlayers; i++) {
                playerScores.add(scanner.nextInt());
            }
    
            int aliceTotalScores = scanner.nextInt();
            ArrayList<Integer> aliceScores = new ArrayList<>();
            for(int i = 0; i < aliceTotalScores; i++) {
                aliceScores.add(scanner.nextInt());
            }
    
            List<Integer> finalScores = new ArrayList<>(playerScores);
            for(int i = 0; i < aliceTotalScores; i++) {
                finalScores.add(aliceScores.get(i));
                finalScores.sort(Collections.reverseOrder());
                Set<Integer> set = new LinkedHashSet<>(finalScores);
                finalScores.clear();
                finalScores.addAll(set);
                System.out.println(finalScores.indexOf(aliceScores.get(i)) + 1);
            }
        }
    }

Any suggestions on how to improve the solution or some general direction as to where I am making a mistake would be appreciated. Thanks in advance.