JobsJob TrackerJob alerts

OneStack ยท 11 questions

All 11Coding 2System Design 2Behavioral 3Product Sense 1
  • Data structure for an O(1) LRU cacheSystem Design
  • Data structure for a spell checkerSystem Design
  • Output prediction and time complexity of code fragments
  • Keep only the first two occurrences of each elementCoding
  • Sorted insertion into a linked listCoding
  • Binary tree vs BST and BST complexity
  • ML project: model choice, dataset, epochs, CNN and RNNBehavioral
  • How Google Maps estimates travel timeProduct Sense
  • MySQL vs MongoDB and when to use each
  • Difficulty faced during a projectBehavioral
  • Healthy work environment, work-life balance, what to expect from youBehavioral
โ† OneStack questions
  1. Interview questions
  2. OneStack
  3. Output prediction and time complexity of code fragments

Output prediction and time complexity of code fragments

Filed under OneStack

The question

Basic DSA, output-based questions and identifying the time complexity of given code fragments.

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

Related OneStack questions

  • Data structure for an O(1) LRU cache
  • Data structure for a spell checker
  • Keep only the first two occurrences of each element
  • Sorted insertion into a linked list
  • Binary tree vs BST and BST complexity
โ† Data structure for a spell checkerKeep only the first two occurrences of each element โ†’

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