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
  • Prepare
    NEW
  • Certify
  • Compete
  • Career Fair
  • Hiring developers?
  1. Prepare
  2. Algorithms
  3. Search
  4. Bike Racers
  5. Discussions

Bike Racers

Problem
Submissions
Leaderboard
Discussions
Editorial
Topics

Sort 57 Discussions, By:

votes

Please Login in order to post a comment

  • FuckAugustus
    7 years ago+ 1 comment

    why every problem is so wordy...Why cannot any fix this?

    8|
    Permalink
  • AlphaKun
    5 years ago+ 1 comment

    Binary search + Max flow.

    A template problem.

    4|
    Permalink
  • mahi_9984
    7 years ago+ 1 comment

    any sides means it can also go through diagonally?? please tell

    4|
    Permalink
  • egorkin_mikhail
    2 years ago+ 0 comments

    The sample case is terrible! Can anyone give a more detailed example, with more bikes and bikes?

    3|
    Permalink
  • harshanaS
    7 years ago+ 2 comments

    i created distances from all the bikers to all the bikes and put it in a 2D matrix. and i searched the values from minimum to highest, until i get values from K rows and K colunms(so that a all K bikers get a bike) but only first 6 test cases pass. i bought a test case and i found out that my answer is lower than the expected value. any clue??

    3|
    Permalink
Load more conversations

Need Help?


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