Challenge | Simple multi-question bank answering system

I wish to move a large set of files from an AWS S3 bucket in one AWS account (source), having systematic filenames following this pattern:

I'm learning Vue 3 with Vuex 4 and I'm stucked with something that I'm pretty sure it's simple but I can't see.

In few words, i'm trying to set some data in state to have it available to use it in my components but it isn't working.

Let me show you the code:

/// store.js

I am building an app following the Rest Countries API challenge from frontendmentor. I have run into a problem. When trying to find the border countries full name using the alpha3code, I get the error : TypeError: Cannot read property 'name' of undefined.

I am solving this problem on dynamic array in which input first line contains two space-separated integers,n, the size of arr to create, and q, the number of queries, respectively. Each of the q subsequent lines contains a query string,queries[i]. it expects to return int[]: the results of each type 2 query in the order they are presented.

i tried to attempt as below and my code seems fine to me but it gives segmentation fault error. please help me where I am getting conceptually wrong. thanks.

problem: Declare a 2-dimensional array,arr , of n empty arrays. All arrays are zero indexed. Declare an integer,last answer , and initialize it to zero.

There are 2 types of queries, given as an array of strings for you to parse:

Query: 1 x y

Let idx=((queries[i][1]^last_answer)%n);. Append the integer y to arr[idx].

Query: 2 x y

Let idx=((queries[i][1]^last_answer)%n);. Assign last_answer=arr[idx][queries[i][2]%(arr[idx].size())] . Store the new value of last_answer to an answers array.

input: 2 5

1 0 5

1 1 7

1 0 3

2 1 0

2 1 1

output:

7

3

I have a field in my table that contains a string that can follow any of 3 formats:

1. null
2. "[string]"
3. "Following fields matched: {string=string, string=string, string=string..}"

For 1 I need output : null For 2 I need output : For 3 I need to split each pair into its each row with columns [key] & [value]

Now, I have solved this challenge, I just think that I have done it in the most eloquent or efficient manner.

Would be grateful if anyone could point me to a better solution ? Thanks

I would greatly appreciate any feedback you might offer regarding the issue I am having with my Word Prediction Shiny APP Code for the JHU Capstone Project.

My UI code runs correctly and displays the APP. (see image and code below)

Challenge/Issue: My problem is that after entering text into the "Text input" box of the APP, my server.R code does not return the predicted results.

Prediction Function:

When I run this line of code in the RConsole -- predict(corpus_train,"case of") -- the following results are returned: 1 "the" "a" "beer"

When I use this same line of code in my server.r Code, I do not get prediction results.

Any insight suggestions and help would be greatly appreciated.

The project: for a list of meta-data of wordpress-plugins: - approx 50 plugins are of interest! but the challenge is: i want to fetch meta-data of all the existing plugins. What i subsequently want to filter out after the fetch is - those plugins that have the newest timestamp - that are updated (most) recently. It is all aobut acutality... so the base-url to start is this:

I am trying an exercise that requires you to:

write a program that returns a list that contains only the elements that are common between the lists (without duplicates). Make sure your program works on two lists of different sizes.

I was able to do this, but one of the extra challenges is to:

Write this in one line of Python

I came up with the following code:

In this challenge, using javaScript you will create 3 classes

1. Super class called Animal.
2. Dog and Cat class which both extends Animal class (a dog is an animal and a cat is an animal)
3. Dog and Cat class should only have 1 function, which is their own implementation of the sound() function. This is polymorphism
4. a Home class. But we’ll talk about that later