simplify

2025/src/day09.clj

@@ -33,19 +33,18 @@
         o3 (orientation c d a)
         o4 (orientation c d b)]
     (and (not= o1 o2) (not= o3 o4))))
-(def line-segments (map vector input (conj (vec (rest input)) (first input))))
+(def line-segments (map vector input (rest input)))
 
 ;; part 2
 (->> largest-squares
      (filter (fn [[a b]]
-               (let [segments (filter (fn [[seg-a seg-b]] (and (not= a seg-a)
+               (let [segments (filter (fn overlapping? [[seg-a seg-b]]
-                                                               (not= a seg-b)
+                                        (and (not= a seg-a) (not= a seg-b)
-                                                               (not= b seg-a)
+                                             (not= b seg-a) (not= b seg-b))) ;; filter out segments that include points a or b
-                                                               (not= b seg-b)))
                                       line-segments)
                      [[cx cy] [dx dy]] [a b]]
                  (and (not (some #(intersect? [a b] %) segments))
-                      (not (some #(intersect? [[cx dy] [dx cy]] %) segments))))))
+                      (not (some #(intersect? [[cx dy] [dx cy]] %) segments)))))) ;; check reverse diaganol too
      (sort-by (partial apply area))
      last
      (apply area))