Important concepts:

  1. Finding length of the linked list
  2. Reversing a section (or entire) of the linked list
  3. Finding middle of linked list
  4. Edge cases (null especially)
  5. Slow and fast pointers

Easy/Medium

Hard