Feat/Adds a getConcatenation and findWordsContaining method in Java and TS

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 {
@@ -8,15 +9,59 @@ public class Lesson11 {
    * Provide the solution to LeetCode 1929 here:
    * https://leetcode.com/problems/concatenation-of-array
    */
-  public int[] getConcatenation(int[] nums) {
-    return null;
+  public static int[] getConcatenation(int[] nums) {
+
+    int n = nums.length; // Creates a variable named n that is the length of nums
+    int[] ans = new int[2 * n]; // Creates a new array that is double the size of n.
+
+    for (int i = 0; i < n; ++i) {
+      ans[i] = nums[i]; // Gets the first half of the int array
+      ans[i + n] = nums[i]; // Gets the second half of the int array
+    }
+    return ans;
+  }
+
+  public static void main(String[] args) {
+
+    // Creates an instance of the solution class
+    // We need this because getConcatenation() is a method that is non-static meaning we need and
+    // object of Solution to use it.
+    // This would be unneeded if getConcatenation() was static
+
+    int[] nums = {1, 2, 3, 4}; // Array of nums based on Test input
+    int[] result =
+        getConcatenation(nums); // calls the getConcatenation method giving it the array of nums.
+
+    // Prints result out.
+
+    // You need to loop out the result because we want to display the contents of an array which
+    // means we need to call each instance in it. This is easily done by using the for else loop to
+    // run until it is returned false.
+    for (int num : result) {
+      System.out.print(num + " ");
+    }
+
+    String[] words = {
+      "leet", "code", "hello", "world"
+    }; // Creates an Array named words that contains a series of strings.[]
+
+    char x = 'e'; // Calls for a specific char
+    System.out.println(findWordsContaining(words, x)); // Prints out findWordsContaining method
   }
 
   /**
    * 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;
+  public static List<Integer> findWordsContaining(String[] words, char x) {
+    ArrayList<Integer> elListo = new ArrayList<>(); // Create an arraylist named ElListo
+
+    // Runs a loop that will iterate through each character in the word.
+    for (int i = 0; i < words.length; i++) {
+      if (words[i].indexOf(x) != -1) { // will check to see if 'x' exists inside of the word
+        elListo.add(i); // Stores the index if it is true that it has that character
+      }
+    }
+    return elListo; // Will return elListo ArrayList to main
   }
 }

lesson_11/arrays_ts/src/lesson11.ts

@@ -1,15 +1,50 @@
+
 /**
- * Provide the solution to LeetCode 1929 here:
- * https://leetcode.com/problems/concatenation-of-array
- */
+* Provide the solution to LeetCode 1929 here:
+* https://leetcode.com/problems/concatenation-of-array
+*/
 export function getConcatenation(nums: number[]): number[] {
-  return [];
+ const n = nums.length; //Creates a variable named n that is the length of nums
+ const ans: number[] = new Array(2 * n); //Creates a new array that is double the size of 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/
- */
+* 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 elListo: number[] = [] //creates a new array named elListo
+
+
+ //Runs a loop that will iterate through each character in the String.
+ for (let i = 0; i < words.length; ++i) {
+   if (words[i].includes(x)) { //Checks to see if the word inclues the char 'x'
+     elListo.push(i); //Pushes the index of i if it is true that the word contains that character
+
+   }
+ } return elListo; //Will return the Array elListo
 }
+
+
+//Test Cases
+
+
+const nums: number[] = [1, 2 , 3, 4]; //Array of numbers based on test case
+const result: number[] = getConcatenation(nums);
+console.log(result.join(' '))//Prints the test result out for the fet concatentaition method
+
+
+const words: string[] = ['leet', 'code', 'hello', 'world']; //Array of strings based on test case
+const x = 'e'; //Calls for a specific char
+console.log(findWordsContaining(words, x));
+