Much like arrays, linked lists start with a very definitive, constrained set of patterns that are twisted and asked. One further advantage in linked lists, is that the number of ways to approach a problem is often limited, and thus, in those cases, you need to only understand 1/2 methods.
In many cases, the linked list implementation, insert, delete methods will be provided to you and you only have to complete a function. But the one important point that is often overlooked, is that many interviews might also expect you to modify the linked list structure, and thus, it's important that you understand how to create a linked list from scratch, and modify it, such as add an extra pointer.
Also, a lot of the patterns you learned in arrays will repeat here. For instance, a two pointer approach can be used for Linked lists in some cases, sorting a linked list is another common approach, and more. Thus, make sure you're confident of implementing those patterns here.