Amazon QA question

• YOE : 8+ years exp - currently working in a USA bank
• Coding platform : Hackers rank
• No of questions : 2 including the approach
• Date :06 Mar 2021
• Location :EU

Questions:

1. Robot bounted in a circle- Slight variation from this question (https://leetcode.com/problems/robot-bounded-in-circle/)
2. Sorting the array using a pair in which a[i]>a[j] if i>j and count no of minimum swaps need to sort the array. I couldn't find out exact question.
   Similar to this question-https://algo.monster/problems/amazon_oa_number_of_swaps_to_sort