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. Python
  3. Sets
  4. Set .discard(), .remove() & .pop()
  5. Discussions

Set .discard(), .remove() & .pop()

Sort by

recency

|

1077 Discussions

|

  • pithambar20
     + 0 comments
    n = int(input())
s = set(map(int, input().split()))

n1 = int(input())

for i in range(n1):
    method = input().split()
    
    if len(method) == 1 and method[0]=="pop":
        s.pop()
    elif method[0] == "remove" :
        s.remove(int(method[1]))
    elif method[0] == "discard":
        s.discard(int(method[1]))

print(sum(s))

  • xackxr
     + 4 comments

    Why this works? .pop() removes an element randomly. But hackrrank assumes always min element is removed.

    n = int(input())
s = set(map(int, input().split()))
N = int(input())

for _ in range(N):
    cmd = input().split()
    if cmd[0] == 'pop':
        # remove the smallest item to match HackerRank's pop behavior
        s.remove(min(s))
    elif cmd[0] == 'remove':
        s.remove(int(cmd[1]))
    elif cmd[0] == 'discard':
        s.discard(int(cmd[1]))

print(sum(s))

  • rohitambasta_ii1
     + 0 comments
    n = int(input())
s = set(map(int, input().split()))
N = int(input())
for _ in range (N):
    command= input().split()
    if len(command) == 1:
       getattr(s, command[0])() 
    else:
        getattr(s, command[0])(int(command[1]))  
print(sum(s))

  • alazermanakelewb
     + 0 comments

    Why would this not work:

    import sys

    def solution(n, values, lines, N): for i in range(N): if lines[i][0] == "d": values.discard(int(lines[i][-1])) elif lines[i][0] == "r": values.remove(int(lines[i][-1])) else: values.pop()

    return values

    if name=="main": n = int(input()) values = set(map(int, input().split())) N = int(input())

    lines = []
for _ in range(N):
    lines.append(input().strip())

result = solution(n, values, lines, N)
print(result)

  • kirubhaharan26
     + 0 comments

    This code works just fine..

    n = int(input()) S = set(map(int,input().split())) N = int(input()) arr = [] for i in range(N): command = list(input().split()) if command[0] == 'pop': S.discard(min(S)) else: S.discard(int(command[1])) print(sum(S))