Maximum borders | Hackerearth solutions

 Program :-

You are given a table with $n$ rows and $m$ columns. Each cell is colored with white or black. Considering the shapes created by black cells, what is the maximum border of these shapes? Border of a shape means the maximum number of consecutive black cells in any row or column without any white cell in between.

A shape is a set of connected cells. Two cells are connected if they share an edge. Note that no shape has a hole in it.

Input format

• The first line contains $t$ denoting the number of test cases.
• The first line of each test case contains integers $n,m$ denoting the number of rows and columns of the matrix. Here, '#' represents a black cell and '.' represents a white cell. 
• Each of the next $n$ lines contains $m$ integers.

Output format

Print the maximum border of the shapes.

Sample Input

10
2 15
.....####......
.....#.........
7 9
...###...
...###...
..#......
.####....
..#......
...#####.
.........
18 11
.#########.
########...
.........#.
####.......
.....#####.
.....##....
....#####..
.....####..
..###......
......#....
....#####..
...####....
##.........
#####......
....#####..
....##.....
.#######...
.#.........
1 15
.....######....
5 11
..#####....
.#######...
......#....
....#####..
...#####...
8 13
.....######..
......##.....
########.....
...#.........
.............
#######......
..######.....
####.........
7 5
.....
..##.
###..
..##.
.....
..#..
.#...
14 2
..
#.
..
#.
..
#.
..
..
#.
..
..
..
#.
..
7 15
.###########...
##############.
...####........
...##########..
.......#.......
.....#########.
.#######.......
12 6
#####.
###...
#.....
##....
###...
......
.##...
..##..
...#..
..#...
#####.
####..

Sample Output

4
5
9
6
7
8
3
1
14
5

Time Limit: 1

Memory Limit: 256

Source Limit:

Code(c++):-

#include <bits/stdc++.h>

using namespace std;

#define ed '\n'

#define gp ' '

#define ll long long int

#define vec vector

#define str string

#define all(x) x.begin(), x.end()

const int mod = 1e9 + 7;

const int inf = 1e9;

bool solve()

{

int n, m, i, start, end, ans = INT_MIN;

cin >> n >> m;

string line;

while (n--)

{

cin >> line;

for (i = 0; i < m; i++)

{

if (line[i] == '#')

break;

}

start = i;

for (; i < m; i++)

{

if (line[i] == '.')

break;

}

end = i;

ans = max(ans, end - start);

}

cout << ans << ed;

return true;

}

int main()

{

ios_base::sync_with_stdio(false);

cin.tie(NULL);

int t;

cin >> t;

while (t--)

solve();

return 0;

}

Recommended Post :-

HCL Coding Questions:-

• Count Even Sum
  
• Length of Hypotenuse
  

Capgemini Coding Questions:-

• Move Hash
  
• Character with their frequency
  

iMocha coding Questions:-

• Mathematical Calculation: Prime number
  
• Mathematical calculation : odd numbers
  

Tech Mahindra coding questions:-

• Find Even odd difference
  
• Find Total curtains
  
• Find odd even difference
  
• Find total sum
  

Unthinkable Solutions coding questions:-

• Swap the adjacent characters of the string
  
• Double the vowel characters in the string
  
• Character with their frequency
  
• Program to find the closest value
  

Must check this:-

• PPS lab all the problems of 1st year 
• C- program of CPU scheduling Algorithms

Companies interview:-

• Swap adjacent characters 
• Double the vowel characters
  
• Check valid parenthesis
  
• Print the characters with their frequencies
  
• Find closest value
  
• Word Count
•  Program of CaesarCipher
• Program to find the perfect city
• Annual Day | Tech Mahindra coding question
• Find the number of pairs in the array whose sum is equal to a given target.

Full C course:-    

• C -Tutorial
  

Key points:-

• How to set limit in the floating value in python
  
• What is boolean data type
• How to print any character without using format specifier
• How to check that given number is power of 2 or not
  
• How to fix limit in double and floating numbers after dot (.) in c++
  
• How to print a double or floating point number in scientific notation and fixed notation
  
• How to take input a string in c
  
• How to reduce the execution time of program in c++.
  

Cracking the coding interview:-

 Array and string:-

• Is Unique
  
• Check Permutation
  
• Urlify
  
• One away
  
• String Compression
  
• Zero matrix
  

Tree and graph:-

• Route between nodes
  
• Minimal Tree
  
• List of Depth
  
• Validate BST
  
• Successor
  

Hackerearth Problems:-

• Very Cool numbers | Hacker earth solution
• Vowel Recognition | Hackerearth practice problem solution
  
• Birthday party | Hacker earth solution
• Most frequent | hacker earth problem solution
• program to find symetric difference of two sets
•  cost of balloons | Hacker earth problem solution
• Chacha o chacha | hacker earth problem solution
• jadu and dna | hacker earth solution
• Bricks game | hacker earth problem
• Anti-Palindrome strings | hacker earth solution
• connected components in the graph | hacker earth data structure
• odd one out || hacker earth problem solution
• Minimum addition | Hackerearth Practice problem
  
• The magical mountain | Hackerearth Practice problem
  
• The first overtake | Hackerearth Practice problem
  

Hackerrank Problems:-

•  Playing With Characters | Hackerrank practice problem solution
• Sum and Difference of Two Numbers | hackerrank practice problem solution
  
• Functions in C | hackerrank practice problem solution
  
• Pointers in C | hackerrank practice problem solution
  
• Conditional Statements in C | Hackerrank practice problem solution
  
• For Loop in C | hackerrank practice problem solution
  
• Sum of Digits of a Five Digit Number | hackerrank practice problem solution
  
• 1D Arrays in C | hackerrank practice problem solution
  
• Array Reversal | hackerrank practice problem solution
  
• Printing Tokens | hackerrank practice problem solution
  
• Digit Frequency | hackerrank practice problem solution
  
• Calculate the Nth term | hackerrank practice problem solution

Data structure:-

•   Program to find cycle in the graph
• Implementation of singly link list
• Implementation of queue by using link list
• Algorithm of quick sort
• stack by using link list
• program to find preorder post order and inorder of the binary search tree
• Minimum weight of spanning tree
  
• Preorder, inorder and post order traversal of the tree

Must check this:-

• PPS lab all the problems of 1st year 
• C- program of CPU scheduling Algorithms

 MCQs:-

• Engineering mathematics -4 MCQs
• CSS (Computer cyber security ) MCQS