JobsJob TrackerJob alerts

Fab.com ยท 19 questions

All 19Coding 15System Design 3Low-Level Design 1
  • Two numbers with sum closest to zeroCoding
  • Segregate 0s and 1sCoding
  • The Celebrity ProblemCoding
  • When should indexes be used in Database?Low-Level Design
  • Largest number from arrayCoding
  • Sort 0s and 1sCoding
  • Search in sorted matrixCoding
  • Reverse stack without extra spaceCoding
  • Maximum stock profitCoding
  • Insert into sorted cyclic linked listCoding
  • Median of two sorted arraysCoding
  • All subsets of a stringCoding
  • Find the occurrence of first 1 in a sorted array of 0s and 1sCoding
  • Design a data structure for minimum path between computers and printersSystem Design
  • Find a and b such that a < b and a+b = nCoding
  • Design of NLQ Parser and callbacks in a generic treeSystem Design
  • Maintainable code for divisibility logicCoding
  • Find integer points in a circleCoding
  • Model an elevatorSystem Design
โ† Fab.com questions
  1. Interview questions
  2. Fab.com
  3. Reverse stack without extra space
Coding

Reverse stack without extra space

Filed under Fab.com

The question

Reverse a stack without using additional data structures.

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

Related Fab.com questions

  • Two numbers with sum closest to zero
  • Maximum stock profit
  • Insert into sorted cyclic linked list
  • All subsets of a string
  • Find the occurrence of first 1 in a sorted array of 0s and 1s
โ† Search in sorted matrixMaximum stock profit โ†’

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