- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

Suppose we have a number n representing the length of an n x n board. We have to delete all cells that are diagonal to one of the four corners and return the number of empty cells.

So, if the input is like n = 4,

X | O | O | X |

O | X | X | O |

O | X | X | O |

X | O | O | X |

Then the output will be 8.

To solve this, we will follow this formula −

- n*n - 2 * n +(n mod 2)

Let us see the following implementation to get better understanding −

class Solution: def solve(self, n): return n*n - 2 * n + (n%2) ob = Solution() print(ob.solve(4))

4

8

- Related Questions & Answers
- Find paths from corner cell to middle cell in maze in C++
- Program to find largest island after changing one water cell to land cell in Python
- Program to find string after removing consecutive duplicate characters in Python
- Cell fusion in Python
- Program to find shortest string after removing different adjacent bits in Python
- Program to find mean of array after removing some elements in Python
- Smallest number after removing n digits in JavaScript
- Balance a string after removing extra brackets in C++
- Maximum points covered after removing an Interval in C++
- Removing duplicates from tuple in Python
- Removing strings from tuple in Python
- Working Principle of Voltaic Cell (Galvanic Cell)
- Minimize ASCII values sum after removing all occurrences of one character in C++
- Maximize the maximum subarray sum after removing at most one element in C++
- K-th smallest element after removing some integers from natural numbers in C++

Advertisements