coding-test | Coding Test | Unit Testing library

In this problem , I have been given an array , and a binary matrix ( matrix consisting of 0 and 1 only ) , i and j value can be thought of index of array elment and if matrix[i][j]==1 then we can swap a[i] and a[j] , now what I have to do is to get the minimum possible permutation using all those one in matrix in any order, this is initial array suppose n = 5 size array is there

4 2 1 5 3

now this is given matrix, which is nXn

00100

00011

10010

01101

01010

using all those one,we can get minimum possible permutation like this (using 1-based indexing to explain)

4 2 1 5 3 initial

we do (p1<->p3)

we get,1 2 4 5 3

now we do (p4<->p5)

we get, 1 2 4 3 5

and now we do (p3<->p4)

we get, 1 2 3 4 5

this is minimum possible we can get using one's

I can think of brute force but that would of course give TIME LIMIT EXCEEDED, so I am wondering how to approach this problem in a better way.

for more detail, here is the link to the problem, https://www.hackerrank.com/contests/pre-placement-coding-test/challenges/smallest-permutation/problem .

I am trying to parse JSON using URLSession and without using Alamofire or anything else.

I just want to take the JSON and put it into a UITableView.

I am trying to piece together what I learned from learning how to Parse JSON using Alamofire with what I can find on google. Many of the answers on youtube or Stack etc use NS for everything..NSURL, NSDictionary, etc etc..Or are just typing code without explaining what/why.

I THINK I am almost there, but I need help understanding what I have left to do.

SO.

I Allowed arbitrary loads in the plst

In a Swift File I have the following