We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  • HackerRank Home

    HackerRank

  • |
  • Prepare
  • Certify
  • Compete
  • Hiring developers?
  1. Prepare
  2. Algorithms
  3. Graph Theory
  4. HackerX
  5. Discussions

HackerX

Problem
Submissions
Leaderboard
Discussions
Editorial

Sort 14 Discussions, By:

recency

Please Login in order to post a comment

  • yashparihar729
    4 months ago+ 0 comments

    Here is my solution in java, javascript, python, C, C++, Csharp HackerRank HackerX Problem Solution

    0|
    Permalink
  • mineman1012221
    6 months ago+ 0 comments

    Here is the solution of HackerX Click Here

    0|
    Permalink
  • thecodingsoluti2
    8 months ago+ 0 comments

    Here is problem solution - https://programs.programmingoneonone.com/2021/07/hackerrank-hackerX-problem-solution.html

    0|
    Permalink
  • bhautikbhalala41
    1 year ago+ 1 comment

    https://zeroplusfour.com/hackerx-hackerrank-solution/

    Here's how I did in all languages Java 8 , C++ , C , Python 3, Python 2.

    0|
    Permalink
  • TChalla
    2 years ago+ 0 comments

    Python 3 code

    n = int(input())
    inp = (map(int, input().split()) for i in range(n))
    p = sorted(list((a + b, a - b) for a, b in inp))
    a = list(y for x, y in p)
    d = []
    for x in a:
        low, high = -1, len(d) # >, <=
        while high - low > 1:
            mid = (low + high) >> 1
            if d[mid] > x:
                low = mid
            else:
                high = mid
        if high == len(d):
            d.append(x)
        else:
            d[high] = x
    print(len(d))
    
    0|
    Permalink
Load more conversations

Need Help?


View editorial
View top submissions
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy