diff --git a/190521/k_number.js b/190521/k_number.js
deleted file mode 100644
index d49891a..0000000
--- a/190521/k_number.js
+++ /dev/null
@@ -1,6 +0,0 @@
-const solution = (arr, commands) => {
-    let answer = commands.map( el => arr.slice(el[0]-1,el[1]).sort(sortFuc)[el[2]-1])
-    return answer;
-}
-
-const sortFuc = (a,b) => {return a-b};
\ No newline at end of file
diff --git a/190524/ruby/solution.js b/190524/ruby/solution.js
new file mode 100644
index 0000000..fd42ca1
--- /dev/null
+++ b/190524/ruby/solution.js
@@ -0,0 +1,13 @@
+const solution = (c) => {
+    c.sort((a,b)=>b-a);
+    for(let i=0; i<c.length; i++){
+        if(i+1 > c[i]){
+            return i
+        }else if(i+1 === c[i]){
+            return c[i]
+        }
+    }
+    return c.length
+}
+
+console.log(solution([1,1,3,4,8]))
\ No newline at end of file
diff --git a/190527/ruby/solution.js b/190527/ruby/solution.js
new file mode 100644
index 0000000..6353650
--- /dev/null
+++ b/190527/ruby/solution.js
@@ -0,0 +1,25 @@
+const solution = (answers) => {
+    let answer = [];
+    const a = [1,2,3,4,5];
+    const b = [2,1,2,3,2,4,2,5];
+    const c = [3,3,1,1,2,2,4,4,5,5];
+    let num = [0,0,0];
+    
+    answers.forEach((el, i)=>{
+        if(el === a[i%5]){
+            num[0] = num[0] + 1;
+        }
+        if(el === b[i%8]){
+            num[1] = num[1] + 1;
+        }
+        if(el === c[i%10]){
+            num[2] = num[2] + 1;
+        }  
+    })
+    num.forEach( (el, i) => { 
+        if(el === Math.max(...num)){
+            answer.push(i+1)
+        }
+    }) 
+    return answer
+}
\ No newline at end of file