def helper(n,mat):
if mat[0][0] == mat[-1][-1]:
return 1
if mat[0][-1] == mat[-1][0]:
return 1
ele1, ele2 = mat[0][0], mat[-1][0]
if ele1 == ele2:
flag = 0
for i in range(n):
if mat[i][-1] == ele1:
flag = 1
break
if flag:
return 1
ele1, ele2 = mat[0][-1], mat[-1][-1]
if ele1 == ele2:
flag = 0
for i in range(n):
if mat[i][0] == ele1:
flag = 1
break
if flag:
return 1
return 0
for _ in range(int(input())):
n,m = map(int,input().split())
mat,tmat = [],[]
for i in range(n):
x = input()
mat.append(x)
for i in range(m):
r = []
for j in range(n):
r.append(mat[j][i])
tmat.append(r)
if n == 1:
if mat[0][0] == mat[0][-1]:
print("YES")
else:
print("NO")
continue
if m == 1:
if mat[0][0] == mat[-1][0]:
print("YES")
else:
print("NO")
continue
if helper(n,mat) or helper(m,tmat):
print("YES")
else:
print("NO")
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |