Bro it is stated it should be in a type of sequence you can understand the condition by the below example.
for example [North,East ,West, South] then since east west are in sequence they are eliminated first ->
The Array is reduced as [North South] Again North South are in sequence so the will be eliminated so
Final result is An empty array

It is not stated that they need to be in sequence or out of sequence, in some cases the result considers directions that aren't in sequence but somehow dont reduce this occurance

Man you for real? You have NxM iterations of linear operation "in"

That is if the task is to reduce the steps to the most optimal.

The actual task is:

Write a function dirReduc which will take an array of strings and returns an array of strings with the needless directions removed (W<->E or S<->N side by side).

From, NWSE. There's no WE, EW, SN, or NS. Which means, you don't need to reduce it.

I think this questions is stupid how is this possible?

a=["NORTH", "WEST", "SOUTH", "EAST"]
test.assert_equals(dir_reduc(a), ["NORTH", "WEST", "SOUTH", "EAST"])

How do you get this result? If you are given these instructions, then taking these directions will lead you to the same spot you were before. I get the question but if the purpose is to avoid redundancy then what is more redundant than being end up in the same spot?

your solution is not linear and slow

if it is easy, you can try to solve it linearly! That's what I did.