Skip to main content

Program to perform list operation in Python

Task
You have to initialize your list L = [] and follow the N commands given in N lines.

Commands will be 1 of the 8 commands as given above, other than extend, and each command will have its value separated by space.

Follow this example:

Sample Input

12
insert 0 5
insert 1 10
insert 0 6
print
remove 6
append 9
append 1
sort
print
pop
reverse
print


Sample Output

[6, 5, 10]
[1, 5, 9, 10]
[9, 5, 1]
Python Code

Solution 1 -

#!/usr/bin/python

lst = []
n = int(raw_input())

#Loop till all the commands are read

for i in range(0,n):
read = raw_input()
cmd = read.split()
#check for the commands and perform the action
if (cmd[0] == 'insert'):
    lst.insert(int(cmd[1]),int(cmd[2])) #pos,elem
elif(cmd[0] == 'print'):
     print lst
elif(cmd[0] == 'remove'):
     lst.remove(int(cmd[1]))
elif(cmd[0] == 'append'):
     lst.append(int(cmd[1]))
elif(cmd[0] == 'sort'):
     lst.sort()
elif(cmd[0] == 'pop'):
     lst.pop()
elif(cmd[0] == 'reverse'):
     lst.reverse()
elif(cmd[0] == 'count'):
     lst.count(int(cmd[1]))
elif(cmd[0] == 'index'):
     lst.index(int(cmd[1]))


Solution 2 -

n = input()
l = []

for _ in range(n):
read = raw_input().split()
cmd = read[0]
args = read[1:]

if cmd !="print":
    cmd += "(" + ",".join(args) + ")"
    eval("l."+cmd)
else:
    print l

Comments

Popular posts from this blog

Sampling and FFT Size derivation in LTE

Sampling and FFT Size derivation in LTE Ts = 1 / (15000 x 2048) seconds, which corresponds to the 30.72 MHz sample clock for the 2048 point FFT used with the 20 MHz system bandwidth. In the frequency domain, the number of sub-carriers N ranges from 128 to 2048, depending on channel bandwidth with 512 and 1024 for 5 and 10 MHz, respectively, being most commonly used in practice. The sub-carrier spacing is ∆f = 1/T u = 15 kHz. The sampling rate is fs = ∆f · N = 15000 N. This results in a sampling rate that’s multiple or sub-multiple of the WCDMA chip rate of 3.84 Mcps: LTE parameters have been chosen such that FFT lengths and sampling rates are easily obtained for all operation modes while at the same time ensuring the easy implementation of dual-mode devices with a common clock reference. Sampling frequency is Multiple's of 2, For 15 Mhz Bandwidth - Sampling Frequency = 23.04 (6 * 3.84). FFT SIZE = S...

C Programming Questions – Part 1

1. W hat do curly braces denote in C? Why does it make sense to use curly brac es to surround the body of a function?   Answer: The curly braces denote a block of code, in which variables can be declared. Variables declared within the block are valid only until the end of the block, marked by the matching right curly brace ’}’. The body of a function is one such type of block, and thus, curly braces are used to describe the extent of that block . 2.Describe the difference between the literal values 7, "7", and ’7 ’ ?   Answer: The first literal is integer 7.Second literal is null terminated string value '7'.Third literal is character '7' having ASCII character code (55). 3. Consider the statement double ans = 10.0+2.0/3.0−2.0∗2.0; Rewrite this statement, inserting parentheses to ensure that ans = 11.0 upon evaluation of this statement ? Answer: double ans = 10.0+2.0/ (( 3.0−2.0 ) ∗2.0 ) ; 4 .C...

Python program to print Triangle Quest

Problem Statement -  https://www.hackerrank.com/challenges/python-quest-1 Program to print below output with single for loop and no string operation. n = 5 1 22 333 4444 Code - for i in range(1,int(raw_input())):       print int(i- (10*(i/10)))*(((10**i-1))/9) or  print i*(10** (i)-1)/9 Resources - http://math.stackexchange.com/questions/1352084/expressing-the-infinite-sum-1-22-333-4444 https://en.wikipedia.org/wiki/Repdigit Note that for integers greater than 0 and less than 10. ( 10 1 /   9 )   X   1 = 1 ( 10 2 /   9 )   X   2 = 22 ( 10 3 /   9 )   X   3 = 333 ( 10 4 /   9 )   X   4 = 4444 ( 10 5 /   9 )   X   5 = 55555 ( 10 6 /   9 )   X   6 = 666666 ( 10 7 /   9 )   X   7 = 7777777 ( 10 8 /   9 )   X   8 = 88888888 ( 10 9 /   9 )   X   9 = 999999999