Remove all elements from list l that have a value equal to k

removeKFromList.js

// Note: Try to solve this task in O(n) time using O(1) additional space, where n is the number of elements in the list, since this is what you'll be asked to do during an interview.

// Given a singly linked list of integers l and an integer k, remove all elements from list l that have a value equal to k.

// Example

// For l = [3, 1, 2, 3, 4, 5] and k = 3, the output should be
// removeKFromList(l, k) = [1, 2, 4, 5];
// For l = [1, 2, 3, 4, 5, 6, 7] and k = 10, the output should be
// removeKFromList(l, k) = [1, 2, 3, 4, 5, 6, 7].

// Singly-linked lists are already defined with this interface:
// function ListNode(x) {
//   this.value = x;
//   this.next = null;
// }
//
function removeKFromList(l, k) {
    
  let head = l
  let previous = null

  while(l){
    if(l.value === k){            
      if(previous===null){
          head = l = l.next
          continue
      } else {
          previous.next = l.next
          l = l.next
          continue
      }
    }
    previous = l
    l = l.next
  }
  return head
}

@andersonleite, great work you did here. I have been going through your the questions and solutions. Well done. For this particular question (removeKFromList), I think an 'else' is missing.

There should be an else in line 34, like

else {
previous = l ;
l = l.next;
}

@andersonleite, awesome solution here and very clean. One question, can you explain what happens in chaining "head = l = l.next"?

I'm guessing head and l equals to l.next?
Thanks!

comparing to much cleaner java code solution this one is barely readable for me, what is previous? it's not obvious right away