|All-time Popular Problems|
|Maximum difference between node and its ancestor|
|Right View of Binary Tree|
|Delete without head pointer|
|Find the number of islands|
|Delete nodes having greater value on right|
|Reverse Level Order Traversal|
|Binary Tree to DLL|
|Find all pairs with a given sum|
|n'th node from end of linked list|
|Equal to product|
Given N * M string array of
Return the number of 'X' total shapes. 'X' shape consists of one or more adjacent
X's (diagonals not included).
OOOXOOO OXXXXXO OXOOOXO answer is 1 , shapes are : (i) X X X X X X X
XXX OOO XXX answer is 2, shapes are (i) XXX (ii) XXX
The first line of input takes the number of test cases, T.
Then T test cases follow. Each of the T test cases takes 2 input lines.
The first line of each test case have two integers N and M.The second line of N space separated strings follow which indicate the elements in the array.
Print number of shapes.
OOOOXXO OXOXOOX XXXXOXO OXXXOOO
XXO OOX OXO OOO XOX XOX OXO XXO XXX OOO