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. Greedy
  4. Sherlock and The Beast
  5. Discussions

Sherlock and The Beast

  • emhhacker
     + 0 comments

    My Java solution with o(n) time complexity and o(1) space complexity:

    public static void decentNumber(int n) {
        int fives = n;
        while (fives % 3 != 0) {
            fives -= 5;
        }
        if (fives < 0) {
            System.out.println("-1");
        } else {
            System.out.println("5".repeat(fives) + "3".repeat(n - fives));
        }
    }