✨ lc 431-1

Author: codereport

0431_Problem_1.bqn

@@ -0,0 +1,13 @@
+# For up to date code:
+# https://github.com/codereport/bqn-code/blob/main/leetcode/431-1.bqn
+
+# Link: https://leetcode.com/problems/maximum-subarray-with-equal-products 
+
+u ⇐ •Import "/home/cph/bqn-test/test.bqn"
+
+MaxLength ← { ⌈´≠¨(⊢/˜×´=•math.LCM´×•math.GCD´)¨1↓⍷∾↓¨↑𝕩 }
+
+# Tests
+u.UnitTest (MaxLength ⟨1,2,1,2,1,1,1⟩) ≡ 5
+u.UnitTest (MaxLength ⟨2,3,4,5,6⟩)     ≡ 3
+u.UnitTest (MaxLength ⟨1,2,3,1,4,5,1⟩) ≡ 5