<ul><li>This week experience: My second week in practicing data structure problems.</li><li>Solved three linked list related problems: Intersection of two linked lists, Remove nth node from end of list, and Reverse nodes in k-group.</li><li>Intersection of two linked lists can be solved using two pointers to determine if they meet at a common node.</li><li>Remove nth node from end of list can be achieved by using two pointers, fast and slow, to find the node just before the nth node.</li><li>Reverse nodes in k-group involves creating a dummy node and iterating to find the kth node, then reversing the linked list in groups.</li><li>Experience and practice are key in improving problem-solving skills.</li></ul>

This week experience

Discover more