solutions 1-56,177,180 missing a few

3 files changed, 21 insertions, 0 deletions

diff --git a/challenge-012/aecepoglu/README.md b/challenge-012/aecepoglu/README.md
new file mode 100644
index 0000000000..2f43e385e0
--- /dev/null
+++ b/challenge-012/aecepoglu/README.md
@@ -0,0 +1 @@
+Overdue solutions by AhmetEmre
diff --git a/challenge-012/aecepoglu/bqn/ch-1.bqn b/challenge-012/aecepoglu/bqn/ch-1.bqn
new file mode 100644
index 0000000000..929148e64f
--- /dev/null
+++ b/challenge-012/aecepoglu/bqn/ch-1.bqn
@@ -0,0 +1,12 @@
+# Week 12
+# Challenge 1
+#     The numbers formed by adding one to 
+# the products of the smallest primes are 
+# called the Euclid Numbers (see wiki). 
+# Write a script that finds the smallest 
+# Euclid Number that is not prime.
+
+IsPrime←{0=∨´0=𝕩|˜2↓↕⌈2÷˜𝕩}
+p←/ (1<n) {𝕩∧¬𝕨(≠∧(0=|))n}´⌽ 2↓ n←↕100# sieve based primes
+1+×`p # euclid numbers
+⊑(¬∘IsPrime¨/⊢)7↑1+×`p
diff --git a/challenge-012/aecepoglu/bqn/ch-2.bqn b/challenge-012/aecepoglu/bqn/ch-2.bqn
new file mode 100644
index 0000000000..b42149b97b
--- /dev/null
+++ b/challenge-012/aecepoglu/bqn/ch-2.bqn
@@ -0,0 +1,8 @@
+# Challenge 2
+#
+#Write a script that finds the common directory path, given 
+#a collection of paths and directory separator. For example, 
+#if the following paths are supplied.
+
+d←"/a/b/c/d"‿"/a/b/cd"‿"/a/b/cc"‿"/a/b/c/d/e"
+⊑⌽(⊑∘⌽¨'/'=⊢)⊸/⊏⍉((1=+´∘∊)˘/⊢)⍉d↑˜⌜1+↕⌊´≠¨d