Do you understand the concept of a linked list? If so it should be pretty easy to visualize the algorithm for doing this. As to how to code this, that would depend on the language and how you are implementing the list. You would need to give us more specifics. Preferably, give us the code that you have so far so we can see what you have tried and then help you get the result you want.
I’ve edited your post for readability. When you enter a code block into a forum post, please precede it with a separate line of three backticks and follow it with a separate line of three backticks to make it easier to read.
You can also use the “preformatted text” tool in the editor (</>) to add backticks around text.
Because you cannot go backwards in a single-LL, you have to keep track of the currentNode and the previousNode. Once the currentNode has your target value, you insert the newNode inbetween.