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..5cea06b77 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,15 @@ public class Lesson11 {
    * https://leetcode.com/problems/concatenation-of-array
    */
   public int[] getConcatenation(int[] nums) {
-    return null;
+    int size = nums.length;
+
+    int[] result = new int[size * 2];
+
+    for (int i = 0; i < size * 2; i++) {
+      result[i] = nums[i % size];
+    }
+
+    return result;
   }
 
   /**
@@ -17,6 +26,13 @@ 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> result = new ArrayList();
+
+    for (int i = 0; i < words.length; i++) {
+      if (words[i].contains(x + "")) {
+        result.add(i);
+      }
+    }
+    return result;
   }
 }
diff --git a/lesson_11/arrays_ts/src/lesson11.ts b/lesson_11/arrays_ts/src/lesson11.ts
index 54af1ba03..90c6b78d2 100644
--- a/lesson_11/arrays_ts/src/lesson11.ts
+++ b/lesson_11/arrays_ts/src/lesson11.ts
@@ -3,7 +3,8 @@
  * https://leetcode.com/problems/concatenation-of-array
  */
 export function getConcatenation(nums: number[]): number[] {
-  return [];
+  const combinedArr = nums.concat(nums);
+  return combinedArr;
 }
 
 /**
@@ -11,5 +12,13 @@ export function getConcatenation(nums: number[]): number[] {
  * https://leetcode.com/problems/find-words-containing-character/
  */
 export function findWordsContaining(words: string[], x: string): number[] {
-  return [];
+  const result: number[] = [];
+
+  for (let i = 0; i < words.length; i++) {
+    if (words[i].includes(x)) {
+      result.push(i);
+    }
+  }
+
+  return result;
 }