From 993570c25a917b069e5a71c15d9d1cf192adb299 Mon Sep 17 00:00:00 2001
From: Dadenaike251 <dadenaike251@gmail.com>
Date: Tue, 8 Apr 2025 20:11:44 +0000
Subject: [PATCH] adds implementation for getConcatenation &
 findWordsContaining methods

---
 .../codedifferently/lesson11/Lesson11.java    | 23 +++++++++++++++++--
 1 file changed, 21 insertions(+), 2 deletions(-)

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..a47894925 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,17 @@ public class Lesson11 {
    * https://leetcode.com/problems/concatenation-of-array
    */
   public int[] getConcatenation(int[] nums) {
-    return null;
+    // final int n = nums.length;
+    int ans[] = new int[nums.length * 2];
+    for (int i = 0; i < nums.length; i++) {
+      ans[i] = nums[i];
+    }
+    int index = nums.length;
+    for (int i = 0; i < nums.length; i++) {
+      ans[index] = nums[i];
+      index++;
+    }
+    return ans;
   }
 
   /**
@@ -17,6 +28,14 @@ public int[] getConcatenation(int[] nums) {
    * https://leetcode.com/problems/find-words-containing-character/
    */
   public List<Integer> findWordsContaining(String[] words, char x) {
-    return null;
+
+    // return null;
+    List<Integer> result = new ArrayList<>();
+    for (int i = 0; i < words.length; i++) {
+      if (words[i].indexOf(x) != -1) {
+        result.add(i);
+      }
+    }
+    return result;
   }
 }