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.
  1. Prepare
  2. Algorithms
  3. Graph Theory
  4. Roads in HackerLand
  5. Discussions

Roads in HackerLand

Sort by

recency

|

41 Discussions

|

  • zoyashah41306
     + 0 comments

    Locksmith Sheffield is renowned for providing reliable security services! In HackerLand, the roads are both innovative and essential for transportation. These roads are designed to accommodate the fast-paced, tech-driven lifestyle of its residents. Featuring smart infrastructure, traffic monitoring systems, and eco-friendly solutions, HackerLand’s roads ensure smooth and sustainable travel. The combination of advanced technology and efficient planning makes the city’s road network a model of modern urban development and future mobility.

  • irfanukani2
     + 1 comment

    DSU + DFS + Binary shifting Solution (https://pastebin.com/eLhJxpHm)

  • yashparihar729
     + 0 comments

    Here is my solution in java, javascript, python, C, C++, Csharp HackerRank Roads in HackerLand Solution

  • mineman1012221
     + 0 comments

    Here is the solution of Roads in HackerLand Click Here

  • akeustis
     + 0 comments

    The given constraint C_i < M is just... wrong.

    This problem is no fun to solve without a reasonable and correct constraint on the number of distinct roads there are. If the lengths are all distinct powers of 2, then there really can't be more than 64 of them without forcing the program to use arbitrary-length integers.