Skip to content

feat: added work into lesson 11 #413

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
wants to merge 1 commit into from
Closed
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Original file line number Diff line number Diff line change
@@ -1,22 +1,26 @@
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 answer[] = new int[nums.length * 2];
for (int i = 0; i < nums.length; i++) {
answer[i] = nums[i];
answer[i + nums.length] = nums[i];
}
return answer;
}

/**
* 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;
var result = new ArrayList<Integer>();
for (int i = 0; i < words.length; i++) {
if (words[i].contains(String.valueOf(x))) {
result.add(i);
}
}
return result;
}
}
33 changes: 25 additions & 8 deletions lesson_11/arrays_ts/src/lesson11.ts
Original file line number Diff line number Diff line change
@@ -1,15 +1,32 @@
/**
* Provide the solution to LeetCode 1929 here:
* https://leetcode.com/problems/concatenation-of-array
*/

export function getConcatenation(nums: number[]): number[] {
return [];
}
if (nums.length === 0) {
return [];
}
const result = [...nums];
for (const num of nums) {
result.push(num);
}
return result;
}




/**
* Provide the solution to LeetCode 2942 here:
* https://leetcode.com/problems/find-words-containing-character/
*/
export function findWordsContaining(words: string[], x: string): number[] {
return [];
}
if (words.length === 0) {
return [];
}
const result = [];
for (let i = 0; i < words.length; i++) {
if (words[i].includes(x)) {
result.push(i);
}
}
return result;
}
//Received help from copiliot and Meiko and Bryana.