1188. Design Bounded Blocking Queue

Implement a thread-safe bounded blocking queue that has the following methods:

  • BoundedBlockingQueue(int capacity) The constructor initializes the queue with a maximum capacity.
  • void enqueue(int element) Adds an element to the front of the queue. If the queue is full, the calling thread is blocked until the queue is no longer full.
  • int dequeue() Returns the element at the rear of the queue and removes it. If the queue is empty, the calling thread is blocked until the queue is no longer empty.
  • int size() Returns the number of elements currently in the queue.

Your implementation will be tested using multiple threads at the same time. Each thread will either be a producer thread that only makes calls to the enqueue method or a consumer thread that only makes calls to the dequeue method. The size method will be called after every test case.

Please do not use built-in implementations of bounded blocking queue as this will not be accepted in an interview.

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26

Example 1:

Input:
1
1
["BoundedBlockingQueue","enqueue","dequeue","dequeue","enqueue","enqueue","enqueue","enqueue","dequeue"]
[[2],[1],[],[],[0],[2],[3],[4],[]]

Output:
[1,0,2,2]

Explanation:
Number of producer threads = 1
Number of consumer threads = 1

BoundedBlockingQueue queue = new BoundedBlockingQueue(2);   // initialize the queue with capacity = 2.

queue.enqueue(1);   // The producer thread enqueues 1 to the queue.
queue.dequeue();    // The consumer thread calls dequeue and returns 1 from the queue.
queue.dequeue();    // Since the queue is empty, the consumer thread is blocked.
queue.enqueue(0);   // The producer thread enqueues 0 to the queue. The consumer thread is unblocked and returns 0 from the queue.
queue.enqueue(2);   // The producer thread enqueues 2 to the queue.
queue.enqueue(3);   // The producer thread enqueues 3 to the queue.
queue.enqueue(4);   // The producer thread is blocked because the queue's capacity (2) is reached.
queue.dequeue();    // The consumer thread returns 2 from the queue. The producer thread is unblocked and enqueues 4 to the queue.
queue.size();       // 2 elements remaining in the queue. size() is always called at the end of each test case.

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26

Example 2:

Input:
3
4
["BoundedBlockingQueue","enqueue","enqueue","enqueue","dequeue","dequeue","dequeue","enqueue"]
[[3],[1],[0],[2],[],[],[],[3]]
Output:
[1,0,2,1]

Explanation:
Number of producer threads = 3
Number of consumer threads = 4

BoundedBlockingQueue queue = new BoundedBlockingQueue(3);   // initialize the queue with capacity = 3.

queue.enqueue(1);   // Producer thread P1 enqueues 1 to the queue.
queue.enqueue(0);   // Producer thread P2 enqueues 0 to the queue.
queue.enqueue(2);   // Producer thread P3 enqueues 2 to the queue.
queue.dequeue();    // Consumer thread C1 calls dequeue.
queue.dequeue();    // Consumer thread C2 calls dequeue.
queue.dequeue();    // Consumer thread C3 calls dequeue.
queue.enqueue(3);   // One of the producer threads enqueues 3 to the queue.
queue.size();       // 1 element remaining in the queue.

Since the number of threads for producer/consumer is greater than 1, we do not know how the threads will be scheduled in the operating system, even though the input seems to imply the ordering. Therefore, any of the output [1,0,2] or [1,2,0] or [0,1,2] or [0,2,1] or [2,0,1] or [2,1,0] will be accepted.

Constraints:

  • 1 <= Number of Prdoucers <= 8
  • 1 <= Number of Consumers <= 8
  • 1 <= size <= 30
  • 0 <= element <= 20
  • The number of calls to enqueue is greater than or equal to the number of calls to dequeue.
  • At most 40 calls will be made to enque, deque, and size.

Synchronizated Solution

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41

class Solution {
    Set<Set<Pair<Integer, Integer>>> unique = new HashSet<>();
    public int numDistinctIslands(int[][] grid) {
        int count = 1;
        for (int i = 0; i < grid.length; i++) {
            for (int j = 0; j < grid[0].length; j++) {
                if (grid[i][j] == 1) {
                    count++;
                    Set<Pair<Integer, Integer>> shape = new HashSet<>();
                    dfs(grid, i, j, shape, i, j, count);
                    unique.add(shape);
                }
            }
        }
        return unique.size();
    }
    
    int[][] DIRS = new int[][] {
        {1, 0},
        {-1, 0},
        {0, 1},
        {0, -1},
    };
    
    void dfs(int[][] grid, int i, int j, Set<Pair<Integer, Integer>> shape, int start, int end, int index) {
        grid[i][j] = index;
        
        shape.add(new Pair(i - start, j - end));
        
        for (int[] dir: DIRS) {
            int x = dir[0] + i;
            int y = dir[1] + j;
            
            if (x < 0 || x == grid.length || y < 0 || y == grid[0].length) continue;
            
            if (grid[x][y] == 1) {
                dfs(grid, x, y, shape, start, end, index);
            }
        }
    }
}

Path Hash Solution

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38

class BoundedBlockingQueue {
    
    private int start = 0;
    private int end = 0;
    private final int[] q = new int[100];
    private final int capacity;

    public BoundedBlockingQueue(int capacity) {
        this.capacity = capacity;
    }
    
    public void enqueue(int element) throws InterruptedException {
        synchronized(this) {
            while (end - start == capacity) {
                this.wait();
            } 
            q[end++] = element;
            this.notifyAll();
        }
    }
    
    public int dequeue() throws InterruptedException {
        synchronized(this) {
            while (end - start <= 0) {
                this.wait();
            }
            int element = q[start++];
            this.notifyAll();
            return element;
        }
    }
    
    public int size() {
        synchronized(this) {
            return end - start; 
        }
    }
}

Solution ReentrantReadWriteLock

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47

class BoundedBlockingQueue {
    private LinkedList<Integer> q = new LinkedList<>();
    private final int capacity;
    private final ReentrantLock rwl = new ReentrantLock();
    private final Condition empty = rwl.newCondition();
    private final Condition full = rwl.newCondition();

    public BoundedBlockingQueue(int capacity) {
        this.capacity = capacity;
    }
    
    public void enqueue(int element) throws InterruptedException {
        rwl.lock();
        try {
          while (q.size() == capacity) {
             full.await();
          }  
          q.add(element);  
          empty.signalAll();  
        } finally {
            rwl.unlock();
        }
    }
    
    public int dequeue() throws InterruptedException {
        rwl.lock();
        try {
            while (q.size() == 0) {
                empty.await();
            }
            int element = q.pollFirst();
            full.signalAll();  
            return element;
        } finally {
            rwl.unlock();
        }
    }
    
    public int size() {
        rwl.lock();
        try {
            return q.size(); 
        } finally {
            rwl.unlock();
        }
    }
}