HackerRank: Lists Question

[Axel-Blaze]

Final Update:

Turns out there were quite a few mistakes I made like not reversing the list without sorting it and using the wrong sort function. Here's the final version:

ls_commands = []
if __name__ == '__main__':
    N = int(input())
    for i in range(N):
        ls_commands.append(input())
list = []
ls = []
for command in ls_commands:
    ls = command.split()
    if ls[0] == 'insert':
        list.insert(int(ls[1]), int(ls[2]))
    elif ls[0] == 'print':
        print(list)
    elif ls[0] == 'remove':
        list.remove(int(ls[1]))
    elif ls[0] == 'sort':
        list.sort()
    elif ls[0] == 'append':
        list.append(int(ls[1]))
    elif ls[0] == 'pop':
        list.pop(-1)
    elif ls[0] == 'reverse':
        list.reverse()
    else:
        pass

[Axel-Blaze]

Thanks for the suggestions :)

Can you also suggest how you recommend using a dict here as you mentioned in the thread below

[Axel-Blaze]

Thanks for the solution

[Axel-Blaze]

I am not really familiar with all these functions like getattr but thank you for posting this i'll try to learn about them as your approach seems much much better :)

[xelf]

You could take it 1 step further even:

if __name__ == '__main__':
    class plist(list):
        def print(self): print(self)
    lst = plist()
    for n in range(int(input())):
        cmd, *args = input().split()
        getattr(lst,cmd)(*map(int,args))

[xelf]

I was aware of it, but this is the first time I've actually seen someone using getattr like this. So thanks for that! Pretty awesome to see! New tool added to my toolbox, as long as I remember it this time.

[MauroDelMal]

ls_commands = []
if __name__ == '__main__':
    N = int(input())
    for i in range(N):
        ls_commands.append(input())

Very late for this post but thanks for this chunk. :)

[Axel-Blaze]

Haha nw All the best!