I have written a code on deleting a node by comparing its data from the data given. If equal, it deletes the node. My problem is that my code will delete every node in the list except the last node, I couldn’t figure out what I’m doing wrong, so I seeked the help as usual

your textI was recently learning data structures through a singly linked list. When I created all the functions for my list, they all worked fine except for the delete function. flag is the head of the list and stores the number of nodes. flag1 is a representative of flag that doesn’t change flag‘s data value. When I created this function and compared it with others’ work, I didn’t find much difference. Can someone tell me what’s wrong with my logic? I know there might be some other issues that within the code like the the position of return, but it shouldn’t be the major problem.

I recently attempted to solve LeetCode problem 141, “Linked List Cycle,” #link of the problem and i figured a solution that worked but left me confused. I’d appreciate some clarification on how this particular solution functions.

There is a problem that I found myself stuck in. How do I duplicate even numbers as 2’s in a simply linked list? I tried to answer this question through AI but it didn’t give me the output I desired. Is there anyone that could show me how to solve this problem? That would be much appreciated thank you.