Topic: Data Structure and Algorithm using C language.$|$

Q$8)$ Create a given linked list $($assume starts from $0$ and have consecutive elements and then an

array say ids which is a subset of the list. Now return how many sets of consecutive elements of ids

are present in the original list.

If Input: list $=[0,1,2,3,4],$ ids $=[0,3,1,4]$

Output: $2$

Explanation: $0$ and $1$ are connected, $3$ and $4$ are connected, so $0,1$ and $3,4$ are the two

consecutive pairs.

Similarly if ids $=[0,3,1,2],$ then output will be $6(0-1,0-1-2,0-1-2-3,1-2,1-2-3,2-3)$