No, this is not possible using any standard class in Java. You have to create you own implementation base on any ordered random access collection like: Array, List.
Following solution probably not optimal, but it works and was written in 5 minutes.
public static void main(String... args) throws IOException {
Deque<Character> deque = new LinkedList<>();
deque.addAll(Arrays.asList('A', 'B', 'C', 'D', 'E', 'F'));
System.out.println(deque);
reorder(deque, 3);
System.out.println(deque);
reorder(deque, 3);
}
public static void reorder(Deque<Character> deque, int offs) {
offs %= deque.size();
for (int i = 0; i < offs; i++)
deque.add(deque.removeFirst());
}
Output:
[A, B, C, D, E, F]
[D, E, F, A, B, C]
P.S. As you can see the method accepted Deque, so you could use any implementation of this interface.