JobsJob TrackerJob alerts

HPE · 18 questions

All 18Coding 12Low-Level Design 3
  • O(1) Erase from Beginning or EndCoding
  • Percentage Reversal
  • Infection Probability from Specific Group
  • Pie Chart Central Angles
  • Stack Binary Push Code OutputCoding
  • Quicksort Partition IndexCoding
  • Minimum Cost String GenerationCoding
  • Process Creation with ForkLow-Level Design
  • Disk Scheduling AlgorithmsLow-Level Design
  • Bootstrap Storage PropertiesLow-Level Design
  • Sum of Nobita NumbersCoding
  • String SanitizationCoding
  • String Length without LibraryCoding
  • Infinite Grid PathCoding
  • Sorted SquaresCoding
  • Matrix element transformationCoding
  • Sieve of Eratosthenes problemCoding
  • Sort a Linked ListCoding
← HPE questions
  1. Interview questions
  2. HPE
  3. O(1) Erase from Beginning or End
Coding

O(1) Erase from Beginning or End

Filed under HPE

The question

Identify which data structure(s) among array, dynamic array, singly linked list, doubly linked list, or deque allow erasing from the beginning or end in O(1) time.

No write-up yet. Related questions below have one.

Related HPE questions

  • Stack Binary Push Code Output
  • Quicksort Partition Index
  • Minimum Cost String Generation
  • Sum of Nobita Numbers
  • String Sanitization
Percentage Reversal →

Collected from public candidate posts and coding forums. Updated Nov 2026.