From 6e34e92920428da89c5d0f4241047ff4b24324f6 Mon Sep 17 00:00:00 2001 From: Olivia James Date: Wed, 2 Apr 2025 17:04:02 +0000 Subject: [PATCH] "Feat lesson 11 leet code" --- .../codedifferently/lesson11/Lesson11.java | 32 +++++++++++++++---- lesson_11/arrays_ts/src/lesson11.ts | 11 +++---- 2 files changed, 31 insertions(+), 12 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..a493f3010 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 { @@ -8,15 +9,34 @@ public class Lesson11 { * Provide the solution to LeetCode 1929 here: * https://leetcode.com/problems/concatenation-of-array */ - public int[] getConcatenation(int[] nums) { - return null; - } +class Solution { + public int[] getConcatenation(int[] nums) { + int n = nums.length; + int [] ans = new int[n * 2]; + + for (int 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/ */ - public List findWordsContaining(String[] words, char x) { - return null; - } + public List findWordsContaining(String[] words, char x) { + ArrayList result = new ArrayList<>(); + + for (int i=0; i