Beats 72%.  || Brute force approach for the problem
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```python3 []
class Solution:
    def areSimilar(self, mat: List[List[int]], k: int) -> bool:
        new =[]
        for i in mat:
            li =[]
            for j in i:
                li.append(j)
            new.append(li)
        for i in range(k):
            for x in mat:
                a = x.pop()
                x.insert(0,a)
        if mat==new:
            return True
        return False
```
['Python3']