From 0392c29af50cc71d9fac0f2437489d2ab33fedb9 Mon Sep 17 00:00:00 2001 From: Rasheed Date: Mon, 31 Mar 2025 13:33:54 +0000 Subject: [PATCH] lesson_11_homework complete --- .../codedifferently/lesson11/Lesson11.java | 29 ++++++++++++------- 1 file changed, 19 insertions(+), 10 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..f9d6d7db4 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,22 +1,31 @@ package com.codedifferently.lesson11; +import java.util.ArrayList; import java.util.List; public class Lesson11 { - /** - * Provide the solution to LeetCode 1929 here: - * https://leetcode.com/problems/concatenation-of-array - */ public int[] getConcatenation(int[] nums) { - return null; + int n = nums.length; + int[] result = new int[2 * n]; + + for (int i = 0; i < n; i++) { + result[i] = nums[i]; + result[i + n] = nums[i]; + } + + return result; } - /** - * Provide the solution to LeetCode 2942 here: - * https://leetcode.com/problems/find-words-containing-character/ - */ public List findWordsContaining(String[] words, char x) { - return null; + List indices = new ArrayList<>(); + + for (int i = 0; i < words.length; i++) { + if (words[i].indexOf(x) != -1) { + indices.add(i); + } + } + + return indices; } }