Grokking Data Structures & Algorithms for Coding Interviews
Vote

0% completed

​

Solution: Beautiful Array

.....

.....

.....

Like the course? Get enrolled and start learning!
A

Anonymous

· 2 years ago

class Solution:
    def beautifulArray(self, N: int) -> [int]:
        result = [0] * N
        if N == 1:
            return[1]

        print(result)

        for i in range(0, N, 2):
            if i+1 < N:
                result[i] = i+2
                result[i+1] = i+1
            else:
                result[i] = i+1
        print(result)
        # ToDo: Write Your Code Here.
        return result
Show 1 reply

Reading Progress

0%

Vote for new content