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. Subset Component
  5. Discussions

Subset Component

Problem
Submissions
Leaderboard
Discussions
Editorial

    You are viewing a single comment's thread. Return to all comments →

  • luceinaltis2020
    2 years ago+ 1 comment

    I think that the editorial's time complexity is not correct.

    It is O(),not O().

    Anybody who wants to see my submission, just get to my github link!

    https://github.com/luceinaltis/Algorithms/blob/master/HackerRank_Subset_Component.cpp

    0|
    Permalink
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy