Find the Index Range of a Target in a Sorted Array
Company: Citadel
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Technical Screen
Quick Answer: This question evaluates a candidate's grasp of binary search and its adaptation to locate boundary positions within a sorted array. It tests the ability to design an algorithm that meets a strict logarithmic time complexity requirement rather than a simpler linear scan. Such problems are common in coding interviews to assess precision with edge cases and search-space reasoning.