SDE - 1

You are given a linked list with a cycle. You need to find and return the Nth node from where the cycle starts in the input Linked List (moving towards the head of the linked list).

The cycle is created by connecting the last element of Linked List (i.e., tail) to some other node given in input.

Return null if no such part exists.

The counting of nodes starts from 1.

For Example:

head = [5 , 4 , 0 , -1]

pos = 2

N = 1

You have to find the node where the cycle begins and return the Nth node from that point in the direction of the head.

You are given a Circular Linked List of integers, and an integer, 'key'.

You have to write a function that finds the given key in the list and deletes it. If no such key is present, then the list remains unchanged.

For Example :

This is a visualization of the Circular Linked List, represented by:
1 2 3 4 5 -1

Note :

The Circular Linked List before/after deletion may happen to be empty. In that case, only print -1.

All integers in the list are unique.

• Explain your major project.
• Which tech stack did you use in the project, and why did you choose it?

What is Information Security? (Learn)

• Where do you live, and what are your areas of interest?
• Are you happy with the salary breakdown?