Minimum Adjacent Swaps to Group Identical Elements
Company: Corridor_1oct
Difficulty: hard
array
dynamic-programming
bit-manipulation
bitmask
greedy
counting
sorting
More Corridor_1oct OA questions
Interview experiences