diff --git a/lesson_11/arrays_java/arrays_app/src/main/java/com/codedifferently/lesson11/Lesson11.java b/lesson_11/arrays_java/arrays_app/src/main/java/com/codedifferently/lesson11/Lesson11.java
index 248938a96..de8b521db 100644
--- a/lesson_11/arrays_java/arrays_app/src/main/java/com/codedifferently/lesson11/Lesson11.java
+++ b/lesson_11/arrays_java/arrays_app/src/main/java/com/codedifferently/lesson11/Lesson11.java
@@ -1,5 +1,6 @@
 package com.codedifferently.lesson11;
 
+import java.util.ArrayList;
 import java.util.List;
 
 public class Lesson11 {
@@ -9,7 +10,13 @@ public class Lesson11 {
    * https://leetcode.com/problems/concatenation-of-array
    */
   public int[] getConcatenation(int[] nums) {
-    return null;
+    int n = nums.length;
+    int ans[] = new int[2 * n];
+    for (int i = 0; i < n; i++) {
+      ans[i] = nums[i];
+      ans[n + i] = nums[i];
+    }
+    return ans;
   }
 
   /**
@@ -17,6 +24,16 @@ public int[] getConcatenation(int[] nums) {
    * https://leetcode.com/problems/find-words-containing-character/
    */
   public List<Integer> findWordsContaining(String[] words, char x) {
-    return null;
+    List<Integer> list = new ArrayList<>();
+    for (int i = 0; i < words.length; i++) {
+      String str = words[i];
+      for (int j = 0; j < str.length(); j++) {
+        if (str.charAt(j) == x) {
+          list.add(i);
+          break;
+        }
+      }
+    }
+    return list;
   }
 }
diff --git a/lesson_11/arrays_ts/src/lesson11.ts b/lesson_11/arrays_ts/src/lesson11.ts
index 54af1ba03..10efd7902 100644
--- a/lesson_11/arrays_ts/src/lesson11.ts
+++ b/lesson_11/arrays_ts/src/lesson11.ts
@@ -3,7 +3,13 @@
  * https://leetcode.com/problems/concatenation-of-array
  */
 export function getConcatenation(nums: number[]): number[] {
-  return [];
+  const n = nums.length;
+  const ans: number[] = new Array(2 * n);
+  for (let i = 0; i < n; i++) {
+    ans[i] = nums[i];
+    ans[n + i] = nums[i];
+  }
+  return ans;
 }
 
 /**
@@ -11,5 +17,15 @@ export function getConcatenation(nums: number[]): number[] {
  * https://leetcode.com/problems/find-words-containing-character/
  */
 export function findWordsContaining(words: string[], x: string): number[] {
-  return [];
+  const list: number[] = [];
+  for (let i = 0; i < words.length; i++) {
+    const str = words[i];
+    for (let j = 0; j < str.length; j++) {
+      if (str.charAt(j) === x) {
+        list.push(i);
+        break;
+      }
+    }
+  }
+  return list;
 }