Feeling guilt tripped in linked list

Question

Okay, so I have been doing competitive programming for the past few days in C++. And day before yesterday, I stumbled upon this concept of linked list.

Now, what I do while implementing most problems pertaining to linked list is that I store all the values of the linked list nodes in a vector, and do operations on them which has been asked as per the question, then refill the nodes with the newly updated values of the vector. Now, most of the questions can be done by me really easily, as I am pretty comfortable with using vectors now. I just wanted to ask this community if this was a bad approach towards using linked list, and should I stop using it altogether.

I will give an example to sort a linked list in $O(N\log N)$ time, which I used. Following is a function that sorts a linked list-

ListNode* Solution::sortList(ListNode* A) {
    vector<int> vect;
    ListNode* temp=A;
    while(A!=NULL)
    {
        vect.push_back(A->val);
        A=A->next;
    }
    A=temp;
    sort(vect.begin(), vect.end());
    for(int i=0; i<vect.size(); i++)
    {
        A->val=vect[i];
        A=A->next;
    }
    return temp;
}

Answer 1

Let's show that $\{a^n b^n : n \geq 0\}$ is not regular using Myhill's criterion (there are infinitely many equivalence classes):

The pumping lemma shows that $\{a^n b^n : n \geq 0\}$ is not regular. According to Myhill's criterion, if a language is not regular then it has infinitely many equivalence classes. Therefore the language has infinitely many equivalence classes, and consequently, by Myhill's criterion is not regular.

This may sound silly, but it is very similar to how you are using vectors to solve questions "using linked lists".

The alternative is to look for algorithms that can be implemented directly on linked lists. For example, one sorting algorithm which can be implemented directly is merge sort. Merge sort consists of the following operations:

• Divide the input into two sublists of nearly equal size. Easy to do on a linked list using a simple scan.
• Recursively sort each sublist.
• Merge the two sorted sublists. The merge algorithm is also easy to implement on a linked list.

In contrast, an algorithm like quicksort seems hard to implement directly without having random access.