Questions from this loop
Round 1: OA Task 1: DSA – Minimum Adjacent Swaps for Binary Array Given an array consisting