title: Removing a string from a list of strings in Haskell
body: <p>I have a question regarding Haskell that's been stumping my brain. I'm currently required to write a function that removes a string i.e. <code>"word"</code> from a list of strings <code>["hi", "today", "word", "Word", "WORD"]</code> returns the list <code>["hi", "today", "Word", "WORD"]</code>. I cannot use any higher-order functions and can only resort to primitive recursion.</p>
  
  <p>Thinking about the problem, I thought maybe I could solve it by using a recursion where you search the head of the first string, if it matches <code>"w"</code> then compare the next head from the tail, and see if that matches <code>"o"</code>. But then I soon realized that after all that work, you wouldn't be able to delete the complete string <code>"word"</code>. </p>
  
  <p>My question really being how do I compare a whole string in a list rather than only comparing 1 element at a time with something like: <code>removeWord (x:xs)</code>. Is it even possible? Do I have to write a helper function to aid in the solution?</p>