How should I practice Three Partition Array?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Microsoft phone screen problems in FastPrep.

Is Three Partition Array associated with Microsoft?

FastPrep tags this as a Microsoft phone screen coding practice problem when the problem catalog has that company and stage context.

Problem · Array

Three Partition Array

Learn this problem

● Easy

MicrosoftPHONE SCREEN

See Microsoft hiring insights

Problem statement

Given an array and a range [lowVal, highVal], partition the array into three parts:

All elements smaller than lowVal come first.

All elements in the range [lowVal, highVal] come next.

All elements greater than highVal come last.

Additionally: If lowVal and highVal exist in the array, ensure that lowVal appears before highVal in the final result. The relative order of elements within each group doesn't matter.

Function

threePartitionArray(arr: int[], lowVal: int, highVal: int) → int[]

Complete the function threePartitionArray in the editor.

threePartitionArray has the following parameters:

int arr[]: an array of integers
int lowVal: an integer representing the lower bound of the range
int highVal: an integer representing the upper bound of the range

halo frenz - you might want to checkout lc75. They said that these 2 questions are relevant :)

Examples

Example 1

arr = [1, 14, 5, 20, 4, 2, 54, 20, 87, 98, 3, 1, 32]lowVal = 14highVal = 20return = [1, 5, 4, 2, 1, 3, 14, 20, 20, 98, 87, 32, 54]

nothin found 🥹

Constraints

nothin found againnnn 😭