# JavaScript. Linked Lists. Circular List.

Today, we are going to break into small parts a new chapter which calls Circular List. What is that? So basically we have a linked list and the node of this list is pointing to the element which we pass. In the result, we receive an infinity loop which break our code. We have to make sure that our list avoid being infinity loop. Let’s create a method which will help us to check if it’s true or false.

Hello everyone who is reading this blog. I am happy to move forward with Linked Lists and discuss more problems and find more solutions to this problems. Today, we are going to break into small parts a new chapter which calls Circular List. What is that? So basically we have a linked list and the node of this list is pointing to the element which we pass. In the result, we receive an infinity loop which break our code. We have to make sure that our list avoid being infinity loop. Let’s create a method which will help us to check if it’s true or false.

If you just started with the linked lists, I highly recommend to look through some blogs:

### JavaScript.Linked Lists. What is “Linked Lists”? Create a Node Class API

Hello for new readers and welcome back who is still with me. Just want to mention that I stopped writing blogs about…

medium.com

## Directions

Given a linked list, return true if the list is circular, false if it is not.

## Example

``````const l = new LinkedList();
const a = new Node('a')
const b = new Node('b')
const c = new Node('c')
a.next = b
b.next = c
c.next = b
circular(l)``````

Let’s start with the list of 5 nodes. As you can see we have circular list where purple close list on ‘red’ element. The idea of this algorithm is to create two variables “slow” and “fast”. Where “slow” will have one step, “fast” two steps. When slow and fast will have the same node it will return true. Otherwise, it will return false.

## JavaScript.Linked Lists. Get last element in the list. Clear the list.

JavaScript.Linked Lists. Get last element in the list. Clear the list. Today we are going to discus and learn how to write a new method for linked list. As always I would like to pay attention one thing it’s previous blogs. I will recommend to start with them.

## JavaScript.Linked Lists. Sizing a list.Get first element in the list

Today we are moving forward with our Linked Lists and for today our aims are to get a size of the list and get a first element. I highly recommend for you to read the previous parts about Linked Lists since it’s very important to cover all the basics that I mentioned before and all code will be more understandable. If you feel great to continue, just let’s do this.

## JavaScript.Linked Lists. Insert Last. Get At.

Welcome back to our Linked List session and welcome to those who just joined us. Today, we are going to learn how to insert element in the end of the list and get element by index from our list.

## Editing a Singly Linked List

Building on the previous discussion, we will now dive into editing that singly linked list. If you are not familiar with the code and terminology covered in the previous article it is recommended you review Building a Singly Linked List.