diff --git a/npm/packs/utils/projects/utils/src/lib/linked-list.spec.ts b/npm/packs/utils/projects/utils/src/lib/linked-list.spec.ts
new file mode 100644
index 0000000000..d84ea0de9a
--- /dev/null
+++ b/npm/packs/utils/projects/utils/src/lib/linked-list.spec.ts
@@ -0,0 +1,1532 @@
+import { LinkedList, ListNode } from './linked-list';
+
+describe('Linked List (Doubly)', () => {
+  let list: LinkedList;
+
+  beforeEach(() => (list = new LinkedList()));
+
+  describe('#length', () => {
+    it('should initially be 0', () => {
+      expect(list.length).toBe(0);
+    });
+  });
+
+  describe('#head', () => {
+    it('should initially be undefined', () => {
+      expect(list.head).toBeUndefined();
+    });
+  });
+
+  describe('#tail', () => {
+    it('should initially be undefined', () => {
+      expect(list.tail).toBeUndefined();
+    });
+  });
+
+  describe('#add', () => {
+    describe('#head', () => {
+      it('should add node to the head of the list', () => {
+        list.addHead('a');
+
+        // "a"
+
+        expect(list.head.value).toBe('a');
+        expect(list.tail.value).toBe('a');
+      });
+
+      it('should create reference to previous and next nodes', () => {
+        list.add('a').head();
+        list.add('b').head();
+        list.add('c').head();
+
+        // "c" <-> "b" <-> "a"
+
+        expect(list.length).toBe(3);
+        expect(list.head.value).toBe('c');
+        expect(list.head.next.value).toBe('b');
+        expect(list.head.next.next.value).toBe('a');
+        expect(list.head.previous).toBeUndefined();
+        expect(list.tail.value).toBe('a');
+        expect(list.tail.previous.value).toBe('b');
+        expect(list.tail.previous.previous.value).toBe('c');
+        expect(list.tail.next).toBeUndefined();
+      });
+    });
+
+    describe('#tail', () => {
+      it('should add node to the tail of the list', () => {
+        list.addTail('a');
+
+        // "a"
+
+        expect(list.head.value).toBe('a');
+        expect(list.tail.value).toBe('a');
+        expect(list.tail.next).toBeUndefined();
+      });
+
+      it('should create reference to previous and next nodes', () => {
+        list.add('a').tail();
+        list.add('b').tail();
+        list.add('c').tail();
+
+        // "a" <-> "b" <-> "c"
+
+        expect(list.length).toBe(3);
+        expect(list.head.value).toBe('a');
+        expect(list.head.next.value).toBe('b');
+        expect(list.head.next.next.value).toBe('c');
+        expect(list.head.previous).toBeUndefined();
+        expect(list.tail.value).toBe('c');
+        expect(list.tail.previous.value).toBe('b');
+        expect(list.tail.previous.previous.value).toBe('a');
+        expect(list.tail.next).toBeUndefined();
+      });
+    });
+
+    describe('#after', () => {
+      it('should add a node after node with given value', () => {
+        list.add('a').tail();
+
+        // "a"
+
+        list.add('b').after('a');
+        list.add('c').after('b');
+
+        // "a" <-> "b" <-> "c"
+
+        expect(list.length).toBe(3);
+        expect(list.head.value).toBe('a');
+        expect(list.head.next.value).toBe('b');
+        expect(list.head.next.next.value).toBe('c');
+        expect(list.tail.value).toBe('c');
+        expect(list.tail.previous.value).toBe('b');
+        expect(list.tail.previous.previous.value).toBe('a');
+      });
+
+      it('should add a node to tail if given value is not found', () => {
+        list.add('a').tail();
+
+        // "a"
+
+        list.add('b').after('x');
+
+        // "a" <-> "b"
+
+        expect(list.length).toBe(2);
+        expect(list.head.value).toBe('a');
+        expect(list.head.next.value).toBe('b');
+        expect(list.tail.value).toBe('b');
+        expect(list.tail.previous.value).toBe('a');
+      });
+
+      it('should be able to receive a custom compareFn', () => {
+        list.add({ x: 1 }).tail();
+        list.add({ x: 2 }).tail();
+        list.add({ x: 3 }).tail();
+
+        // {"x":1} <-> {"x":2} <-> {"x":3}
+
+        list.add({ x: 0 }).after({ x: 1 }, (v1: X, v2: X) => v1.x === v2.x);
+
+        // {"x":1} <-> {"x":0} <-> {"x":2} <-> {"x":3}
+
+        expect(list.length).toBe(4);
+        expect(list.head.value.x).toBe(1);
+        expect(list.head.next.value.x).toBe(0);
+        expect(list.head.next.next.value.x).toBe(2);
+        expect(list.head.next.next.next.value.x).toBe(3);
+        expect(list.tail.value.x).toBe(3);
+        expect(list.tail.previous.value.x).toBe(2);
+        expect(list.tail.previous.previous.value.x).toBe(0);
+        expect(list.tail.previous.previous.previous.value.x).toBe(1);
+      });
+    });
+
+    describe('#before', () => {
+      it('should add a node before node with given value', () => {
+        list.add('c').tail();
+
+        // "c"
+
+        list.add('b').before('c');
+        list.add('a').before('b');
+
+        // "a" <-> "b" <-> "c"
+
+        expect(list.length).toBe(3);
+        expect(list.head.value).toBe('a');
+        expect(list.head.next.value).toBe('b');
+        expect(list.head.next.next.value).toBe('c');
+        expect(list.tail.value).toBe('c');
+        expect(list.tail.previous.value).toBe('b');
+        expect(list.tail.previous.previous.value).toBe('a');
+      });
+
+      it('should add a node to head if given value is not found', () => {
+        list.add('b').tail();
+
+        // "a"
+
+        list.add('a').before('x');
+
+        // "a" <-> "b"
+
+        expect(list.length).toBe(2);
+        expect(list.head.value).toBe('a');
+        expect(list.head.next.value).toBe('b');
+        expect(list.tail.value).toBe('b');
+        expect(list.tail.previous.value).toBe('a');
+      });
+
+      it('should be able to receive a custom compareFn', () => {
+        list.add({ x: 1 }).tail();
+        list.add({ x: 2 }).tail();
+        list.add({ x: 3 }).tail();
+
+        // {"x":1} <-> {"x":2} <-> {"x":3}
+
+        list.add({ x: 0 }).before({ x: 2 }, (v1: X, v2: X) => v1.x === v2.x);
+
+        // {"x":1} <-> {"x":0} <-> {"x":2} <-> {"x":3}
+
+        expect(list.length).toBe(4);
+        expect(list.head.value.x).toBe(1);
+        expect(list.head.next.value.x).toBe(0);
+        expect(list.head.next.next.value.x).toBe(2);
+        expect(list.head.next.next.next.value.x).toBe(3);
+        expect(list.tail.value.x).toBe(3);
+        expect(list.tail.previous.value.x).toBe(2);
+        expect(list.tail.previous.previous.value.x).toBe(0);
+        expect(list.tail.previous.previous.previous.value.x).toBe(1);
+      });
+    });
+
+    describe('#byIndex', () => {
+      it('should add a node at given index', () => {
+        list.add('a').tail();
+        list.add('b').tail();
+        list.add('c').tail();
+
+        // "a" <-> "b" <-> "c"
+
+        list.add('x').byIndex(1);
+
+        // "a" <-> "x" <-> "b" <-> "c"
+
+        list.add('y').byIndex(3);
+
+        // "a" <-> "x" <-> "b" <-> "y" <-> "c"
+
+        expect(list.length).toBe(5);
+        expect(list.head.value).toBe('a');
+        expect(list.head.next.value).toBe('x');
+        expect(list.head.next.next.value).toBe('b');
+        expect(list.head.next.next.next.value).toBe('y');
+        expect(list.head.next.next.next.next.value).toBe('c');
+        expect(list.tail.value).toBe('c');
+        expect(list.tail.previous.value).toBe('y');
+        expect(list.tail.previous.previous.value).toBe('b');
+        expect(list.tail.previous.previous.previous.value).toBe('x');
+        expect(list.tail.previous.previous.previous.previous.value).toBe('a');
+      });
+
+      it('should add a node to head if given index is zero', () => {
+        list.add('a').tail();
+        list.add('b').tail();
+        list.add('c').tail();
+
+        // "a" <-> "b" <-> "c"
+
+        list.add('x').byIndex(0);
+
+        // "x" <-> "a" <-> "b" <-> "c"
+
+        expect(list.length).toBe(4);
+        expect(list.head.value).toBe('x');
+        expect(list.head.next.value).toBe('a');
+        expect(list.head.next.next.value).toBe('b');
+        expect(list.head.next.next.next.value).toBe('c');
+        expect(list.tail.value).toBe('c');
+        expect(list.tail.previous.value).toBe('b');
+        expect(list.tail.previous.previous.value).toBe('a');
+        expect(list.tail.previous.previous.previous.value).toBe('x');
+      });
+
+      it('should add a node to tail if given index more than size', () => {
+        list.add('a').tail();
+        list.add('b').tail();
+        list.add('c').tail();
+
+        // "a" <-> "b" <-> "c"
+
+        list.add('x').byIndex(4);
+
+        // "a" <-> "b" <-> "c" <-> "x"
+
+        expect(list.length).toBe(4);
+        expect(list.head.value).toBe('a');
+        expect(list.head.next.value).toBe('b');
+        expect(list.head.next.next.value).toBe('c');
+        expect(list.head.next.next.next.value).toBe('x');
+        expect(list.tail.value).toBe('x');
+        expect(list.tail.previous.value).toBe('c');
+        expect(list.tail.previous.previous.value).toBe('b');
+        expect(list.tail.previous.previous.previous.value).toBe('a');
+      });
+
+      it('should be able to add a node at given index counting from right to left', () => {
+        list.add('a').tail();
+        list.add('b').tail();
+        list.add('c').tail();
+
+        // "a" <-> "b" <-> "c"
+
+        list.add('x').byIndex(-1);
+
+        // "a" <-> "b" <-> "x" <-> "c"
+
+        expect(list.length).toBe(4);
+        expect(list.head.value).toBe('a');
+        expect(list.head.next.value).toBe('b');
+        expect(list.head.next.next.value).toBe('x');
+        expect(list.head.next.next.next.value).toBe('c');
+        expect(list.tail.value).toBe('c');
+        expect(list.tail.previous.value).toBe('x');
+        expect(list.tail.previous.previous.value).toBe('b');
+        expect(list.tail.previous.previous.previous.value).toBe('a');
+      });
+
+      it('should add a node to head if given index is less than minus size', () => {
+        list.add('a').tail();
+        list.add('b').tail();
+        list.add('c').tail();
+
+        // "a" <-> "b" <-> "c"
+
+        list.add('x').byIndex(-4);
+
+        // "x" <-> "a" <-> "b" <-> "c"
+
+        expect(list.length).toBe(4);
+        expect(list.head.value).toBe('x');
+        expect(list.head.next.value).toBe('a');
+        expect(list.head.next.next.value).toBe('b');
+        expect(list.head.next.next.next.value).toBe('c');
+        expect(list.tail.value).toBe('c');
+        expect(list.tail.previous.value).toBe('b');
+        expect(list.tail.previous.previous.value).toBe('a');
+        expect(list.tail.previous.previous.previous.value).toBe('x');
+      });
+    });
+  });
+
+  describe('#addMany', () => {
+    describe('#head', () => {
+      it('should add multiple nodes to the head of the list', () => {
+        list.add('x').head();
+
+        // "x"
+
+        list.addMany(['a', 'b', 'c']).head();
+
+        // "a" <-> "b" <-> "c" <-> "x"
+
+        expect(list.length).toBe(4);
+        expect(list.head.value).toBe('a');
+        expect(list.head.next.value).toBe('b');
+        expect(list.head.next.next.value).toBe('c');
+        expect(list.head.next.next.next.value).toBe('x');
+        expect(list.head.previous).toBeUndefined();
+        expect(list.tail.value).toBe('x');
+        expect(list.tail.previous.value).toBe('c');
+        expect(list.tail.previous.previous.value).toBe('b');
+        expect(list.tail.previous.previous.previous.value).toBe('a');
+        expect(list.tail.next).toBeUndefined();
+      });
+    });
+
+    describe('#tail', () => {
+      it('should add multiple nodes to the tail of the list', () => {
+        list.add('x').tail();
+
+        // "x"
+
+        list.addMany(['a', 'b', 'c']).tail();
+
+        // "x" <-> "a" <-> "b" <-> "c"
+
+        expect(list.length).toBe(4);
+        expect(list.head.value).toBe('x');
+        expect(list.head.next.value).toBe('a');
+        expect(list.head.next.next.value).toBe('b');
+        expect(list.head.next.next.next.value).toBe('c');
+        expect(list.head.previous).toBeUndefined();
+        expect(list.tail.value).toBe('c');
+        expect(list.tail.previous.value).toBe('b');
+        expect(list.tail.previous.previous.value).toBe('a');
+        expect(list.tail.previous.previous.previous.value).toBe('x');
+        expect(list.tail.next).toBeUndefined();
+      });
+    });
+
+    describe('#after', () => {
+      it('should add multiple nodes after node with given value', () => {
+        list.add('a').tail();
+
+        // "a"
+
+        list.addMany(['b', 'c']).after('a');
+
+        // "a" <-> "b" <-> "c"
+
+        list.addMany(['x', 'y', 'z']).after('b');
+
+        // "a" <-> "b" <-> "x" <-> "y" <-> "z" <-> "c"
+
+        expect(list.length).toBe(6);
+        expect(list.head.value).toBe('a');
+        expect(list.head.next.value).toBe('b');
+        expect(list.head.next.next.value).toBe('x');
+        expect(list.head.next.next.next.value).toBe('y');
+        expect(list.head.next.next.next.next.value).toBe('z');
+        expect(list.head.next.next.next.next.next.value).toBe('c');
+        expect(list.tail.value).toBe('c');
+        expect(list.tail.previous.value).toBe('z');
+        expect(list.tail.previous.previous.value).toBe('y');
+        expect(list.tail.previous.previous.previous.value).toBe('x');
+        expect(list.tail.previous.previous.previous.previous.value).toBe('b');
+        expect(list.tail.previous.previous.previous.previous.previous.value).toBe('a');
+      });
+
+      it('should add multiple nodes to tail if given value is not found', () => {
+        list.add('a').tail();
+
+        // "a"
+
+        list.addMany(['b', 'c']).after('x');
+
+        // "a" <-> "b" <-> "c"
+
+        expect(list.length).toBe(3);
+        expect(list.head.value).toBe('a');
+        expect(list.head.next.value).toBe('b');
+        expect(list.head.next.next.value).toBe('c');
+        expect(list.tail.value).toBe('c');
+        expect(list.tail.previous.value).toBe('b');
+        expect(list.tail.previous.previous.value).toBe('a');
+      });
+
+      it('should be able to receive a custom compareFn', () => {
+        list.addMany([{ x: 1 }, { x: 2 }, { x: 3 }]).tail();
+
+        // {"x":1} <-> {"x":2} <-> {"x":3}
+
+        list.addMany([{ x: 4 }, { x: 5 }]).after({ x: 1 }, (v1: X, v2: X) => v1.x === v2.x);
+
+        // {"x":1} <-> {"x":4} <-> {"x":5} <-> {"x":2} <-> {"x":3}
+
+        expect(list.length).toBe(5);
+        expect(list.head.value.x).toBe(1);
+        expect(list.head.next.value.x).toBe(4);
+        expect(list.head.next.next.value.x).toBe(5);
+        expect(list.head.next.next.next.value.x).toBe(2);
+        expect(list.head.next.next.next.next.value.x).toBe(3);
+        expect(list.tail.value.x).toBe(3);
+        expect(list.tail.previous.value.x).toBe(2);
+        expect(list.tail.previous.previous.value.x).toBe(5);
+        expect(list.tail.previous.previous.previous.value.x).toBe(4);
+        expect(list.tail.previous.previous.previous.previous.value.x).toBe(1);
+      });
+
+      it('should not change the list when empty array given as value', () => {
+        list.add('a').tail();
+
+        // "a"
+
+        list.addMany([]).after('a');
+
+        // "a"
+
+        expect(list.length).toBe(1);
+        expect(list.head.value).toBe('a');
+        expect(list.tail.value).toBe('a');
+      });
+    });
+
+    describe('#before', () => {
+      it('should add multiple nodes before node with given value', () => {
+        list.add('c').tail();
+
+        // "c"
+
+        list.addMany(['a', 'b']).before('c');
+
+        // "a" <-> "b" <-> "c"
+
+        list.addMany(['x', 'y', 'z']).before('b');
+
+        // "a" <-> "x" <-> "y" <-> "z" <-> "b" <-> "c"
+
+        expect(list.length).toBe(6);
+        expect(list.head.value).toBe('a');
+        expect(list.head.next.value).toBe('x');
+        expect(list.head.next.next.value).toBe('y');
+        expect(list.head.next.next.next.value).toBe('z');
+        expect(list.head.next.next.next.next.value).toBe('b');
+        expect(list.head.next.next.next.next.next.value).toBe('c');
+        expect(list.tail.value).toBe('c');
+        expect(list.tail.previous.value).toBe('b');
+        expect(list.tail.previous.previous.value).toBe('z');
+        expect(list.tail.previous.previous.previous.value).toBe('y');
+        expect(list.tail.previous.previous.previous.previous.value).toBe('x');
+        expect(list.tail.previous.previous.previous.previous.previous.value).toBe('a');
+      });
+
+      it('should add multiple nodes to head if given value is not found', () => {
+        list.add('c').tail();
+
+        // "c"
+
+        list.addMany(['a', 'b']).before('x');
+
+        // "a" <-> "b" <-> "c"
+
+        expect(list.length).toBe(3);
+        expect(list.head.value).toBe('a');
+        expect(list.head.next.value).toBe('b');
+        expect(list.head.next.next.value).toBe('c');
+        expect(list.tail.value).toBe('c');
+        expect(list.tail.previous.value).toBe('b');
+        expect(list.tail.previous.previous.value).toBe('a');
+      });
+
+      it('should be able to receive a custom compareFn', () => {
+        list.addMany([{ x: 1 }, { x: 2 }, { x: 3 }]).tail();
+
+        // {"x":1} <-> {"x":2} <-> {"x":3}
+
+        list.addMany([{ x: 4 }, { x: 5 }]).before({ x: 3 }, (v1: X, v2: X) => v1.x === v2.x);
+
+        // {"x":1} <-> {"x":2} <-> {"x":4} <-> {"x":5} <-> {"x":3}
+
+        expect(list.length).toBe(5);
+        expect(list.head.value.x).toBe(1);
+        expect(list.head.next.value.x).toBe(2);
+        expect(list.head.next.next.value.x).toBe(4);
+        expect(list.head.next.next.next.value.x).toBe(5);
+        expect(list.head.next.next.next.next.value.x).toBe(3);
+        expect(list.tail.value.x).toBe(3);
+        expect(list.tail.previous.value.x).toBe(5);
+        expect(list.tail.previous.previous.value.x).toBe(4);
+        expect(list.tail.previous.previous.previous.value.x).toBe(2);
+        expect(list.tail.previous.previous.previous.previous.value.x).toBe(1);
+      });
+
+      it('should not change the list when empty array given as value', () => {
+        list.add('a').tail();
+
+        // "a"
+
+        list.addMany([]).before('a');
+
+        // "a"
+
+        expect(list.length).toBe(1);
+        expect(list.head.value).toBe('a');
+        expect(list.tail.value).toBe('a');
+      });
+    });
+
+    describe('#byIndex', () => {
+      it('should add multiple nodes starting from given index', () => {
+        list.addMany(['a', 'b', 'c']).tail();
+
+        // "a" <-> "b" <-> "c"
+
+        list.addMany(['x', 'y']).byIndex(1);
+
+        // "a" <-> "x" <-> "y" <-> "b" <-> "c"
+
+        list.addMany(['z']).byIndex(4);
+
+        // "a" <-> "x" <-> "y" <-> "b" <-> "z" <-> "c"
+
+        expect(list.length).toBe(6);
+        expect(list.head.value).toBe('a');
+        expect(list.head.next.value).toBe('x');
+        expect(list.head.next.next.value).toBe('y');
+        expect(list.head.next.next.next.value).toBe('b');
+        expect(list.head.next.next.next.next.value).toBe('z');
+        expect(list.head.next.next.next.next.next.value).toBe('c');
+        expect(list.tail.value).toBe('c');
+        expect(list.tail.previous.value).toBe('z');
+        expect(list.tail.previous.previous.value).toBe('b');
+        expect(list.tail.previous.previous.previous.value).toBe('y');
+        expect(list.tail.previous.previous.previous.previous.value).toBe('x');
+        expect(list.tail.previous.previous.previous.previous.previous.value).toBe('a');
+      });
+
+      it('should add multiple nodes to head if given index is zero', () => {
+        list.addMany(['a', 'b', 'c']).tail();
+
+        // "a" <-> "b" <-> "c"
+
+        list.addMany(['x', 'y']).byIndex(0);
+
+        // "x" <-> "y" <-> "a" <-> "b" <-> "c"
+
+        expect(list.length).toBe(5);
+        expect(list.head.value).toBe('x');
+        expect(list.head.next.value).toBe('y');
+        expect(list.head.next.next.value).toBe('a');
+        expect(list.head.next.next.next.value).toBe('b');
+        expect(list.head.next.next.next.next.value).toBe('c');
+        expect(list.tail.value).toBe('c');
+        expect(list.tail.previous.value).toBe('b');
+        expect(list.tail.previous.previous.value).toBe('a');
+        expect(list.tail.previous.previous.previous.value).toBe('y');
+        expect(list.tail.previous.previous.previous.previous.value).toBe('x');
+      });
+
+      it('should add multiple nodes to tail if given index more than size', () => {
+        list.addMany(['a', 'b', 'c']).tail();
+
+        // "a" <-> "b" <-> "c"
+
+        list.addMany(['x', 'y']).byIndex(4);
+
+        // "a" <-> "b" <-> "c" <-> "x" <-> "y"
+
+        expect(list.length).toBe(5);
+        expect(list.head.value).toBe('a');
+        expect(list.head.next.value).toBe('b');
+        expect(list.head.next.next.value).toBe('c');
+        expect(list.head.next.next.next.value).toBe('x');
+        expect(list.head.next.next.next.next.value).toBe('y');
+        expect(list.tail.value).toBe('y');
+        expect(list.tail.previous.value).toBe('x');
+        expect(list.tail.previous.previous.value).toBe('c');
+        expect(list.tail.previous.previous.previous.value).toBe('b');
+        expect(list.tail.previous.previous.previous.previous.value).toBe('a');
+      });
+
+      it('should be able to add multiple nodes at given index counting from right to left', () => {
+        list.addMany(['a', 'b', 'c']).tail();
+
+        // "a" <-> "b" <-> "c"
+
+        list.addMany(['x', 'y']).byIndex(-1);
+
+        // "a" <-> "b" <-> "x" <-> "y" <-> "c"
+
+        expect(list.length).toBe(5);
+        expect(list.head.value).toBe('a');
+        expect(list.head.next.value).toBe('b');
+        expect(list.head.next.next.value).toBe('x');
+        expect(list.head.next.next.next.value).toBe('y');
+        expect(list.head.next.next.next.next.value).toBe('c');
+        expect(list.tail.value).toBe('c');
+        expect(list.tail.previous.value).toBe('y');
+        expect(list.tail.previous.previous.value).toBe('x');
+        expect(list.tail.previous.previous.previous.value).toBe('b');
+        expect(list.tail.previous.previous.previous.previous.value).toBe('a');
+      });
+
+      it('should add a node to head if given index is less than minus size', () => {
+        list.addMany(['a', 'b', 'c']).tail();
+
+        // "a" <-> "b" <-> "c"
+
+        list.addMany(['x', 'y']).byIndex(-4);
+
+        // "x" <-> "y" <-> "a" <-> "b" <-> "c"
+
+        expect(list.length).toBe(5);
+        expect(list.head.value).toBe('x');
+        expect(list.head.next.value).toBe('y');
+        expect(list.head.next.next.value).toBe('a');
+        expect(list.head.next.next.next.value).toBe('b');
+        expect(list.head.next.next.next.next.value).toBe('c');
+        expect(list.tail.value).toBe('c');
+        expect(list.tail.previous.value).toBe('b');
+        expect(list.tail.previous.previous.value).toBe('a');
+        expect(list.tail.previous.previous.previous.value).toBe('y');
+        expect(list.tail.previous.previous.previous.previous.value).toBe('x');
+      });
+    });
+  });
+
+  describe('#find', () => {
+    it('should return the first node found based on given predicate', () => {
+      list.add('a').tail();
+      list.add('x').tail();
+      list.add('b').tail();
+      list.add('x').tail();
+      list.add('c').tail();
+
+      // "a" <-> "x" <-> "b" <-> "x" <-> "c"
+
+      const found1 = list.find(node => node.previous && node.previous.value === 'a');
+
+      expect(found1.value).toBe('x');
+      expect(found1.previous.value).toBe('a');
+      expect(found1.next.value).toBe('b');
+
+      // "a" <-> "x" <-> "b" <-> "x" <-> "c"
+
+      const found2 = list.find(node => node.next && node.next.value === 'c');
+
+      expect(found2.value).toBe('x');
+      expect(found2.previous.value).toBe('b');
+      expect(found2.next.value).toBe('c');
+    });
+
+    it('should return undefined when list is empty', () => {
+      const found = list.find(node => node.value === 'x');
+
+      expect(found).toBeUndefined();
+    });
+
+    it('should return undefined when predicate finds no match', () => {
+      list.add('a').tail();
+      list.add('b').tail();
+      list.add('c').tail();
+
+      // "a" <-> "b" <-> "c"
+
+      const found = list.find(node => node.value === 'x');
+
+      expect(found).toBeUndefined();
+      expect(list.length).toBe(3);
+      expect(list.head.value).toBe('a');
+      expect(list.head.next.value).toBe('b');
+      expect(list.head.next.next.value).toBe('c');
+      expect(list.tail.value).toBe('c');
+      expect(list.tail.previous.value).toBe('b');
+      expect(list.tail.previous.previous.value).toBe('a');
+    });
+  });
+
+  describe('#findIndex', () => {
+    it('should return the index of the first node found based on given predicate', () => {
+      list.add('a').tail();
+      list.add('x').tail();
+      list.add('b').tail();
+      list.add('x').tail();
+      list.add('c').tail();
+
+      // "a" <-> "x" <-> "b" <-> "x" <-> "c"
+
+      const index1 = list.findIndex(node => node.previous && node.previous.value === 'a');
+
+      expect(index1).toBe(1);
+
+      // "a" <-> "x" <-> "b" <-> "x" <-> "c"
+
+      const index2 = list.findIndex(node => node.next && node.next.value === 'c');
+
+      expect(index2).toBe(3);
+    });
+
+    it('should return -1 when list is empty', () => {
+      const index = list.findIndex(node => node.value === 'x');
+
+      expect(index).toBe(-1);
+    });
+
+    it('should return -1 when no match is found', () => {
+      list.add('a').tail();
+      list.add('b').tail();
+      list.add('c').tail();
+
+      // "a" <-> "b" <-> "c"
+
+      const index = list.findIndex(node => node.value === 'x');
+
+      expect(index).toBe(-1);
+      expect(list.length).toBe(3);
+      expect(list.head.value).toBe('a');
+      expect(list.head.next.value).toBe('b');
+      expect(list.head.next.next.value).toBe('c');
+      expect(list.tail.value).toBe('c');
+      expect(list.tail.previous.value).toBe('b');
+      expect(list.tail.previous.previous.value).toBe('a');
+    });
+  });
+
+  describe('#forEach', () => {
+    it('should call given function for each node of the list', () => {
+      const a = list.add('a').tail();
+      const b = list.add('b').tail();
+      const c = list.add('c').tail();
+
+      // "a" <-> "b" <-> "c"
+
+      const spy = jest.fn();
+      list.forEach(spy);
+
+      expect(spy.mock.calls).toEqual([
+        [a, 0, list],
+        [b, 1, list],
+        [c, 2, list],
+      ]);
+    });
+
+    it('should not call given function when list is empty', () => {
+      const spy = jest.fn();
+      list.forEach(spy);
+
+      expect(spy).not.toHaveBeenCalled();
+    });
+  });
+
+  describe('#drop', () => {
+    describe('#head', () => {
+      it('should return undefined when there is no head', () => {
+        const dropped = list.drop().head();
+        expect(dropped).toBeUndefined();
+      });
+
+      it('should remove the node from the head of the list', () => {
+        list.add('a').tail();
+        list.add('b').tail();
+        list.add('c').tail();
+
+        // "a" <-> "b" <-> "c"
+
+        list.drop().head();
+
+        // "b" <-> "c"
+
+        expect(list.length).toBe(2);
+        expect(list.head.value).toBe('b');
+        expect(list.head.next.value).toBe('c');
+        expect(list.head.previous).toBeUndefined();
+        expect(list.tail.value).toBe('c');
+        expect(list.tail.previous.value).toBe('b');
+        expect(list.tail.next).toBeUndefined();
+
+        // "b" <-> "c"
+
+        list.drop().head();
+        list.drop().head();
+
+        expect(list.length).toBe(0);
+        expect(list.head).toBeUndefined();
+        expect(list.tail).toBeUndefined();
+      });
+    });
+
+    describe('#tail', () => {
+      it('should return undefined when there is no tail', () => {
+        const dropped = list.drop().tail();
+        expect(dropped).toBeUndefined();
+      });
+
+      it('should remove the node from the tail of the list', () => {
+        list.add('a').tail();
+        list.add('b').tail();
+        list.add('c').tail();
+
+        // "a" <-> "b" <-> "c"
+
+        list.drop().tail();
+
+        // "a" <-> "b"
+
+        expect(list.length).toBe(2);
+        expect(list.head.value).toBe('a');
+        expect(list.head.next.value).toBe('b');
+        expect(list.head.previous).toBeUndefined();
+        expect(list.tail.value).toBe('b');
+        expect(list.tail.previous.value).toBe('a');
+        expect(list.tail.next).toBeUndefined();
+
+        // "a" <-> "b"
+
+        list.drop().tail();
+        list.drop().tail();
+
+        expect(list.length).toBe(0);
+        expect(list.head).toBeUndefined();
+        expect(list.tail).toBeUndefined();
+      });
+    });
+
+    describe('#byIndex', () => {
+      it('should remove the node at given index', () => {
+        list.add('a').tail();
+        list.add('b').tail();
+        list.add('c').tail();
+        list.add('d').tail();
+        list.add('e').tail();
+
+        // "a" <-> "b" <-> "c" <-> "d" <-> "e"
+
+        list.drop().byIndex(1);
+
+        // "a" <-> "c" <-> "d" <-> "e"
+
+        list.drop().byIndex(-2);
+
+        // "a" <-> "c" <-> "e"
+
+        expect(list.length).toBe(3);
+        expect(list.head.value).toBe('a');
+        expect(list.head.next.value).toBe('c');
+        expect(list.head.next.next.value).toBe('e');
+        expect(list.tail.value).toBe('e');
+        expect(list.tail.previous.value).toBe('c');
+        expect(list.tail.previous.previous.value).toBe('a');
+
+        // "a" <-> "c" <-> "e"
+
+        list.drop().byIndex(2);
+        list.drop().byIndex(1);
+        list.drop().byIndex(0);
+
+        expect(list.length).toBe(0);
+        expect(list.head).toBeUndefined();
+        expect(list.tail).toBeUndefined();
+      });
+
+      it('should return undefined when list is empty', () => {
+        const dropped = list.drop().byIndex(0);
+        expect(dropped).toBeUndefined();
+      });
+
+      it('should return undefined when given index does not exist', () => {
+        list.add('a').tail();
+        list.add('b').tail();
+        list.add('c').tail();
+
+        // "a" <-> "b" <-> "c"
+
+        const dropped1 = list.drop().byIndex(4);
+
+        // "a" <-> "b" <-> "c"
+
+        expect(dropped1).toBeUndefined();
+        expect(list.length).toBe(3);
+        expect(list.head.value).toBe('a');
+        expect(list.head.next.value).toBe('b');
+        expect(list.head.next.next.value).toBe('c');
+        expect(list.tail.value).toBe('c');
+        expect(list.tail.previous.value).toBe('b');
+        expect(list.tail.previous.previous.value).toBe('a');
+
+        // "a" <-> "b" <-> "c"
+
+        const dropped2 = list.drop().byIndex(-4);
+
+        // "a" <-> "b" <-> "c"
+
+        expect(dropped2).toBeUndefined();
+        expect(list.length).toBe(3);
+        expect(list.head.value).toBe('a');
+        expect(list.head.next.value).toBe('b');
+        expect(list.head.next.next.value).toBe('c');
+        expect(list.tail.value).toBe('c');
+        expect(list.tail.previous.value).toBe('b');
+        expect(list.tail.previous.previous.value).toBe('a');
+      });
+    });
+
+    describe('#byValue', () => {
+      it('should remove the first node with given value', () => {
+        list.add('a').tail();
+        list.add('x').tail();
+        list.add('b').tail();
+        list.add('x').tail();
+        list.add('c').tail();
+
+        // "a" <-> "x" <-> "b" <-> "x" <-> "c"
+
+        list.drop().byValue('x');
+
+        // "a" <-> "b" <-> "x" <-> "c"
+
+        expect(list.length).toBe(4);
+        expect(list.head.value).toBe('a');
+        expect(list.head.next.value).toBe('b');
+        expect(list.head.next.next.value).toBe('x');
+        expect(list.head.next.next.next.value).toBe('c');
+        expect(list.tail.value).toBe('c');
+        expect(list.tail.previous.value).toBe('x');
+        expect(list.tail.previous.previous.value).toBe('b');
+        expect(list.tail.previous.previous.previous.value).toBe('a');
+
+        // "a" <-> "b" <-> "x" <-> "c"
+
+        list.drop().byValue('x');
+
+        // "a" <-> "b" <-> "c"
+
+        expect(list.length).toBe(3);
+        expect(list.head.value).toBe('a');
+        expect(list.head.next.value).toBe('b');
+        expect(list.head.next.next.value).toBe('c');
+        expect(list.tail.value).toBe('c');
+        expect(list.tail.previous.value).toBe('b');
+        expect(list.tail.previous.previous.value).toBe('a');
+      });
+
+      it('should be able to receive a custom compareFn', () => {
+        list.add({ x: 1 }).tail();
+        list.add({ x: 2 }).tail();
+        list.add({ x: 3 }).tail();
+
+        // {"x":1} <-> {"x":2} <-> {"x":3}
+
+        list.drop().byValue({ x: 2 }, (v1: X, v2: X) => v1.x === v2.x);
+
+        // {"x":1} <-> {"x":3}
+
+        expect(list.length).toBe(2);
+        expect(list.head.value.x).toBe(1);
+        expect(list.head.next.value.x).toBe(3);
+        expect(list.tail.value.x).toBe(3);
+        expect(list.tail.previous.value.x).toBe(1);
+      });
+
+      it('should return undefined when list is empty', () => {
+        const dropped = list.drop().byValue('x');
+        expect(dropped).toBeUndefined();
+      });
+
+      it('should return undefined when given value is not found', () => {
+        list.add('a').tail();
+        list.add('b').tail();
+        list.add('c').tail();
+
+        // "a" <-> "b" <-> "c"
+
+        const node = list.drop().byValue('x');
+
+        // "a" <-> "b" <-> "c"
+
+        expect(node).toBeUndefined();
+        expect(list.length).toBe(3);
+        expect(list.head.value).toBe('a');
+        expect(list.head.next.value).toBe('b');
+        expect(list.head.next.next.value).toBe('c');
+        expect(list.tail.value).toBe('c');
+        expect(list.tail.previous.value).toBe('b');
+        expect(list.tail.previous.previous.value).toBe('a');
+      });
+    });
+
+    describe('#byValueAll', () => {
+      it('should remove all nodes with given value', () => {
+        list.add('a').tail();
+        list.add('x').tail();
+        list.add('b').tail();
+        list.add('x').tail();
+        list.add('c').tail();
+
+        // "a" <-> "x" <-> "b" <-> "x" <-> "c"
+
+        const dropped = list.drop().byValueAll('x');
+
+        // "a" <-> "b" <-> "c"
+
+        expect(dropped.length).toBe(2);
+        expect(dropped[0].value).toEqual('x');
+        expect(dropped[0].previous.value).toEqual('a');
+        expect(dropped[0].next.value).toEqual('b');
+        expect(dropped[1].value).toEqual('x');
+        expect(dropped[1].previous.value).toEqual('b');
+        expect(dropped[1].next.value).toEqual('c');
+
+        expect(list.length).toBe(3);
+        expect(list.head.value).toBe('a');
+        expect(list.head.next.value).toBe('b');
+        expect(list.head.next.next.value).toBe('c');
+        expect(list.tail.value).toBe('c');
+        expect(list.tail.previous.value).toBe('b');
+        expect(list.tail.previous.previous.value).toBe('a');
+      });
+
+      it('should be able to receive a custom compareFn', () => {
+        list.add({ x: 1 }).tail();
+        list.add({ x: 0 }).tail();
+        list.add({ x: 2 }).tail();
+        list.add({ x: 0 }).tail();
+        list.add({ x: 3 }).tail();
+
+        // {"x":1} <-> {"x":0} <-> {"x":2} <-> {"x":0} <-> {"x":3}
+
+        const dropped = list.drop().byValueAll({ x: 0 }, (v1: X, v2: X) => v1.x === v2.x);
+
+        // {"x":1} <-> {"x":2} <-> {"x":3}
+
+        expect(dropped.length).toBe(2);
+        expect(dropped[0].value.x).toEqual(0);
+        expect(dropped[0].previous.value.x).toEqual(1);
+        expect(dropped[0].next.value.x).toEqual(2);
+        expect(dropped[1].value.x).toEqual(0);
+        expect(dropped[1].previous.value.x).toEqual(2);
+        expect(dropped[1].next.value.x).toEqual(3);
+
+        expect(list.length).toBe(3);
+        expect(list.head.value.x).toBe(1);
+        expect(list.head.next.value.x).toBe(2);
+        expect(list.head.next.next.value.x).toBe(3);
+        expect(list.tail.value.x).toBe(3);
+        expect(list.tail.previous.value.x).toBe(2);
+        expect(list.tail.previous.previous.value.x).toBe(1);
+      });
+
+      it('should return empty array when list is empty', () => {
+        const dropped = list.drop().byValueAll('x');
+        expect(dropped).toEqual([]);
+      });
+
+      it('should return empty array when given value is not found', () => {
+        list.add('a').tail();
+        list.add('b').tail();
+        list.add('c').tail();
+
+        // "a" <-> "b" <-> "c"
+
+        const dropped = list.drop().byValueAll('x');
+
+        // "a" <-> "b" <-> "c"
+
+        expect(dropped).toEqual([]);
+
+        expect(list.length).toBe(3);
+        expect(list.head.value).toBe('a');
+        expect(list.head.next.value).toBe('b');
+        expect(list.head.next.next.value).toBe('c');
+        expect(list.tail.value).toBe('c');
+        expect(list.tail.previous.value).toBe('b');
+        expect(list.tail.previous.previous.value).toBe('a');
+      });
+    });
+  });
+
+  describe('#dropMany', () => {
+    describe('#head', () => {
+      it('should return empty array when there is no head', () => {
+        const dropped = list.dropMany(1).head();
+        expect(dropped).toEqual([]);
+      });
+
+      it('should remove multiple nodes from the head of the list', () => {
+        list.addMany(['a', 'b', 'c', 'd', 'e']).tail();
+
+        // "a" <-> "b" <-> "c" <-> "d" <-> "e"
+
+        list.dropMany(3).head();
+
+        // "d" <-> "e"
+
+        expect(list.length).toBe(2);
+        expect(list.head.value).toBe('d');
+        expect(list.head.next.value).toBe('e');
+        expect(list.head.previous).toBeUndefined();
+        expect(list.tail.value).toBe('e');
+        expect(list.tail.previous.value).toBe('d');
+        expect(list.tail.next).toBeUndefined();
+      });
+
+      it('should not change the list when count is less than or equal to zero', () => {
+        list.add('a').tail();
+
+        // "a"
+
+        list.dropMany(0).head();
+
+        // "a"
+
+        list.dropMany(-1).head();
+
+        // "a"
+
+        expect(list.length).toBe(1);
+        expect(list.head.value).toBe('a');
+        expect(list.tail.value).toBe('a');
+      });
+    });
+
+    describe('#tail', () => {
+      it('should return empty array when there is no tail', () => {
+        const dropped = list.dropMany(1).tail();
+        expect(dropped).toEqual([]);
+      });
+
+      it('should remove multiple nodes from the tail of the list', () => {
+        list.addMany(['a', 'b', 'c', 'd', 'e']).tail();
+
+        // "a" <-> "b" <-> "c" <-> "d" <-> "e"
+
+        list.dropMany(3).tail();
+
+        // "a" <-> "b"
+
+        expect(list.length).toBe(2);
+        expect(list.head.value).toBe('a');
+        expect(list.head.next.value).toBe('b');
+        expect(list.head.previous).toBeUndefined();
+        expect(list.tail.value).toBe('b');
+        expect(list.tail.previous.value).toBe('a');
+        expect(list.tail.next).toBeUndefined();
+      });
+
+      it('should not change the list when count is less than or equal to zero', () => {
+        list.add('a').tail();
+
+        // "a"
+
+        list.dropMany(0).tail();
+
+        // "a"
+
+        list.dropMany(-1).tail();
+
+        // "a"
+
+        expect(list.length).toBe(1);
+        expect(list.head.value).toBe('a');
+        expect(list.tail.value).toBe('a');
+      });
+    });
+
+    describe('#byIndex', () => {
+      it('should remove multiple nodes starting from given index', () => {
+        list.addMany(['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h']).tail();
+
+        // "a" <-> "b" <-> "c" <-> "d" <-> "e" <-> "f" <-> "g" <-> "h"
+
+        list.dropMany(2).byIndex(1);
+
+        // "a" <-> "d" <-> "e" <-> "f" <-> "g" <-> "h"
+
+        list.dropMany(2).byIndex(-3);
+
+        // "a" <-> "d" <-> "e" <-> "h"
+
+        expect(list.length).toBe(4);
+        expect(list.head.value).toBe('a');
+        expect(list.head.next.value).toBe('d');
+        expect(list.head.next.next.value).toBe('e');
+        expect(list.head.next.next.next.value).toBe('h');
+        expect(list.tail.value).toBe('h');
+        expect(list.tail.previous.value).toBe('e');
+        expect(list.tail.previous.previous.value).toBe('d');
+        expect(list.tail.previous.previous.previous.value).toBe('a');
+
+        list.dropMany(4).byIndex(0);
+
+        expect(list.length).toBe(0);
+        expect(list.head).toBeUndefined();
+        expect(list.tail).toBeUndefined();
+      });
+
+      it('should return empty array when list is empty', () => {
+        const dropped = list.dropMany(1).byIndex(0);
+        expect(dropped).toEqual([]);
+      });
+
+      it('should return empty array when given index does not exist', () => {
+        list.addMany(['a', 'b', 'c']).tail();
+
+        // "a" <-> "b" <-> "c"
+
+        const dropped = list.dropMany(3).byIndex(4);
+
+        // "a" <-> "b" <-> "c"
+
+        expect(dropped).toEqual([]);
+        expect(list.length).toBe(3);
+        expect(list.head.value).toBe('a');
+        expect(list.head.next.value).toBe('b');
+        expect(list.head.next.next.value).toBe('c');
+        expect(list.tail.value).toBe('c');
+        expect(list.tail.previous.value).toBe('b');
+        expect(list.tail.previous.previous.value).toBe('a');
+      });
+
+      it('should remove from start when given index is less than minus size', () => {
+        list.addMany(['a', 'b', 'c', 'd', 'e']).tail();
+
+        // "a" <-> "b" <-> "c" <-> "d" <-> "e"
+
+        list.dropMany(2).byIndex(-9);
+
+        // "c" <-> "d" <-> "e"
+
+        expect(list.length).toBe(3);
+        expect(list.head.value).toBe('c');
+        expect(list.head.next.value).toBe('d');
+        expect(list.head.next.next.value).toBe('e');
+        expect(list.tail.value).toBe('e');
+        expect(list.tail.previous.value).toBe('d');
+        expect(list.tail.previous.previous.value).toBe('c');
+      });
+
+      it('should remove from end when given index + count is larger than or equal to size', () => {
+        list.addMany(['a', 'b', 'c', 'd', 'e']).tail();
+
+        // "a" <-> "b" <-> "c" <-> "d" <-> "e"
+
+        list.dropMany(2).byIndex(3);
+
+        // "a" <-> "b" <-> "c"
+
+        expect(list.length).toBe(3);
+        expect(list.head.value).toBe('a');
+        expect(list.head.next.value).toBe('b');
+        expect(list.head.next.next.value).toBe('c');
+        expect(list.tail.value).toBe('c');
+        expect(list.tail.previous.value).toBe('b');
+        expect(list.tail.previous.previous.value).toBe('a');
+
+        // "a" <-> "b" <-> "c"
+
+        list.dropMany(9).byIndex(1);
+
+        // "a"
+
+        expect(list.length).toBe(1);
+        expect(list.head.value).toBe('a');
+        expect(list.tail.value).toBe('a');
+      });
+
+      it('should not change the list when count is less than or equal to zero', () => {
+        list.add('a').tail();
+
+        // "a"
+
+        list.dropMany(0).byIndex(0);
+
+        // "a"
+
+        list.dropMany(-1).byIndex(0);
+
+        // "a"
+
+        expect(list.length).toBe(1);
+        expect(list.head.value).toBe('a');
+        expect(list.tail.value).toBe('a');
+      });
+    });
+  });
+
+  describe('#get', () => {
+    it('should return node at given index', () => {
+      list.add('a').tail();
+      list.add('b').tail();
+      list.add('c').tail();
+
+      // "a" <-> "b" <-> "c"
+
+      const node = list.get(1);
+
+      expect(node.value).toBe('b');
+      expect(node.previous.value).toBe('a');
+      expect(node.next.value).toBe('c');
+    });
+
+    it('should return undefined when list is empty', () => {
+      const node = list.get(1);
+
+      expect(node).toBeUndefined();
+    });
+
+    it('should return undefined when predicate finds no match', () => {
+      list.add('a').tail();
+      list.add('b').tail();
+      list.add('c').tail();
+
+      // "a" <-> "b" <-> "c"
+
+      const node1 = list.get(4);
+
+      expect(node1).toBeUndefined();
+      expect(list.length).toBe(3);
+      expect(list.head.value).toBe('a');
+      expect(list.head.next.value).toBe('b');
+      expect(list.head.next.next.value).toBe('c');
+      expect(list.tail.value).toBe('c');
+      expect(list.tail.previous.value).toBe('b');
+      expect(list.tail.previous.previous.value).toBe('a');
+
+      // "a" <-> "b" <-> "c"
+
+      const node2 = list.get(-1);
+
+      expect(node2).toBeUndefined();
+      expect(list.length).toBe(3);
+      expect(list.head.value).toBe('a');
+      expect(list.head.next.value).toBe('b');
+      expect(list.head.next.next.value).toBe('c');
+      expect(list.tail.value).toBe('c');
+      expect(list.tail.previous.value).toBe('b');
+      expect(list.tail.previous.previous.value).toBe('a');
+    });
+  });
+
+  describe('#indexOf', () => {
+    it('should return the index of the first node found based on given value', () => {
+      list.add('a').tail();
+      list.add('x').tail();
+      list.add('b').tail();
+      list.add('x').tail();
+      list.add('c').tail();
+
+      // "a" <-> "x" <-> "b" <-> "x" <-> "c"
+
+      const index1 = list.indexOf('x');
+
+      expect(index1).toBe(1);
+
+      // "a" <-> "x" <-> "b" <-> "x" <-> "c"
+
+      let timesFound = 0;
+      const index2 = list.indexOf('x', (v1: string, v2: string) => {
+        if (timesFound > 1) return false;
+
+        timesFound += Number(v1 === v2);
+
+        return timesFound > 1;
+      });
+
+      expect(index2).toBe(3);
+    });
+
+    it('should be able to receive a custom compareFn', () => {
+      list.add({ x: 1 }).tail();
+      list.add({ x: 2 }).tail();
+      list.add({ x: 3 }).tail();
+
+      // {"x":1} <-> {"x":2} <-> {"x":3}
+
+      const index = list.indexOf({ x: 2 }, (v1: X, v2: X) => v1.x === v2.x);
+
+      expect(index).toBe(1);
+    });
+
+    it('should return -1 when list is empty', () => {
+      const index = list.indexOf('x');
+
+      expect(index).toBe(-1);
+    });
+
+    it('should return -1 when no match is found', () => {
+      list.add('a').tail();
+      list.add('b').tail();
+      list.add('c').tail();
+
+      // "a" <-> "b" <-> "c"
+
+      const index = list.indexOf('x');
+
+      expect(index).toBe(-1);
+      expect(list.length).toBe(3);
+      expect(list.head.value).toBe('a');
+      expect(list.head.next.value).toBe('b');
+      expect(list.head.next.next.value).toBe('c');
+      expect(list.tail.value).toBe('c');
+      expect(list.tail.previous.value).toBe('b');
+      expect(list.tail.previous.previous.value).toBe('a');
+    });
+  });
+
+  describe('#toArray', () => {
+    it('should return array representation', () => {
+      list.addTail('a');
+      list.addTail(2);
+      list.addTail('c');
+      list.addTail({ k: 4, v: 'd' });
+
+      // "a" <-> 2 <-> "c" <-> {"k":4,"v":"d"}
+
+      const arr = list.toArray();
+      expect(arr).toEqual(['a', 2, 'c', { k: 4, v: 'd' }]);
+    });
+
+    it('should return empty array when list is empty', () => {
+      const arr = list.toArray();
+      expect(arr).toEqual([]);
+    });
+  });
+
+  describe('#toNodeArray', () => {
+    it('should return array of nodes', () => {
+      list.addTail('a');
+      list.addTail(2);
+      list.addTail('c');
+      list.addTail({ k: 4, v: 'd' });
+
+      // "a" <-> 2 <-> "c" <-> {"k":4,"v":"d"}
+
+      const arr = list.toNodeArray();
+
+      expect(arr.every(node => node instanceof ListNode)).toBe(true);
+      expect(arr.map(node => node.value)).toEqual(['a', 2, 'c', { k: 4, v: 'd' }]);
+    });
+
+    it('should return empty array when list is empty', () => {
+      const arr = list.toNodeArray();
+      expect(arr).toEqual([]);
+    });
+  });
+
+  describe('#toString', () => {
+    it('should return string representation', () => {
+      list.addTail('a');
+      list.addTail(2);
+      list.addTail('c');
+      list.addTail({ k: 4, v: 'd' });
+
+      // "a" <-> 2 <-> "c" <-> {"k":4,"v":"d"}
+
+      const str = list.toString();
+      expect(str).toBe('"a" <-> 2 <-> "c" <-> {"k":4,"v":"d"}');
+    });
+
+    it('should return empty string when list is empty', () => {
+      const str = list.toString();
+      expect(str).toBe('');
+    });
+
+    it('should be coercible', () => {
+      list.addMany(['a', 'b', 'c']).tail();
+
+      // "a" <-> "b" <-> "c"
+
+      expect('' + list).toBe('"a" <-> "b" <-> "c"');
+    });
+
+    it('should be able to receive a custom mapperFn', () => {
+      list.addMany([{ x: 1 }, { x: 2 }, { x: 3 }]).tail();
+
+      // {"x":1} <-> {"x":2} <-> {"x":3}
+
+      const str = list.toString(value => value.x);
+      expect(str).toBe('1 <-> 2 <-> 3');
+    });
+  });
+
+  it('should be iterable', () => {
+    list.addTail('a');
+    list.addTail('b');
+    list.addTail('c');
+
+    // "a" <-> "b" <-> "c"
+
+    const arr = [];
+
+    for (const value of list) {
+      arr.push(value);
+    }
+
+    expect(arr).toEqual(['a', 'b', 'c']);
+  });
+});
+
+interface X {
+  [k: string]: any;
+}
diff --git a/npm/packs/utils/projects/utils/src/lib/linked-list.ts b/npm/packs/utils/projects/utils/src/lib/linked-list.ts
index 86ebebbcc1..c0f014121a 100644
--- a/npm/packs/utils/projects/utils/src/lib/linked-list.ts
+++ b/npm/packs/utils/projects/utils/src/lib/linked-list.ts
@@ -1,3 +1,396 @@
-export class LinkedList {
-  constructor() {}
+/* tslint:disable:no-non-null-assertion */
+
+import compare from 'just-compare';
+
+export class ListNode<T = any> {
+  readonly value: T;
+  next: ListNode | undefined;
+  previous: ListNode | undefined;
+
+  constructor(value: T) {
+    this.value = value;
+  }
 }
+
+export class LinkedList<T = any> {
+  private first: ListNode<T> | undefined;
+  private last: ListNode<T> | undefined;
+  private size = 0;
+
+  get head(): ListNode<T> | undefined {
+    return this.first;
+  }
+  get tail(): ListNode<T> | undefined {
+    return this.last;
+  }
+  get length(): number {
+    return this.size;
+  }
+
+  private attach(
+    value: T,
+    previousNode: ListNode<T> | undefined,
+    nextNode: ListNode<T> | undefined,
+  ): ListNode<T> {
+    if (!previousNode) return this.addHead(value);
+
+    if (!nextNode) return this.addTail(value);
+
+    const node = new ListNode(value);
+    node.previous = previousNode;
+    previousNode.next = node;
+    node.next = nextNode;
+    nextNode.previous = node;
+
+    this.size++;
+
+    return node;
+  }
+
+  private attachMany(
+    values: T[],
+    previousNode: ListNode<T> | undefined,
+    nextNode: ListNode<T> | undefined,
+  ): ListNode<T>[] {
+    if (!values.length) return [];
+
+    if (!previousNode) return this.addManyHead(values);
+
+    if (!nextNode) return this.addManyTail(values);
+
+    const list = new LinkedList<T>();
+    list.addManyTail(values);
+    list.first!.previous = previousNode;
+    previousNode.next = list.first;
+    list.last!.next = nextNode;
+    nextNode.previous = list.last;
+
+    this.size += values.length;
+
+    return list.toNodeArray();
+  }
+
+  private detach(node: ListNode<T>) {
+    if (!node.previous) return this.dropHead();
+
+    if (!node.next) return this.dropTail();
+
+    node.previous.next = node.next;
+    node.next.previous = node.previous;
+
+    this.size--;
+
+    return node;
+  }
+
+  add(value: T) {
+    return {
+      after: (previousValue: T, compareFn: ListComparisonFn<T> = compare) =>
+        this.addAfter(value, previousValue, compareFn),
+      before: (nextValue: T, compareFn: ListComparisonFn<T> = compare) =>
+        this.addBefore(value, nextValue, compareFn),
+      byIndex: (position: number) => this.addByIndex(value, position),
+      head: () => this.addHead(value),
+      tail: () => this.addTail(value),
+    };
+  }
+
+  addMany(values: T[]) {
+    return {
+      after: (previousValue: T, compareFn: ListComparisonFn<T> = compare) =>
+        this.addManyAfter(values, previousValue, compareFn),
+      before: (nextValue: T, compareFn: ListComparisonFn<T> = compare) =>
+        this.addManyBefore(values, nextValue, compareFn),
+      byIndex: (position: number) => this.addManyByIndex(values, position),
+      head: () => this.addManyHead(values),
+      tail: () => this.addManyTail(values),
+    };
+  }
+
+  addAfter(value: T, previousValue: T, compareFn: ListComparisonFn<T> = compare): ListNode<T> {
+    const previous = this.find(node => compareFn(node.value, previousValue));
+
+    return previous ? this.attach(value, previous, previous.next) : this.addTail(value);
+  }
+
+  addBefore(value: T, nextValue: T, compareFn: ListComparisonFn<T> = compare): ListNode<T> {
+    const next = this.find(node => compareFn(node.value, nextValue));
+
+    return next ? this.attach(value, next.previous, next) : this.addHead(value);
+  }
+
+  addByIndex(value: T, position: number): ListNode<T> {
+    if (position < 0) position += this.size;
+    else if (position >= this.size) return this.addTail(value);
+
+    if (position <= 0) return this.addHead(value);
+
+    const next = this.get(position)!;
+
+    return this.attach(value, next.previous, next);
+  }
+
+  addHead(value: T): ListNode<T> {
+    const node = new ListNode(value);
+
+    node.next = this.first;
+
+    if (this.first) this.first.previous = node;
+    else this.last = node;
+
+    this.first = node;
+    this.size++;
+
+    return node;
+  }
+
+  addTail(value: T): ListNode<T> {
+    const node = new ListNode(value);
+
+    if (this.first) {
+      node.previous = this.last;
+      this.last!.next = node;
+      this.last = node;
+    } else {
+      this.first = node;
+      this.last = node;
+    }
+
+    this.size++;
+
+    return node;
+  }
+
+  addManyAfter(
+    values: T[],
+    previousValue: T,
+    compareFn: ListComparisonFn<T> = compare,
+  ): ListNode<T>[] {
+    const previous = this.find(node => compareFn(node.value, previousValue));
+
+    return previous ? this.attachMany(values, previous, previous.next) : this.addManyTail(values);
+  }
+
+  addManyBefore(
+    values: T[],
+    nextValue: T,
+    compareFn: ListComparisonFn<T> = compare,
+  ): ListNode<T>[] {
+    const next = this.find(node => compareFn(node.value, nextValue));
+
+    return next ? this.attachMany(values, next.previous, next) : this.addManyHead(values);
+  }
+
+  addManyByIndex(values: T[], position: number): ListNode<T>[] {
+    if (position < 0) position += this.size;
+
+    if (position <= 0) return this.addManyHead(values);
+
+    if (position >= this.size) return this.addManyTail(values);
+
+    const next = this.get(position)!;
+
+    return this.attachMany(values, next.previous, next);
+  }
+
+  addManyHead(values: T[]): ListNode<T>[] {
+    return values.reduceRight<ListNode<T>[]>((nodes, value) => {
+      nodes.unshift(this.addHead(value));
+      return nodes;
+    }, []);
+  }
+
+  addManyTail(values: T[]): ListNode<T>[] {
+    return values.map(value => this.addTail(value));
+  }
+
+  drop() {
+    return {
+      byIndex: (position: number) => this.dropByIndex(position),
+      byValue: (value: T, compareFn: ListComparisonFn<T> = compare) =>
+        this.dropByValue(value, compareFn),
+      byValueAll: (value: T, compareFn: ListComparisonFn<T> = compare) =>
+        this.dropByValueAll(value, compareFn),
+      head: () => this.dropHead(),
+      tail: () => this.dropTail(),
+    };
+  }
+
+  dropMany(count: number) {
+    return {
+      byIndex: (position: number) => this.dropManyByIndex(count, position),
+      head: () => this.dropManyHead(count),
+      tail: () => this.dropManyTail(count),
+    };
+  }
+
+  dropByIndex(position: number): ListNode<T> | undefined {
+    if (position < 0) position += this.size;
+
+    const current = this.get(position);
+
+    return current ? this.detach(current) : undefined;
+  }
+
+  dropByValue(value: T, compareFn: ListComparisonFn<T> = compare): ListNode<T> | undefined {
+    const position = this.findIndex(node => compareFn(node.value, value));
+
+    return position < 0 ? undefined : this.dropByIndex(position);
+  }
+
+  dropByValueAll(value: T, compareFn: ListComparisonFn<T> = compare): ListNode<T>[] {
+    const dropped: ListNode<T>[] = [];
+
+    for (let current = this.first, position = 0; current; position++, current = current.next) {
+      if (compareFn(current.value, value)) {
+        dropped.push(this.dropByIndex(position - dropped.length)!);
+      }
+    }
+
+    return dropped;
+  }
+
+  dropHead(): ListNode<T> | undefined {
+    const head = this.first;
+
+    if (head) {
+      this.first = head.next;
+
+      if (this.first) this.first.previous = undefined;
+      else this.last = undefined;
+
+      this.size--;
+
+      return head;
+    }
+
+    return undefined;
+  }
+
+  dropTail(): ListNode<T> | undefined {
+    const tail = this.last;
+
+    if (tail) {
+      this.last = tail.previous;
+
+      if (this.last) this.last.next = undefined;
+      else this.first = undefined;
+
+      this.size--;
+
+      return tail;
+    }
+
+    return undefined;
+  }
+
+  dropManyByIndex(count: number, position: number): ListNode<T>[] {
+    if (count <= 0) return [];
+
+    if (position < 0) position = Math.max(position + this.size, 0);
+    else if (position >= this.size) return [];
+
+    count = Math.min(count, this.size - position);
+
+    const dropped: ListNode<T>[] = [];
+
+    while (count--) {
+      const current = this.get(position);
+      dropped.push(this.detach(current!)!);
+    }
+
+    return dropped;
+  }
+
+  dropManyHead(count: Exclude<number, 0>): ListNode<T>[] {
+    if (count <= 0) return [];
+
+    count = Math.min(count, this.size);
+
+    const dropped: ListNode<T>[] = [];
+
+    while (count--) dropped.unshift(this.dropHead()!);
+
+    return dropped;
+  }
+
+  dropManyTail(count: Exclude<number, 0>): ListNode<T>[] {
+    if (count <= 0) return [];
+
+    count = Math.min(count, this.size);
+
+    const dropped: ListNode<T>[] = [];
+
+    while (count--) dropped.push(this.dropTail()!);
+
+    return dropped;
+  }
+
+  find(predicate: ListIteratorFn<T>): ListNode<T> | undefined {
+    for (let current = this.first, position = 0; current; position++, current = current.next) {
+      if (predicate(current, position, this)) return current;
+    }
+
+    return undefined;
+  }
+
+  findIndex(predicate: ListIteratorFn<T>): number {
+    for (let current = this.first, position = 0; current; position++, current = current.next) {
+      if (predicate(current, position, this)) return position;
+    }
+
+    return -1;
+  }
+
+  forEach<R = boolean>(callback: ListIteratorFn<T, R>) {
+    for (let node = this.first, position = 0; node; position++, node = node.next) {
+      callback(node, position, this);
+    }
+  }
+
+  get(position: number): ListNode<T> | undefined {
+    return this.find((_, index) => position === index);
+  }
+
+  indexOf(value: T, compareFn: ListComparisonFn<T> = compare): number {
+    return this.findIndex(node => compareFn(node.value, value));
+  }
+
+  toArray(): T[] {
+    const array = new Array(this.size);
+
+    this.forEach((node, index) => (array[index!] = node.value));
+
+    return array;
+  }
+
+  toNodeArray(): ListNode<T>[] {
+    const array = new Array(this.size);
+
+    this.forEach((node, index) => (array[index!] = node));
+
+    return array;
+  }
+
+  toString(mapperFn: ListMapperFn<T> = JSON.stringify): string {
+    return this.toArray()
+      .map(value => mapperFn(value))
+      .join(' <-> ');
+  }
+
+  *[Symbol.iterator](): any {
+    for (let node = this.first, position = 0; node; position++, node = node.next) {
+      yield node.value;
+    }
+  }
+}
+
+export type ListMapperFn<T = any> = (value: T) => any;
+
+export type ListComparisonFn<T = any> = (value1: T, value2: T) => boolean;
+
+export type ListIteratorFn<T = any, R = boolean> = (
+  node: ListNode<T>,
+  index?: number,
+  list?: LinkedList,
+) => R;