Feat: adds leetcode problem solutions

Author: PabLim-Par

lesson_11/arrays_java/arrays_app/src/main/java/com/codedifferently/lesson11/Lesson11.java

@@ -2,21 +2,38 @@
 
 import java.util.List;
 
+
 public class Lesson11 {
 
   /**
    * Provide the solution to LeetCode 1929 here:
    * 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 < nums.length; i++){
+      ans[i] = nums[i]
+      ans[i + n] = nums[i]
+    }
+    return ans;
   }
-
+  // Had help to understand better solutions from Joseph, Kimberlee, Nile, and Angelica, we were on Jitsi//
+  
   /**
    * Provide the solution to LeetCode 2942 here:
    * https://leetcode.com/problems/find-words-containing-character/
    */
+  public class Solution{
   public List<Integer> findWordsContaining(String[] words, char x) {
-    return null;
-  }
+        List<Integer> indices = new ArrayList<>();
+        for(int i = 0; i < words.length; i++){
+            if (words[i].contains(String.valueOf(x))){
+                indices.add(i);
+            }
+        }
+        return indices;
+    }
 }
+  }
+