Medium | Top K Frequent Elements | Problem Statement In top K frequent elements we have given an array nums[], find the k most read more |

Easy | Level order traversal using two Queues | Problem Statement The problem “Level order traversal using two Queues” states that you read more |

Medium | Find the First Circular Tour that visits all the Petrol Pumps | Problem Statement The problem “Find the First Circular Tour that visits all the Petrol read more |

Medium | Minimum sum of squares of character counts in a given string after removing k characters | Problem Statement The problem “Minimum sum of squares of character counts in a given string read more |

Easy | First negative integer in every window of size k | Problem Statement The problem “First negative integer in every window of size k” states read more |

Easy | Queue based approach for first non-repeating character in a stream | Problem Statement The problem “Queue based approach for first non-repeating character in a read more |

Easy | Distance of nearest cell having 1 in a binary matrix | Problem Statement The problem “Distance of nearest cell having 1 in a binary matrix” read more |

Medium | Sum of minimum and maximum elements of all subarrays of size k | Problem Statement The problem “Sum of minimum and maximum elements of all subarrays of size read more |

Easy | Find the largest multiple of 3 | Problem Statement The problem “Find the largest multiple of 3” states that you are read more |

Easy | Check if a queue can be sorted into another queue using a stack | Problem Statement The problem “Check if a queue can be sorted into another queue using a read more |

Medium | Priority Queue using doubly linked list | Problem Statement The problem “Priority Queue using doubly linked list” asks to read more |

Easy | Implement Stack and Queue using Deque | Problem Statement The problem “Implement Stack and Queue using Deque” states to write read more |

Easy | Implementation of Deque using circular array | Problem Statement “Implementation of Deque using circular array” asks to implement the read more |

Priority Queue Using Singly Linked List | In priority queue using a singly linked list problem, we need to implement a priority queue by read more | |

Reversing the First K elements of a Queue | In reversing the first K elements of a queue problem we have given a queue and a number k, reverse read more | |

Sorting a Queue without Extra Space | In sorting a queue without extra space problem we have given a queue, sort it using standard queue read more | |

Reversing a Queue using Recursion | In reversing a queue using recursion problem we have given a queue, write a recursive algorithm to read more | |

Queue using Stacks | In queue using a stack problem, we have to implement the following functions of a queue using the read more | |

Reversing a Queue | In Reversing a Queue problem we have given a queue, write an algorithm to reverse the queue. read more | |

Priority Queue in C++ | FIFO manner is used to implement a queue. In a queue, insertions are done at one end (rear) and read more | |

Priority Queue | A priority queue is a type of data structure which is similar to a regular queue but has a priority read more |