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. Absolute Permutation
  5. Discussions

Absolute Permutation

  • mootezceam
     + 0 comments

    A simple python solution that passes all the test cases consists of doing +k -k operations then give privilege to - k operation if applicable else + k operation if applicable to get the smallest P. If - k and + k can not be possible return -1. NOTE that using a set to test if the element has been already used is mandatory, otherwise test cases from 9 to 12 will exceed allowed time:

    def absolutePermutation(n, k):
    res = []
    used = set()
    for index in range(1, n + 1):
        lower_option = index - k
        upper_option = index + k
        if lower_option > 0 and lower_option not in used:
            res.append(lower_option)
            used.add(lower_option)
        elif upper_option <= n and upper_option not in used:
            res.append(upper_option)
            used.add(upper_option)
        else:
            return [-1]
    return res