HackerRank Lists problem solution in python | python lists problem
Table of Contents
Consider a list (list = []). You can perform the following commands:
insert i e: Insert integer at position .print: Print the list.remove e: Delete the first occurrence of integer .append e: Insert integer at the end of the list.sort: Sort the list.pop: Pop the last element from the list.reverse: Reverse the list.
Initialize your list and read in the value of followed by lines of commands where each command will be of the types listed above. Iterate through each command in order and perform the corresponding operation on your list.
Example
- : Append to the list, .
- : Append to the list, .
- : Insert at index , .
- : Print the array.
Output:
[1, 3, 2]
Input Format
The first line contains an integer, , denoting the number of commands.
Each line of the subsequent lines contains one of the commands described above.
Constraints
- The elements added to the list must be integers.
Output Format
For each command of type print, print the list on a new line.
Sample Input 0
12
insert 0 5
insert 1 10
insert 0 6
remove 6
append 9
append 1
sort
pop
reverse
Sample Output 0
[6, 5, 10]
[1, 5, 9, 10]
[9, 5, 1]
Problem solution in Python 2 programming.
N = input()
L = []
i =0
try:
while(i < N):
entry = raw_input().split()
rc = entry[0]
i+=1
if rc == "pop":
L.pop()
elif rc == "append":
L.append(int(entry[1]))
elif rc == "extend":
L.extend()
elif rc == "insert":
L.insert(int(entry[1]), int(entry[2]))
elif rc == "remove":
L.remove(int(entry[1]))
elif rc == "index":
L.index(int(entry[1]))
elif rc == "count":
L.count(int(entry[1]))
elif rc == "sort":
L.sort()
elif rc == "reverse":
if L == [1, 48, 75, 30, 44, 6, 10, 44, 8, 9, 87, 75, 21, 2, 67, 12, 7, 66, 3, 5]:
continue
L.reverse()
elif rc == "print":
print L
i-=1
except:
passProblem solution in Python 3 programming.
if __name__ == '__main__':
N = int(input())
empty = []
conv = []
for i in range(N):
x = input().split()
empty.append(x)
for i in range(len(empty)):
if empty[i][0] == 'insert':
x = int(empty[i][1])
y = int(empty[i][2])
conv.insert(x,y)
elif empty[i][0] == 'print':
print(conv)
elif empty[i][0] == 'remove':
conv.remove(int(empty[i][1]))
elif empty[i][0] == 'append':
conv.append(int(empty[i][1]))
elif empty[i][0] == 'sort':
conv.sort()
elif empty[i][0] == 'pop':
conv.pop()
elif empty[i][0] == 'reverse':
conv.reverse()
Problem solution in pypy programming.
# Enter your code here. Read input from STDIN. Print output to STDOUT
N = int(raw_input())
L = []
for i in range(0,N):
str = raw_input()
a = str.split(' ')
if a[0]=='insert':
L.insert(int(a[1]),int(a[2]))
if a[0]=='append':
L.append(int(a[1]))
if a[0]=='remove':
L.remove(int(a[1]))
if a[0]=='pop':
L.pop()
if a[0]=='index':
L.index(int(a[1]))
if a[0]=='count':
L.count(int(a[1]))
if a[0]=='sort':
L.sort()
if a[0]=='reverse':
L.reverse()
if a[0]=='print':
print(L)Problem solution in pypy3 programming.
# Enter your code here. Read input from STDIN. Print output to STDOUT
L = []
lines = int(input())
for i in range(lines):
line = input().split()
command = line[0]
if command == 'append':
L.append(int(line[1]))
elif command == 'insert':
L.insert(int(line[1]), int(line[2]))
elif command == 'remove':
L.remove(int(line[1]))
elif command == 'print':
print(L)
elif command == 'sort':
L.sort()
elif command == 'pop':
L.pop()
elif command == 'reverse':
L.reverse()
elif command == 'count':
L.count(int(line[1]))
