This is a beta version of Practice-It. Give us feedback

logo Practice-It logo

Main Page → Problems → Solve a Problem

removeOddPositions

Related Links:
Author: Whitaker Brand (on 2018/05/01)

Write a method removeOddPositions that removes the values in odd-numbered positions (if any) from a list of integers. For example if a variable called list stores these values: 

        [8, 13, 17, 4, 9, 12, 98]

and the following call is made: 

        list.removeOddPositions();

The list should store this sequence after the call: 

        [8, 17, 9, 98]

The method removed the values at odd positions (positions 1, 3, and 5), otherwise preserving the order of the remaining elements. Notice that it doesn't matter whether the value itself is odd or even but instead whether it appears in an odd position or even position.

You are writing a method for the ArrayIntList class discussed in lecture: 

        public class ArrayIntList {
            private int[] elementData; // list of integers
            private int size;          // current # of elements in the list

            <methods>
        }

You may not call any other methods of the ArrayIntList methods to solve this problem, you are not allowed to define any auxiliary data structures (no array, ArrayList, etc), and your solution must run in O(n) time.

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.