logo Practice-It logo

Main Page → Problems → Solve a Problem

BJP5 Exercise 18.13: fillGaps

Language/Type: Java Collections PriorityQueue
Author: Marty Stepp (on 2019/09/19)

Write a method called fillGaps that accepts a PriorityQueue of integers as a parameter and adds elements to it until every element in its range of smallest to largest is represented once if it was not previously found in the priority queue. For example, if the queue stores [1, 3, 3, 6, 6, 8], your method should modify the queue to store [1, 2, 3, 3, 4, 5, 6, 6, 7, 8]. You may use one collection as auxiliary storage.

Type your solution here:


This is a method problem. Write a Java method as described. Do not write a complete program or class; just the method(s) above.

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.