Collapse Content

As mentioned, software's main purpose is to handle data, often collections of similar data. A List is one of the simplest data structures for holding a collection of data.

Abstract Lists

Before describing ways to implement a List, we'll examine what a List is. A List holds a collection of values (or objects) in a specific order, and the same value can occur more than once in the List.

A List should support the following methods:

  • add(item) - Add an item to the end of the list,
  • add(index, item) Add an item to a specific location in the list. (insertion)
  • get(index) - Get an item from a specific location in the List.
  • size() - Return the number of elements in the list.
  • remove(index) - Remove an item from a specific location in the List.

A List lets you repeatedly add items to it without worrying about its size. You can use Lists that support the above operations without knowing how the List is implemented. However, if you know how the Lists work, you can choose the optimal List type for each situation.


A LinkedList is a series of Nodes where each Node points to the next Node in the List.

Linked List

The LinkedList class contains implementations of the List methods. This lets you use the List class to add, find and remove items without having to deal with the Nodes that the LinkedList uses internally.

Implementing the basic List methods

The LinkedLists needs to keep track of the first Node in the list, so it should keep a head variable. To get an element from the list at index i you start from the head and keep on going to the next Node until you reach that position.

To add an element to the list with value v, you need to create a new Node with that value and then point the previous last Node to the new Node. It makes sense to create a tail variable so the last element can be accesses immediately without going through the entire list.


Create your own LinkedList class for storing integers which should include two methods:

  • add(int num) - this should add a new Node to the end of the list with a value of num
  • get(int i) - this should return the value of the Node at position i in the List.

For Java and Ruby, you can complete the provided code. For other languages, read the input output details to see how to use your classes to solve the challenge.

Input and Output

The input will consist of the number t followed by t lines with 1 pair of numbers on each line. The first number in each pair is the operation and the second number is the parameter. In this challenge, there are only 2 operations:

  • add represented by the number -9. Add the given number to the end of your LinkedList when a -9 appears.
  • get represented by the number -6. Get and print the number located at the given index whenever a -6 appears. (Print the number on its own line.)

Sample Input

-9 3
-9 5
-9 7
-6 1
-9 4
-6 3
-6 0

Sample Output


The 4 add operations create the following list: {3, 5, 7, 4}.
The 3 get operations get the numbers located at positions 1, 3 and 0.


Create a LinkedList as described above.

Please sign in or sign up to submit answers.

Alternatively, you can try out Learneroo before signing up.


  • public void add(int num){
        head = tail; = new Node(num);
        tail =;
     * Returns value of node at given index
  • what am i supposed to return?

  • this is telling me that my return value needs to be an integer, I'm lost

  • @sarah, you can link to long pieces of code so you don't need to paste them here. The method get needs to return an integer (the value or data of a node). See if the new hint helps (or the new cheat option if you need it.)

  • thanks, i realize what i was doing wrong.

  • Do i understand it correct if i say that head and tails arent nodes themselves?

  • No, the first node in the list is the head and the last node is the tail. (If there's just one node, it's both the head and tail.)

  • When i state tail is head , can i consider them as one node with 2 names (startingpoint), or are they two different nodes with the same name. In case two i dont understand the line:

  • class LinkedList {
    Node head;
    Node tail;

    So i have two 'dummy' nodes. But what is the data en what is the pointer of head.

    if head==0 -------------> what does this mean, what is null, the pointer? Then what is the data?

  • Nevermind, i understand it now. Its cause the default points to null.

    Also i understand why i can say and it does the same for the head. This cause its a reference variable. So i guess i figured it out :-)

All Node Comments
Contact Us