id/email
password
forgot password | create account
about | help | code help+videos | done | prefs
CodingBat code practice

 

tmhscs@gmail.com queues > queue_remove7atFront
prev  |  next  |  chance

Given a queue of integers, if the head of the queue has a 7 then remove it. If it does not have a 7 or has no elements, return the queue as it is.

Your first line of code must be:
Queue<Integer> queue = new LinkedList<Integer>(list);

queue_remove7atFront([]) → []
queue_remove7atFront([1, 2, 3]) → [1, 2, 3]
queue_remove7atFront([7, 1, 1, 1, 1, 1]) → [1, 1, 1, 1, 1]

...Save, Compile, Run (ctrl-enter)

public Queue<Integer> queue_remove7atFront(List<Integer> list) { }

Editor font size %:
Shorter output


Forget It! -- delete my code for this problem

Progress graphs:
 Your progress graph for this problem
 Random user progress graph for this problem
 Random Epic Progress Graph

Java Help

Misc Code Practice

Post-solution available

Copyright Nick Parlante 2017 - privacy