Climbing the Leaderboard, by HackerRank

-
Problem in question in this one: https://www.hackerrank.com/challenges/climbing-the-leaderboard. I won't copy/paste it here since it is too long, but it is clear that the problem statement, and constraints, are leading the algorithm towards a straightforward binary search approach. Code is below, cheers!!!



using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
class Solution
{

     static void Main(String[] args)
    {
        int n = Convert.ToInt32(Console.ReadLine());
        string[] scores_temp = Console.ReadLine().Split(' ');
        int[] scores = Array.ConvertAll(scores_temp, Int32.Parse);
        int m = Convert.ToInt32(Console.ReadLine());
        string[] alice_temp = Console.ReadLine().Split(' ');
        int[] alice = Array.ConvertAll(alice_temp, Int32.Parse);

         int[] rank = new int[n];
        rank[0] = 1;
        for (int i = 1; i < n; i++)
            if (scores[i] == scores[i - 1]) rank[i] = rank[i - 1];
            else rank[i] = rank[i - 1] + 1;

         for (int i = 0; i < m; i++)
        {
            int index = BinarySearch(scores, alice[i]);
            if (alice[i] >= scores[index]) Console.WriteLine(rank[index]);
            else Console.WriteLine(rank[index] + 1);
        }

     }

     static int BinarySearch(int[] scores, int aliceValue)
    {
        int left = 0;
        int right = scores.Length - 1;

         while (left < right)
        {
            int middle = (left + right) / 2;
            if (scores[middle] == aliceValue) return middle;
            else if (scores[middle] < aliceValue) right = middle - 1;
            else left = middle + 1;
        }

         return left;
    }
}

Comments

  1. TarasApril 2, 2017 at 11:18 PM

    very nice! I used a built-in C++ lower_bound with reversed iterators, but your custom BinarySearch function makes implement even nicer. Way to go!

    ReplyDelete
    Replies
    1. UnknownMay 20, 2020 at 10:52 AM

      how would you do that ? would you mind posting that segment ?

      Delete
  2. masatosanSeptember 5, 2018 at 12:27 PM

    This would only work if same score from Scores exists in Alice's score, otherwise binary search would return last index of scores and return incorrect rank.
    For instance:
    Consider scoreboard [100, 100, 90, 80] and Alice's score [95]
    Then her rank should be 2. But since binary search can't find value 95 from the scoreboard it would return variable 'left' which at that point after while loop, it is last index '3' then returned value is rank 3 (incorrect).

    ReplyDelete

Post a Comment

Popular posts from this blog

Changing the root of a binary tree

-
Image
If you work with graphics and eventually you want to pivot a binary tree using a different node as the root, this might be interesting to you. Here is the problem:  Change the Root of a Binary Tree - LeetCode 1666. Change the Root of a Binary Tree Medium 6 14 Add to List Share Given the  root  of a binary tree and a  leaf  node, reroot the tree so that the  leaf  is the new root. You can reroot the tree with the following steps for each node  cur  on the path  starting from the  leaf  up to the  root ​​​  excluding the root : If  cur  has a left child, then that child becomes  cur 's right child. Note that it is guaranteed that  cur  will have at most one child. cur 's original parent becomes  cur 's left child. Return  the new root  of the rerooted tree. Note:  Ensure that your solution sets the  Node.parent  pointers correctly after rerooting or you will receive "Wrong Answer".   Example 1: Input: root = [3,5,1,6,2,0,8,null,null,7,4], leaf = 7 Output: [7,2,nul
Read more

ProjectEuler Problem 719 (some hints, but no spoilers)

-
Image
Last time that I solved a ProjectEuler (PE) problem was in 2015... This is their latest problem as of today:  https://projecteuler.net/problem=719 Number Splitting        Problem 719 We define an  S S -number to be a natural number,  n n , that is a perfect square and its square root can be obtained by splitting the decimal representation of  n n  into 2 or more numbers then adding the numbers. For example, 81 is an  S S -number because  81 − − √ = 8 + 1 81 = 8 + 1 . 6724 is an  S S -number:  6724 − − − − √ = 6 + 72 + 4 6724 = 6 + 72 + 4 . 8281 is an  S S -number:  8281 − − − − √ = 8 + 2 + 81 = 82 + 8 + 1 8281 = 8 + 2 + 81 = 82 + 8 + 1 . 9801 is an  S S -number:  9801 − − − − √ = 98 + 0 + 1 9801 = 98 + 0 + 1 . Further we define  T ( N ) T ( N )  to be the sum of all  S S  numbers  n ≤ N n ≤ N . You are given  T ( 10 4 ) = 41333 T ( 10 4 ) = 41333 . Find  T ( 10 12 ) The rules of PE prevent me from disclosing the solution (they are very picky about it, rightfully so), but I can chat abo
Read more

Hard Leetcode Problem: Grid Illumination

-
Image
Here is the problem:  https://leetcode.com/problems/grid-illumination/ On a  N x N  grid of cells, each cell  (x, y)  with  0 <= x < N  and  0 <= y < N  has a lamp. Initially, some number of lamps are on.   lamps[i]  tells us the location of the  i -th lamp that is on.  Each lamp that is on illuminates every square on its x-axis, y-axis, and both diagonals ( similar to a Queen in chess ). For the i-th query  queries[i] = (x, y) , the answer to the query is 1 if the cell (x, y) is illuminated, else 0. After each query  (x, y)  [in the order given by  queries ], we turn off any lamps that are at cell  (x, y)  or are adjacent 8-directionally (ie., share a corner or edge with cell  (x, y) .) Return an array of answers.  Each value  answer[i]  should be equal to the answer of the  i -th query  queries[i] . Example 1: Input: N = 5 , lamps = [[0,0],[4,4]] , queries = [[1,1],[1,0]] Output: [1,0] Explanation: Before performing the first query we have both lamps [0
Read more