{"id":4212,"date":"2021-08-21T10:28:29","date_gmt":"2021-08-21T10:28:29","guid":{"rendered":"https:\/\/www.prepbytes.com\/blog\/?p=4212"},"modified":"2022-03-10T19:39:11","modified_gmt":"2022-03-10T19:39:11","slug":"linkedblockingqueue-size-method-in-java","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/linkedblockingqueue-size-method-in-java\/","title":{"rendered":"LinkedBlockingQueue size() method in Java"},"content":{"rendered":"

\"\"<\/p>\n

Introduction<\/h3>\n

The linked list is one of the most important concepts and data structures to learn while preparing for interviews. Having a good grasp of Linked Lists can be a huge plus point in a coding interview.<\/p>\n<\/p>\n

In this article, we are going to learn how to use the LinkedBlockingQueue size() method in Java.<\/p>\n

LinkedBlockingQueue<\/strong> is a optionally bounded blocking queue based upon linked nodes. It follows FIFO, means that the oldest inserted element will be at the head of the queue. If capacity is given LinkedBlockingQueue is bounded otherwise it is unbounded.<\/p>\n

In this question, we are given a LinkedBlockingQueue. We have to implement the LinkedBlockingQueue size() method. <\/p>\n

LinkedBlockingQueue size() method<\/h3>\n

Syntax – public int size()<\/strong><\/p>\n

Return Value<\/strong> – Returns the number of elements present in the LinkedBlockingQueue.<\/p>\n

Suppose the LinkedBlockingQueue is [\u201cCoding\u201d,\u201dis,\u201dfun\u201d]. As there are 3 elements in the LinkedBlockingQueue, the size method will return the value 3.<\/p>\n

Input:<\/strong> [\u201cCoding\u201d,\u201dis,\u201dfun\u201d]
\nOutput<\/strong>
\nItems in the Queue are [Coding, is, fun]
\nSize of the Queue is 3<\/p>\n

Explanation:<\/strong> As there are 3 elements in the LinkedBlockingQueue, the size() method returns 3.<\/p>\n

Code Implementation<\/h3>\n\t\t\t\t\t\t