From 506dd0e64e911e79ef1bc8f6ad74cca5fa663f93 Mon Sep 17 00:00:00 2001
From: Yafiaha <ynadbullah244@gmail.com>
Date: Mon, 21 Oct 2024 14:37:36 +0000
Subject: [PATCH 1/2] Feat: Yafiah added Java Leetcode problems Lesson-11

---
 .../codedifferently/lesson11/Lesson11.java    | 21 +++++++++++++++++--
 1 file changed, 19 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..f0331827c 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,13 @@ 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<n; i++){
+      ans[i] = nums[i];
+      ans[n+i] = nums[i];
+    }
+    return ans;
   }
 
   /**
@@ -17,6 +24,16 @@ public int[] getConcatenation(int[] nums) {
    * https://leetcode.com/problems/find-words-containing-character/
    */
   public List<Integer> findWordsContaining(String[] words, char x) {
-    return null;
+    List<Integer> list = new ArrayList<>();
+    for (int i = 0; i < words.length; i++) {
+      String str = words[i];
+     for (int j = 0; j < str.length(); j++) {
+       if (str.charAt(j) == x) {
+         list.add(i);
+         break;
+        }
+      }
+    }
+   return list;
   }
 }

From fac971ba1d8d54bbc685d2312df6c476afddda10 Mon Sep 17 00:00:00 2001
From: Yafiaha <ynadbullah244@gmail.com>
Date: Mon, 21 Oct 2024 14:42:47 +0000
Subject: [PATCH 2/2] Fix-Up : fix build lesson 11

---
 .../com/codedifferently/lesson11/Lesson11.java   | 16 ++++++++--------
 1 file changed, 8 insertions(+), 8 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 f0331827c..de8b521db 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
@@ -11,10 +11,10 @@ public class Lesson11 {
    */
   public int[] getConcatenation(int[] nums) {
     int n = nums.length;
-    int ans[] = new int[2*n];
-    for (int i = 0; i<n; i++){
+    int ans[] = new int[2 * n];
+    for (int i = 0; i < n; i++) {
       ans[i] = nums[i];
-      ans[n+i] = nums[i];
+      ans[n + i] = nums[i];
     }
     return ans;
   }
@@ -27,13 +27,13 @@ public List<Integer> findWordsContaining(String[] words, char x) {
     List<Integer> list = new ArrayList<>();
     for (int i = 0; i < words.length; i++) {
       String str = words[i];
-     for (int j = 0; j < str.length(); j++) {
-       if (str.charAt(j) == x) {
-         list.add(i);
-         break;
+      for (int j = 0; j < str.length(); j++) {
+        if (str.charAt(j) == x) {
+          list.add(i);
+          break;
         }
       }
     }
-   return list;
+    return list;
   }
 }