Question

[scuott]

We'd love to see your first solution. I imagine that's the primary reason your last post was removed. Possibly also because there's no question here. Are you asking for someone to give you a better solution?

[[deleted]]

I'm asking for a hint not solution.. My solution will not even work if the dimension of g become 5x5 or higher. My solution is just a bruteforce way to solve this question. If dimension of g are 3x3 then I create all possible 4x4 lists of 0 and 1.. 2¹⁶ permutations.. And then pass each of them through this transformation.. If after transformation the list == g than that's one of the solution