Java Topics
HubJava Collections FrameworkCollections Practice ProgramsComparable vs ComparatorGenericsIteratorArrayListLinkedListStackVectorHashMapHashtableLinkedHashMapTreeMapArrayDequeDeque Double-Ended QueuePriorityQueueHashSetLinkedHashSetTreeSetAdapter PatternBuilder PatternFactory PatternMVC PatternObserver PatternSingleton PatternDynamic ProgrammingGraphHashingHeapLinked List DSAQueue DSARecursionSearching AlgorithmsSorting AlgorithmsStack DSATime ComplexityTreesException Handling Best PracticesCustom ExceptionException Hierarchyfinally BlockException Handlingthrow aur throwstry-catchBuffered StreamsByte StreamsCharacter StreamsDeserializationFile ClassJava NIO New I/OSerializationArrays in JavaArray OperationsArray Practice ProgramsArray Interview QuestionsJagged ArrayMulti-Dimensional ArraysOne Dimensional Arraybreak aur continuedo-while Loopfor Loopif-else StatementsNested Loopsswitch-case Statementwhile LoopJava Compilation ProcessJava ki FeaturesPehla Java ProgramHistory of JavaJava EditionsJava Program StructureJDK, JRE aur JVMJava Kya Hai?Immutable StringsString Class in JavaString Interview QuestionsString MethodsString Practice ProgramsStringBufferStringBuilderComments in JavaData Types in JavaIdentifiers in JavaInput & Output in JavaJava KeywordsOperators in JavaType Casting in JavaVariables in JavaJava Coding Interview QuestionsCollections Interview QuestionsCore Java Interview QuestionsJDBC Interview QuestionsMultithreading Interview QuestionsOOPs Interview QuestionsSpring Framework Interview QuestionsJava 8 Date/Time APIDefault aur Static Methods in InterfaceFunctional InterfaceLambda ExpressionMethod ReferenceOptional ClassStream APIBatch ProcessingCallableStatementJDBC ArchitectureJDBC — Java Database ConnectivityJDBC Practice ProjectsMySQL ConnectionPreparedStatementResultSetStatement InterfaceTransaction ManagementCreating ThreadsDaemon ThreadExecutor FrameworkInter-Thread CommunicationMultithreading Practice ProgramsRunnable InterfaceSynchronizationThread ClassMultithreading IntroductionThread Life CycleThread PriorityJava Cheat SheetImportant Formulas & Key ConceptsImportant Java ProgramsJava Quick RevisionAbstract ClassAbstractionAnonymous ClassClass and ObjectConstructorEncapsulationInheritanceInner ClassInterfaceMethod OverloadingMethod OverridingObject ClassObject CloningObject-Oriented Programming OOPPolymorphismstatic Keywordsuper Keywordthis KeywordWrapper ClassesArray Practice ProgramsBasic Java Practice ProgramsCollection Practice ProgramsJDBC Practice ProgramsMultithreading Practice ProgramsOOPs Practice ProgramsPlacement Coding QuestionsString Practice ProgramsBanking SystemChat ApplicationE-Commerce Backend — Spring Boot REST APIEmployee Management SystemLibrary Management SystemSpring Boot Fullstack ProjectStudent Management SystemCookies in ServletExpression Language ELGenericServletHttpServletJavaServer Pages JSPJSP TagsMVC ArchitectureHttpServletRequest & HttpServletResponseServlet IntroductionServlet Life CycleSession TrackingDependency InjectionSpring BeansSpring CoreSpring FrameworkAPI GatewaySpring Cloud Config ServerDocker DeploymentEureka Server — Service DiscoverySpring Boot CRUD ApplicationException Handling in Spring BootJWT AuthenticationREST API in Spring BootSpring SecuritySpring BootSpring Data JPAValidation in Spring Boot
Deque Double-Ended Queue
Last Updated : 26 May, 2026
title: Deque in Java
Collections Framework49 words4 headingsExamples included
title: Deque in Java description: Double-ended queue interface
Dono ends se add/remove possible. Stack aur Queue dono ki tarah kaam kar sakta hai.
Interface Methods
java exampleWoHoTech
// Front operations
deque.addFirst(e) // Add at front, exception if fails
deque.offerFirst(e) // Add at front, false if fails
deque.removeFirst() // Remove from front, exception if empty
deque.pollFirst() // Remove from front, null if empty
deque.getFirst() // Get front, exception if empty
deque.peekFirst() // Get front, null if empty
// Rear operations
deque.addLast(e)
deque.offerLast(e)
deque.removeLast()
deque.pollLast()
deque.getLast()
deque.peekLast()As Stack
java exampleWoHoTech
Deque<Integer> stack = new ArrayDeque<>();
stack.push(10); // addFirst
stack.pop(); // removeFirst
stack.peek(); // peekFirstAs Queue
java exampleWoHoTech
Deque<Integer> queue = new ArrayDeque<>();
queue.offer(10); // addLast
queue.poll(); // removeFirst
queue.peek(); // peekFirstImplementations
ArrayDeque— Array based, no size limit, fasterLinkedList— Linked list based
Exam Focus
Revise definitions, diagrams, examples, and short-answer points for Deque Double-Ended Queue.
Interview Use
Prepare one clear explanation, one practical example, and one common mistake for this Java topic.
Search Terms
java, java programming, core java, java master course, java notes, master, course, collections
Related Java Topics
Continue learning this concept
Collections FrameworkArrayDequetitle: ArrayDeque in JavaCollections FrameworkPriorityQueuetitle: PriorityQueue in JavaCollections FrameworkJava Collections Frameworktitle: Collections Framework OverviewCollections FrameworkCollections Practice Programstitle: Collections ProgramsCollections FrameworkComparable vs Comparatortitle: Comparable vs ComparatorCollections FrameworkGenericstitle: Generics in Java