Topic: Queue
Questions Successfully Completed: 1
<table><tbody><tr><td>1) Operations of Queue</td><td>Easy</td></tr></tbody></table>

<pre><code class="lang-java"> //Function to push an element in queue.
 void enqueue(Queue&lt;Integer&gt; q, int x){
 q.add(x);
 }

 //Function to remove front element from queue.
 void dequeue(Queue&lt;Integer&gt; q){
 int x = q.poll();
 }

 //Function to find the front element of queue.
 int front(Queue&lt;Integer&gt; q){
 int j = q.peek();
 return j;
 }

 //Function to find an element in the queue.
 String find(Queue&lt;Integer&gt; q, int x){
 if(q.contains(x)){
 return "Yes";
 }
 else{
 return "No";
 }
 }
</code></pre>
Thank you for reading :)

Topic: ***Queue***

Questions Successfully Completed: 1

<table><tbody><tr><td colspan="1" rowspan="1">1) Operations of Queue</td><td colspan="1" rowspan="1">Easy</td></tr></tbody></table>

```java
 //Function to push an element in queue.
 void enqueue(Queue<Integer> q, int x){
 q.add(x);
 }
 
 //Function to remove front element from queue.
 void dequeue(Queue<Integer> q){
 int x = q.poll();
 }
 
 //Function to find the front element of queue.
 int front(Queue<Integer> q){
 int j = q.peek();
 return j;
 }
 
 //Function to find an element in the queue.
 String find(Queue<Integer> q, int x){
 if(q.contains(x)){
 return "Yes";
 }
 else{
 return "No";
 }
 }
```

Thank you for reading :)

DSA Day 57/100