lcs | Longest Common Substring Server | HTTP library

I'm frustrated right now. I am trying to filter data in an API and trying to push them to a useState hook array and print them to the console. I am using React and really struggling. Below is the code.

I need to run a ruby project with gems and specs. When I type bundle install I received:

I was trying to train on this kata about longest common subsequences of a list which I slightly modified so that it worked with my versions of agda and the standard library (Agda 2.6.2, stdlib 1.7) which results in this code

I was reading 'Algorithms Unlocked' by Thomas H Corman and came across an approach to finding the Longest Common Subsequence which ran in O(n * m). This approach can be seen in this article too: https://www.geeksforgeeks.org/printing-longest-common-subsequence/

This seems to be the most popular and quickest approach but seemed a bit convoluted to me so I tried to write a different approach, also using dynamic programming.

My approach is recursive, in the worst case has to branch twice every call but uses memoization to save the result of previous inputs. I understand that std::map can take lg(n) time for 'find' but I assume this code can be easily altered to use a hash map instead

I'm trying to install slacker so I can do some SQL testing. I've never used Ruby before. I'm on Windows. My dev box only has access to the Internet via a proxy and I have to nominate all URls in advance.

I I downloaded and ran rubyinstaller-devkit-2.7.5-1-x64.exe (because it requires Ruby 2.4/2.5+ and 2.7.X was recommended at the Ruby site) accepting all of the defaults.

When it got to MSYS2 I hit ENTER (MSYS2 base installation and MINGW development toolchain).

I got errors in the gpg section, e.g. (but not limited to)

I was solving a Hackerrank problem that is just a plain implementation of Longest Common Subsequence

UPDATE: To solve this, I kept the checkpoint structure the same but wrote a custom train_step function, with the help of the repo linked in the accepted answer of the question linked below, which calculated the gradients and used apply_weights rather than compiling the model and using train_on_batch. This lets the full GAN state be restored. Sadly, with this method I'm fairly sure the dropout layers no longer work as the discriminator is able to work perfectly very early in the training which prevents the model from training properly. Nevertheless, the original problem is solved.

Original:

I am currently training a GAN in keras and trying to make it so that I can save the model and resume training later. Ordinarily in keras you'd simply use model.save(), however for a GAN if the discriminator and GAN (combined generator and discriminator, with discriminator weights not trainable) models are saved and loaded separately then the link between them is broken and the GAN will not function as expected. Someone asked a similar question here, How to save and resume training a GAN with multiple model parts with Tensorflow 2/ Keras, and was told to use tf.train.Checkpoint instead to save the full model at once as a checkpoint.

I've tried implementing this as follows:

I've been putting together a UDF in Excel (365) to calculate the longest common subsequence between two strings (based on this implementation in python https://www.geeksforgeeks.org/printing-longest-common-subsequence/).

When I run the UDF I get a #Value! error on the worksheet. I've done some rudimentary debugging but I'm new to VBA and running into a wall. The message box statements in the code are simply for said crude debugging.

I believe the issue is in my manipulation of the L array. It seems to get to the first case in the first set of for loops then quit as it's evaluating L(i, j,) = 0. Any pointers on where I'm going wrong?

In the worksheet I'm using =ClosestMatch("aabbaaaa", "aaaabbaa") and getting #VALUE! as a result.

This is the VBA code for the UDF I'm attempting:

I'm trying to find the LCS of more than one letter in two strings using a k value. For example, if