5d77e4d419e9fa68864998cca83a2656f3c9b971 — William Vaughn 1 year, 5 months ago 9580409
direction reduction
A codewars/src/clj/org/willvaughn/codewars/dir_reduc.clj => codewars/src/clj/org/willvaughn/codewars/dir_reduc.clj +59 -0
@@ 0,0 1,59 @@
;; Once upon a time, on a way through the old wild mountainous west,…
;; … a man was given directions to go from one point to another. The directions were "NORTH", "SOUTH", "WEST", "EAST". Clearly "NORTH" and "SOUTH" are opposite, "WEST" and "EAST" too.

;; Going to one direction and coming back the opposite direction right away is a needless effort. Since this is the wild west, with dreadful weather and not much water, it's important to save yourself some energy, otherwise you might die of thirst!

;; How I crossed a mountainous desert the smart way.
;; The directions given to the man are, for example, the following (depending on the language):

;; ["NORTH", "SOUTH", "SOUTH", "EAST", "WEST", "NORTH", "WEST"].
;; or
;; { "NORTH", "SOUTH", "SOUTH", "EAST", "WEST", "NORTH", "WEST" };
;; or
;; [North, South, South, East, West, North, West]
;; You can immediately see that going "NORTH" and immediately "SOUTH" is not reasonable, better stay to the same place! So the task is to give to the man a simplified version of the plan. A better plan in this case is simply:

;; ["WEST"]
;; or
;; { "WEST" }
;; or
;; [West]
;; Other examples:
;; In ["NORTH", "SOUTH", "EAST", "WEST"], the direction "NORTH" + "SOUTH" is going north and coming back right away.

;; The path becomes ["EAST", "WEST"], now "EAST" and "WEST" annihilate each other, therefore, the final result is [] (nil in Clojure).

;; In ["NORTH", "EAST", "WEST", "SOUTH", "WEST", "WEST"], "NORTH" and "SOUTH" are not directly opposite but they become directly opposite after the reduction of "EAST" and "WEST" so the whole path is reducible to ["WEST", "WEST"].

;; Task
;; 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).

;; The Haskell version takes a list of directions with data Direction = North | East | West | South.
;; The Clojure version returns nil when the path is reduced to nothing.
;; The Rust version takes a slice of enum Direction {North, East, West, South}.
;; See more examples in "Sample Tests:"
;; Notes
;; Not all paths can be made simpler. The path ["NORTH", "WEST", "SOUTH", "EAST"] is not reducible. "NORTH" and "WEST", "WEST" and "SOUTH", "SOUTH" and "EAST" are not directly opposite of each other and can't become such. Hence the result path is itself : ["NORTH", "WEST", "SOUTH", "EAST"].
;; if you want to translate, please ask before translating.

(ns org.willvaughn.codewars.dir-reduc) 

(def opposites
   "EAST" "WEST"
   "WEST" "EAST"})

(defn dir-reduc
  (loop [searched []
         unsearched arr]
    (let [dir-a (first unsearched)
          dir-b (second unsearched)]
        (< (count unsearched) 2) (not-empty (into searched unsearched))
        (not= (opposites dir-a) dir-b) (recur (conj searched dir-a) (rest unsearched))
        (= (opposites dir-a) dir-b) (recur [] (into searched (nthrest unsearched 2)))
        :else (throw (Exception. "Unreachable state, I hope"))))))

;;; Solutions on this one can be better. Using reduce, in combination with peek and pop you can check new additions to an accumulated vec. Using pop in a kind of clever way to remove the last entered item in the accumulated array if the current target of reduce is the opposite of it. It's pretty crazy, but would be worth trying.

A codewars/test/clj/org/willvaughn/codewars/dir_reduc_test.clj => codewars/test/clj/org/willvaughn/codewars/dir_reduc_test.clj +9 -0
@@ 0,0 1,9 @@
(ns org.willvaughn.codewars.dir-reduc-test
  (:require [clojure.test :refer :all]
            [org.willvaughn.codewars.dir-reduc :refer [dir-reduc]]))

(deftest a-test1
  (testing "Test 1"
    (def ur ["NORTH", "SOUTH", "SOUTH", "EAST", "WEST", "NORTH", "WEST"])
    (def vr ["WEST"])
    (is (= (dir-reduc ur) vr))))