## Circular Queue in Data Structure

In this Blog, we will talk about circular queue in data structure. We will cover the multiple approaches to implement circular queue in data structure. Also we will see the...

Skip to content
## Circular Queue in Data Structure

## Difference Between Array, Queue and Stack

## Array Representation of a Binary Heap

## Program to Print Roll No of Students Seated at Even Position

## Find Maximum

## Find the Missing

## Quality Factor

## Rectangular Sweet Box

## Unique Array

## Unique Color Shirt

## Find the Leader

## Find Number of Sub-arrays with sum is greater than or equal to K

## Interesting Array

## Greater than Neighbor

## Greater And Least

## Array Max

## Arithmetic Progression

## Friends Ages

## Quadrilateral

## Saitama’s Punch

## Minimum number of notes

Get free ebooK with 50 must do coding Question for Product Based Companies solved

Fill the details & get ebook over email

Thank You!

We have sent the Ebook on 50 Must Do Coding Questions for Product Based Companies Solved over your email. All the best!

In this Blog, we will talk about circular queue in data structure. We will cover the multiple approaches to implement circular queue in data structure. Also we will see the...

Array: An Array is a collection of elements which are stored in a contiguous memory. The idea is simple i.e. to store the multiple elements together. Due to which we...

What is Binary Heap? A Binary Heap is a complete binary tree that follows a heap ordering property. The representation is done as: Parent Node: (i-1)/2 Left Child: (2i) +...

Arrays are the data structures that enables us to store data of similar type under the same variable name. It can be used to store the details of the student...

CONCEPTS USED: Arrays DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given an array A of N positive integers. The task is to find the maximum of j - i such that A[j]...

CONCEPTS USED: Basic Mathematics DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): Given an array A with N-1 elements, with elements from 1 to N present into it. Find a single missing element....

CONCEPTS USED: Basic Mathematics DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given a magical container such that whenever :- A Red Stone is added to the ith bag, the quality factor of...

CONCEPTS USED: Post Min array DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given an array A with N elements, your task is to divide the array in maximum possible segments such that...

CONCEPTS USED: Hashing DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): Given an array A with N elements containing all elements from 0 to N-1, your task is to find the maximum length...

CONCEPTS USED: Hashing DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): Given an array A with N integers, find the count of unique integers in the array. See original problem statement here For...

CONCEPTS USED: Basic Mathematics DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): Print all those elements that have no element greater than them in the right side of the array. Print elements from...

Finding the number of subarrays with a sum greater than or equal to a given value K is a common problem in array manipulation. The task involves determining the count...

Concepts used: Two Pointers Technique Difficulty level: Medium Problem statement(SIMPLIFIED): Given an array A with N elements arranged in an ascending order, also given a number K. Check if their...

In this article, we will be looking at how we can solve the problem Greater than neighbor, in which you are given an Array and you need to print all...

CONCEPTS USED: Searching DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given a number N, find the smallest number that has same set-of-digits as N and is greater than N. If N is...

CONCEPTS USED: Suffix Sum Arrays DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given an array of N integers and an integer K, the task is to find the maximum sum taking every...

CONCEPTS USED: Hashing, Basic Mathematics DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given an array of N integers, print the value of all those elements, whose indexes form an increasing Arithmetic Progression...

CONCEPTS USED: Hashing DIFFICULTY LEVEL: Medium PROBLEM STATEMENT(SIMPLIFIED): Given N ages of students of a college and some conditions which determine whether A can Friend Request B or not. Determine...

CONCEPTS USED: Basic Mathematics, Co-ordinate Geometry DIFFICULTY LEVEL: Easy PROBLEM STATEMENT(SIMPLIFIED): Given 4 coordinate points, check if the given quadrilateral formed from given coordinates forms a Square or not, print...

CONCEPTS USED: Basic Mathematics DIFFICULTY LEVEL: Hard PROBLEM STATEMENT(SIMPLIFIED): Given an array A which contains the sorted time points at which a hero named Saitama punches and paralyzes his enemy...

The concept of finding the minimum number of notes refers to a problem often encountered in programming, where the goal is to determine the smallest number of currency notes required...