Trim elements from the ends of a list
Haskell, 37 36 bytes

f v|g&lt;-reverse.snd.span(`elem`v)=g.g

Try it online!

-1 byte thanks to xnor.

How?
f v                     -- define a function f that takes as input a list v of falsey values
  |g&lt;-                  --   inside the definition, define a new function g that...
    reverse             --     reverses...
    .snd                --     the second element of...
    .span               --     a tuple (say (x,y)) where x is the longest prefix of elements that...
      (`elem`v)         --       belong to v...
                        --     and y is the rest of the list
  =g.g                  --   f is defined as the composition g.g (basically apply g twice)