1p3a Question · Jan 2026

Microsoft Online Assessment Lexicographically Smallest String Problem

Question Details

We are given a string S of length n. We are also given two integer arrays : arr and brr of same length m. Now arr[i] or brr[i] = 0..n-1 . Now in one operation we can choose any index j : 0 <= j < m. A

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Arrays Strings