| CARVIEW |
Select Language
HTTP/2 200
content-type: text/html; charset=utf-8
date: Sat, 23 Aug 2025 12:24:50 GMT
permissions-policy: interest-cohort=()
strict-transport-security: max-age=31536000; includeSubDomains
server: nginx
cache-control: s-maxage=60723, max-age=0
x-powered-by: Next.js
etag: "11ciztzc7h98a1r"
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 ede20cdfefdc1dd189c132c45a53a14c.cloudfront.net (CloudFront)
x-amz-cf-pop: BOM78-P9
x-amz-cf-id: Pm5at_ynTfYTuEt2HrM27keWq0UDDX1tCccaNTXPRJEDeifxiGAn3Q==
deque Question 7 
- 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
deque Question 7
Last Updated :
Discuss
Comments
How does C++ STL deque achieve O(1) insertions, deletions, and random access?
Circular array with dynamic resizing
Linked list for insertions and deletions
Array of pointers to fixed-size blocks
Single dynamic array with resizing
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