LeetCode Question · Jul 2023

Microsoft OA Question

4 upvotes 761 views 7 replies

Question Details

Given a permutation array P (1-based indexing), find the total number of steps required to sort the same array using the permutation array. Constraints: n = arr.length 2<=n<=10^5 Example: Say P =[2,5,4,3,1] Copy...

Full Details

🔒

Unlock all Microsoft questions

Full insider details, leaked discussions, and candidate experiences.

or every company, $100/year →

About This Question

This is a reported interview question from a microsoft interview for a swe role during the oa round reported in 2023.

It covers the following topics: Arrays, Backtracking .