nose que tan eficiente es, pero me funciona:

def Switch(n):
    switch = {
        0: "CERO",
        1: "UNO",
        2: "DOS",
        3: "TRES",
    }
    return switch.get(n,None)

def operacion(op, a, b):
    casos = { "+": sumar, "-": restar, "*": multiplicar, "/": dividir }
    operacion = casos.get(op, None)
    if operacion:
       return operacion(a,b)
    else:
       return "Operación no válida"

return {
   "+": sumar,
   "-": restar,
   "*": multiplicar,
   "/": dividir,
}.get(op, nullop)(a,b)

from operator import (add, sub, mul, truediv)

{
   "+": add,
   "-": sub,
   "*": mul,
   "/": truediv,
}.get(op)(a,b)

    estuve como media hora para poder resolver un ejercicio, y un monstruo lo resolvió en 2 lineas..
codewars.com/kata/578aa45ee9fd15ff4600090d/train/python

    from collections import deque

    def sort_array2(array):
        odd = deque(sorted(x for x in array if x % 2))
        return [odd.popleft() if x % 2 else x for x in array]

expresion_generadora = (x**2 for x in range(100))
for dato in expresion_generadora:
   print(dato)

es mecánico... al principio cuesta
[i.a['href'] for i in soup.find_all(class_='algo')]

lista = []
for x in expresion_generadora:
   lista.append(x**2)

lista = []
dummy = []
for i in range(100):
     elemento = lista.append(i)
     dummy.append(elemento)
return dummy

lista = [1,2,3]
lista.extend([4,5])

lista = []
for variable in iterable:
   if condicion:
      lista.append(expresion)

>>> [x for x in reversed(gen2)]
Traceback (most recent call last):
  File "<stdin>", line 1, in <module>
TypeError: 'generator' object is not reversible

[ print(x) for x in lista ]

for x in lista:
   print(x)

lista = [1,2,3,4]
[ print(x) for x in lista ]