feat: adds leetcode implementation in Typescript by Yemi

Author: jimoye244

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

@@ -6,6 +6,9 @@
 public class Lesson11 {
 
   public int[] getConcatenation(int[] nums) {
+    if(nums.length == 0){
+      return new int[]{};
+    }
     int lenOriginalArray = nums.length;
     int[] concatenatedArrays = new int[lenOriginalArray * 2];
 
@@ -21,6 +24,10 @@ public int[] getConcatenation(int[] nums) {
 
   public List<Integer> findWordsContaining(String[] words, char x) {
     var indexList = new ArrayList<Integer>();
+    if(words.length == 0){
+      return indexList;
+    }  
+   
     int index = -1;
     for(String word : words){
       index = index + 1;

lesson_11/arrays_ts/src/lesson11.ts

@@ -3,13 +3,41 @@
  * https://leetcode.com/problems/concatenation-of-array
  */
 export function getConcatenation(nums: number[]): number[] {
-  return [];
+  if (nums.length === 0) {
+    return [];
+  }
+  const lenOriginalArray: number = nums.length;
+  const concatenatedArrays: number[] = [lenOriginalArray * 2];
+  for (let i = 0; i < lenOriginalArray; i++) {
+    concatenatedArrays[i] = nums[i];
+  }
+  const nextIndex = lenOriginalArray;
+  for (let i = 0; i < lenOriginalArray; i++) {
+    concatenatedArrays[nextIndex + i] = nums[i];
+  }
+  return concatenatedArrays;
 }
 
 /**
  * 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 indexList: number[] = [];
+  if (words.length === 0){
+    return [];
+  }
+  let index = -1;
+  for (const word of words) {
+    index = index + 1;
+    const charactersOfWord = [];
+    const charactersOfCurrentWord: string[] = word.split('');
+    for (const xter of charactersOfCurrentWord) {
+      charactersOfWord.push(xter);
+    }
+    if (charactersOfWord.includes(x)) {
+      indexList.push(index);
+    }
+  }
+  return indexList;
 }