| CARVIEW |
Select Language
HTTP/2 200
content-type: text/html; charset=utf-8
date: Mon, 25 Aug 2025 19:53:21 GMT
permissions-policy: interest-cohort=()
strict-transport-security: max-age=31536000; includeSubDomains
server: nginx
cache-control: s-maxage=48659, max-age=0
x-powered-by: Next.js
etag: "hm4kpb4hch7ub5"
content-encoding: gzip
x-xss-protection: 1; mode=block
x-content-type-options: nosniff
referrer-policy: no-referrer-when-downgrade
content-security-policy: default-src 'self' http: https: ws: wss: data: blob: 'unsafe-eval' 'unsafe-inline'; frame-ancestors 'self';
vary: Accept-Encoding
x-cache: Miss from cloudfront
via: 1.1 0cbd41082a6576859c7276cb4bd0e42c.cloudfront.net (CloudFront)
x-amz-cf-pop: BOM78-P9
x-amz-cf-id: UEy3S-l9cp2T5c604SD8Yx0hTDjVXOSU0OoGN3Jrr8Agw3GocJZgTQ==
stack | and queue pune contest | Question 3 
- Courses
- Tutorials
- Practice
- Jobs
Data Structure
Java
Python
HTML
Interview Preparation
Interview Preparation
- Interview Preparation For Software Developers
- Must Coding Questions - Company-wise
- Must Do Coding Questions - Topic-wise
- Company-wise Practice Problems
- Company Preparation
- Competitive Programming
- Software Design-Patterns
- Company-wise Interview Experience
- Experienced - Interview Experiences
- Internship - Interview Experiences
stack | and queue pune contest | Question 3
Last Updated :
Discuss
Comments
A data structure in which elements can be inserted or deleted at/from both ends but not in the middle is?
Queue
Circular queue
Dequeue
Priority queue
This question is part of this quiz :
stack and queue pune contestTags:
Share your thoughts in the comments
GeeksforGeeks
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy