nodo | Command line TODO app | Command Line Interface library

I'm doing crud (CREATE, READ, UPDATE, DELETE) table in PHP + JS + SQL and I want to do the next:

I have a table with users (I take this data from my DB):

When I click on the "Edit" icon (green edit icon), I can type on the values of my table.

I don't know how to get the exact position of the array (to show all of those users, I'm using an array, ofc) to save it in a variable for later do a query to update the information.

Do you know what I'm trying to say, guys?

Here is my code:

I want to find the shortest distances between the pink circles, for any circle at any location, and the yellow circle for a project, but I have no idea how to do it. If you have a solution with squares, I want to hear it. I have seen that you can find the distance between corner points of different squares, but that distance does not always tell you the shortest distance between two squares. This is my code:

I was writing a code that creates a list with a sublist from a txt file. But for some reason, after opening the file and trying to read the first line, the watches show that they stay empty. The file "equipos.txt" is in the same folder, and I've checked the structures and they all seemed fine. I have a similar code in another project that works fine, but it doesn't seem to work here.

i'm having trouble with a farelly simple function, i have to create a linked list with each node storing a character from a string, i made a function for that, however it doesn't seem to do anything at all

this is the function i'm talking about (variable names are in spanish, i'm sorry for that):

I have the following method that loops through a list of objects and for each node you need to execute a promise. What is the best way to execute two or more asynchronous operations in a row within a for loop?

I'm trying to update the text nodes of my D3 tree every time I press a HTML button, adding one every time, but I don't know how to do it properly without having to create the tree again. Can anyone help me with it?

The following snippet exemplarizes the state that I'm now

I'm trying to write a program, in which i have to delete and insert elements in a linked list. I have problems when I delete and after that insert. In particular if i print the list after delete-insert, i print a loop. And also, if i delete the first element i think i delete the entire list.

These are the two function, but i don't know where it's the problem (sorry for the italian comments)

I saw this Decision Tree implementation in this stream (is in spanish).

good I am making a tree using primeng, I am doing the functions to be able to delete a node from the tree, I already have this function made that works well when I want to delete a node that has no children, and also when it only has a single child, but I giving problems when deleting a node that has more than one child. I think the problem is in the for of the function but I don't quite realize that it may be