✨ lc 443-1 & 2

Author: codereport

0443_Problem_1.bqn

@@ -0,0 +1,12 @@
+# For up to date code:
+# https://github.com/codereport/bqn-code/blob/main/leetcode/443-1.bqn
+
+# Link: https://leetcode.com/problems/minimum-cost-to-reach-every-position
+
+u  ⇐ •Import "/home/cph/bqn-test/test.bqn"
+
+MinCosts ← ⌊`
+
+# Tests
+u.UnitTest (MinCosts ⟨5,3,4,1,3,2⟩) ≡ ⟨5,3,3,1,1,1⟩
+u.UnitTest (MinCosts ⟨1,2,4,6,7⟩)   ≡ ⟨1,1,1,1,1⟩

0443_Problem_2.bqn

@@ -0,0 +1,19 @@
+# For up to date code:
+# https://github.com/codereport/bqn-code/blob/main/leetcode/443-2.bqn
+
+# Link: https://leetcode.com/problems/minimum-cost-to-reach-every-position
+
+u  ⇐ •Import "/home/cph/bqn-test/test.bqn"
+
+LongestPalindrome  ← { ⌈´(⌽⊸≡×≠)¨⥊𝕩∾⌜○(⍷·∾·↓¨↑)𝕨 } # Explicit
+LongestPalindrome2 ← ⌈´·(⌽⊸≡×≠)¨·⥊∾⌜˜○(∾·↓¨↑)    # Tacit
+
+# Tests
+u.UnitTest (    "a" LongestPalindrome  "a"    ) ≡ 2
+u.UnitTest (  "def" LongestPalindrome  "abc"  ) ≡ 1
+u.UnitTest ( "aaaa" LongestPalindrome  "b"    ) ≡ 4
+u.UnitTest ("ecdba" LongestPalindrome  "abcde") ≡ 5
+u.UnitTest (    "a" LongestPalindrome2 "a"    ) ≡ 2
+u.UnitTest (  "def" LongestPalindrome2 "abc"  ) ≡ 1
+u.UnitTest ( "aaaa" LongestPalindrome2 "b"    ) ≡ 4
+u.UnitTest ("ecdba" LongestPalindrome2 "abcde") ≡ 5