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..8c67334fb 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[] ans = new int[nums.length + nums.length];
+
+    for (int i = 0; i < nums.length; i++) {
+      ans[i] = nums[i];
+      ans[i + nums.length] = 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> arrayOfIndices = new ArrayList<>(); // Use a List to dynamically store indices
+
+    for (int i = 0; i < words.length; i++) {
+      String letter = String.valueOf(x);
+
+      if (words[i].contains(letter)) { // Check if the character is present in the word
+        arrayOfIndices.add(i); // Add the index to the list
+      }
+    }
+    return arrayOfIndices; // Return list
   }
 }