substructure | JavaScript only Mindustry mod , contains examples

I am trying to use a variable inside a substructure. I guess the variable should be of integer data type, and I am trying to add a loop here but it my data type is list since it contains multiple integers.

I can easily use tf.map_fn when the function has one output:

I building a web-component and within its constructor using template to initialize its substructure. A part of this substructure is another web-component whose setter method I wish to call. I get the sub-component by querying DOM tree that was created via the template, but through this only standard Element properties are accessible.

It is a bit of a complex problem and it might be I am missing something fundamental. It seems to be related with the fact that one web component uses another web component via the template clone. It was suggested in this question that the problem might be due to sub-component not being loaded/defined. I don't understand this, especially since I can not get the proposed solution to work. I would also assume that whatever JS engine browser is running is smart enough to resolve import dependencies and does not run the code if its imports are not ready. Am I over simplistic with this?

A simple reproducible example that fails deterministically is indispensable. So I have managed to created a simple replica that demonstrates the problem. For the purpose of consistency I have used the same multi-file structure of the design as in the original:

• component_a.js

Consider an array of n coins with positive integer value and two players player1 and player2. Each player takes the coins turn after turn till there are coins left. The one with the
maximum value wins. The number of coins that a player can take is governed by a variable S initially =1, and a player can take the k coins starting from left contiguously where 1<=k
<=2*S And after a player takes say k coins the value of S becomes max(S,k). Also, there is an assumption that both players play the optimal strategy. We have to find the maximum amount of
coin value that player 1 can take in the game
For example: if the input is [3,6,8,5,4], the output should be 12 because if player1 takes one coin, player 2 takes 2 coins, and then player one retakes 2 coins. So player1
will have 3 + 5 + 4 = 12.
My Thoughts: I feel there could be some way to do it using dynamic programming, but I cannot find the subproblems or optimal substructure. The conditions look very complex. Any ideas on how to approach this?

I have the following code:

I have array with nested objects, want to add sum of value and make an object in javascript.

I created a tf.keras model that has BERT and I want to train and save it for further use. Loading this model is a big issue cause I keep getting error: ValueError: The two structures don't have the same nested structure.

I simplified the model a lot, to see where is the problem exactly. The code is pretty simple:

As I understand it you need a problem to have an optimal substructure for dynamic programming to be applicable.

Here's what I don't get.

Take the following Array

A = [1, 6, -3, 1, 5, -1]

As per wikipedia:

In computer science, a problem is said to have optimal substructure if an optimal solution can be constructed from optimal solutions of its subproblems. This property is used to determine the usefulness of dynamic programming and greedy algorithms for a problem.

Here's where my confusion lies.

If I was asked to find the max subarray of size 3 in the array presented above the answer would be 1, 5, -1 (total sum 5).

But if I were to find the max subarray of size 2 the answer would be (1,6) which has no shared elements with the previous answer.

I must not be understanding what optimal substructure means but I don't see how.

I have a function input_preprocess that I am using in the data pipeline: