Feat: adds Pablo Limon-Paredes Lesson11 Leetcode problem solutions in Java and Typescript

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,14 +10,29 @@ 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 < 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 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;
   }
 }

lesson_11/arrays_ts/src/lesson11.ts

@@ -3,13 +3,25 @@
  * https://leetcode.com/problems/concatenation-of-array
  */
 export function getConcatenation(nums: number[]): number[] {
-  return [];
+  const n = nums.length;
+  const ans = new Array(2 * n);
+  for (let i = 0; i < n; i++) {
+    ans[i] = nums[i];
+    ans[i + n] = nums[i];
+  }
+  return ans;
 }
 
 /**
  * Provide the solution to LeetCode 2942 here:
  * https://leetcode.com/problems/find-words-containing-character/
  */
 export function findWordsContaining(words: string[], x: string): number[] {
-  return [];
+  const indices: number[] = [];
+  for (let i = 0; i < words.length; i++) {
+    if (words[i].includes(x)) {
+      indices.push(i);
+    }
+  }
+  return indices;
 }