• Home
  • Subscribe
  • Contribute Us
    • Share Your Interview Experience
  • Contact Us
  • About
    • About CSEstack
    • Campus Ambassador
  • Forum & Discus
  • Tools for Geek
  • LeaderBoard
CSEstack

What do you want to Learn Today?

  • Programming
    • Tutorial- C/C++
    • Tutorial- Django
    • Tutorial- Git
    • Tutorial- HTML & CSS
    • Tutorial- Java
    • Tutorial- MySQL
    • Tutorial- Python
    • Competitive Coding Challenges
  • CSE Subject
    • (CD) Compiler Design
    • (CN) Computer Network
    • (COA) Computer Organization & Architecture
    • (DBMS) Database Management System
    • (DS) Data Structure
    • (OS) Operating System
    • (ToA) Theory of Automata
    • (WT) Web Technology
  • Interview Questions
    • Interview Questions- Company Wise
    • Interview Questions- Coding Round
    • Interview Questions- Python
    • Interview Questions- REST API
    • Interview Questions- Web Scraping
    • Interview Questions- HR Round
    • Aptitude Preparation Guide
  • GATE 2021
  • Linux
  • Trend
    • Full Stack Development
    • Artificial Intelligence (AI)
    • BigData
    • Cloud Computing
    • Machine Learning (ML)
  • Write for Us
    • Submit Article
    • Submit Source Code or Program
    • Share Your Interview Experience
  • Tools

[Coding Challenge] Special Elements in Matrix

Aniruddha Chaudhari/15096/4
Code
YouTube CSEstack

This coding challenge was asked in Goldman Sachs coding round.

Problem Statement:

Given a matrix of size m*n, m denotes the row starting with index 0 and n denotes the column starting with index 0.

The matrix will hold distinct integers as elements.

We need to find a distinct number of positional elements which are either the minimum or maximum in their corresponding row or column.

Please return -1 if any row or any column has multiple minimum or maximum elements.

For example, given a matrix of size 3*3, the elements are stored as follows.

1  3  4
5  2  9
8  7  6

The expected output is 7.

In the above example, we identified the output as 7 based on below.

1 - minimum in row and column
4 - Maximum in row
2 - Minimum in column and row
9 - Maximum in row and column
8 - Maximum in row and column
7 - Maximum in column
6 - Minimum in row

Input:

m - integer - number of rows
n - integer - number of columns
m * n matrix

Output:

r - integer - result

Constraints:

0<m,n<100
Elements in the matrix are positive integers.

Programming Solution in Python:

import math
import os
import random
import re
import sys
 
# Complete the countSpecialElements function below.
 
def countSpecialElements(matrix):
  nRows= len(matrix)
  nCount=0
 
  for row in matrix:
    for indexCol, element in enumerate(row):
 
      if element==min(row) or element==max(row):
        if row.count(element)>1:
          return -1
        nCount=nCount+1
 
      else:
        listColumn=[]
 
        for indexRow in range(0, nRows):
          listColumn.append(matrix[indexRow][indexCol])
 
        if element==min(listColumn) or element==max(listColumn):
          if listColumn.count(element)>1:
            return -1
          nCount=nCount+1

  return nCount
 
if __name__ == '__main__':
  nCount = countSpecialElements([[1, 3, 4],[5, 2, 9],[8, 7, 6]])
  print(nCount)

Output:

7

In Python, matrix elements are stored as a nested list. To solve this kind of problem, you should have a good understanding of the list and its methods.

If you are solving this coding question in a competitive test round, consider all boundary cases.

There was one more question was asked in Goldman Sachs coding round- Secure My Conversation.

Python Interview Questions eBook

coding challengePython
Aniruddha Chaudhari
I am complete Python Nut, love Linux and vim as an editor. I hold a Master of Computer Science from NIT Trichy. I dabble in C/C++, Java too. I keep sharing my coding knowledge and my own experience on CSEstack.org portal.

Your name can also be listed here. Got a tip? Submit it here to become an CSEstack author.

Comments

  • Reply
    Ravi
    March 2, 2020 at 12:15 am

    The output of your code is 10, not 9.

    • Reply
      Aniruddha Chaudhari
      March 2, 2020 at 6:52 pm

      Edited. Thanks for the correction, Ravi!

  • Reply
    Moksha Jain
    May 9, 2020 at 1:58 pm

    Sir, there is a mistake in code…of indentation inside else block…

                    for indexRow in range(0, nRows):
                        listColumn.append(matrix[indexRow][indexCol])
    
                    if element == min(listColumn) or element == max(listColumn):
                            if listColumn.count(element) &gt; 1:
                                return -1
                            nCount = nCount + 1
    

    the correct output is 7.
    Thanks

    • Reply
      Aniruddha Chaudhari
      May 9, 2020 at 5:28 pm

      Thanks for the correction, Moksha! Indentation is fixed.

Leave a Reply Cancel reply

Why?

Why Competitive Programming Important?

Coding Challenges for Practice

  1. Count Common Factor
  2. Does it Divide
  3. Sum of Sub Arrays
  4. Remove Duplicate Char from String
  5. Sort String by Char Freq (Python)
  6. Sort String by Char Freq (Java)
  7. Split Array into Equal Sum Subarray
  8. Validate IP Address
  9. Validate PAN Card Number
  10. Sort Circular Rotated Array
  11. Min Arrow to Burst Bubbles
  12. HourGlass with Largest Sum
  13. Max Profit by Buying/Selling Stocks
  14. Hailstone Sequence
  15. Reverse String without affecting Special Characters
  16. Secure Conversation by Encry/Decry
  17. Special Elements in Matrix
  18. Next Greater No with Same set of Digits
  19. Smallest Subarray with Sum Greater than Given Number
  20. Group Anagrams
  21. Find Duplicates in Array in O(n)
  22. Find Two Unique Numbers from Array in O(n)
  23. Number Patterns & Finding Smallest Number
  24. Minimum Cost of Merging Files [Amazon]
  25. Minimum Distance for Truck to Deliver Order [Amazon]
  26. Minimum Coins Required
  27. Max Sum Subarray
  28. Merge Overlapping Intervals
  29. Longest Balanced Subarray
  30. Longest Path in a Weighted Tree
  31. Generate Balanced Parentheses
  32. PostOrder Traversal Without Recursion

© 2021 – CSEstack.org. All Rights Reserved.

  • Home
  • Subscribe
  • Contribute Us
    • Share Your Interview Experience
  • Contact Us
  • About
    • About CSEstack
    • Campus Ambassador
  • Forum & Discus
  • Tools for Geek
  • LeaderBoard