Important Notice:

Practice-It will be discontinued as of November 1st, 2024. After this date, the website will remain online for a transitional period, but login will be restricted to University of Washington NetID authentication. This marks the next phase towards the platform's full retirement. Thank you for your use and support of the application over the years.

If you are looking for an alternative, a similar tool, CodeStepByStep, was developed independently by the original author of Practice-It, and is available at codestepbystep.com**

logo Practice-It logo

Main Page → Problems → Solve a Problem

BJP3 Self-Check 16.30: firstLast

Related Links:
Author: Marty Stepp (on 2013/04/01)

Write a method firstLast that could be added to the LinkedIntList class that moves the first element of the list to the back end of the list. Suppose a LinkedIntList variable named list stores the following elements from front (left) to back (right): 

[18, 4, 27, 9, 54, 5, 63]

If you made the call of list.firstLast();, the list would then store the elements in this order: 

[4, 27, 9, 54, 5, 63, 18]

If the list is empty or has just one element, its contents should not be modified.

Obey the following restrictions in your solution:

  • Do not call any other methods on the LinkedIntList object, such as add, remove, or size.
  • Do not create new ListNode objects (though you may have as many ListNode variables as you like).
  • Do not use other data structures such as arrays, lists, queues, etc.
  • Do not mutate the data of any existing node; change the list only by modifying links between nodes.
  • Your solution should run in O(N) time, where N is the number of elements of the linked list.

Assume that you are adding this method to the LinkedIntList class (that uses the ListNode class) below. 

public class LinkedIntList {                public class ListNode {
    private ListNode front;                     public int data;
    ...                                         public ListNode next;
}                                               ...
                                            }
Type your solution here:


This is a partial class problem. Submit code that will become part of an existing Java class as described. You do not need to write the complete class, just the portion described in the problem.

You must log in before you can solve this problem.


Log In

If you do not understand how to solve a problem or why your solution doesn't work, please contact your TA or instructor.
If something seems wrong with the site (errors, slow performance, incorrect problems/tests, etc.), please

Is there a problem? Contact a site administrator.