Three Partition Array

Problem Overview

• Partition an integer array into three parts: < lowVal, within [lowVal, highVal], and > highVal.
• Input: int array, lowVal, highVal; Output: array rearranged; within-group order irrelevant; if both exist, lowVal precedes highVal.
• Real-world context: bucketizing data by thresholds for fast categorization.
• From Microsoft interviews: a coding interview problem and common interview question.