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. Implementation
  4. Beautiful Triplets
  5. Discussions

Beautiful Triplets

  • victorz
     + 1 comment

    I have an even more space-efficient solution in O(1) auxiliary space (better than O(d) space) and O(n) time. https://www.hackerrank.com/challenges/beautiful-triplets/forum/comments/423984