Question

The function I’m trying to write should remove the element at the given index from the given list of any type.

Here is what I have already done:

           delAtIdx :: [x] -> Int -> [x]

           delAtIdx x y = let g = take y x
                          in let h = reverse x
                          in let b = take (((length x) - y) - 1) h
                          in let j = g ++ (reverse b)
                          in j

Is this correct? Could anyone suggest another approach?

Answer 1

It’s much simpler to define it in terms of splitAt, which splits a list before a given index. Then, you just need to remove the first element from the second part and glue them back together.