• 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

[Solved] HourGlass with Largest sum in 2D Array in Python and Java

Om Tayade/4839/0
CodeJAVAPython
YouTube CSEstack

First of all understand the Hourglass. It is shaped as shown in the below image.

hourglass with largest sum in 2D array

There can be multiple hourglass in the 2D array (matrix).

Problem Statement: Write a Python program to find the HourGlass with Largest sum in 2D Array in Python.

Explanation: Solving this problem includes finding all the hourglass and calculating the sum of every hourglass.

This is a coding challenge question. You can solve it in any programming language.

Python Program:

Let’s solve it in Python programming.

Prerequisite:

  • Python Programming
  • for loop in Python

Code:

arr =[
    [1, 1, 1, 0, 0, 0],
    [0, 1, 0, 0, 0, 0],
    [1, 1, 1, 0, 0, 0],
    [0, 0, 2, 4, 4, 0],
    [0, 0, 0, 2, 0, 0],
    [0, 0, 1, 2, 4, 0]]


#This function will return the sum of the hourglass
def sum_hg(x, y):
    sum = arr[x][y] + arr[x][y+1] +arr[x][y+2]
    sum = sum + arr[x+1][y+1]
    sum = sum + arr[x+2][y]+arr[x+2][y+1]+arr[x+2][y+2]
    return sum

size = len(arr)
sum = -63

for x in range(0, (size-2):
    for y in range(0, (size-2):
        k = sum_hg(x, y)
        if k > sum:
            sum = k

print("The largest sum of the HourGlass is ", sum)

Output:

The largest sum of the HourGlass is 19.

Java Program:

Now let’s try to solve this problem in Java programming.

Prerequisite:

  • Basic Java Programming
  • Flow Control Statement in Java

Java Code:

import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;

public class HG_Class {
    public static void main(String[] args) {
        int[][] arr = {{1, 1, 1, 0, 0, 0},
        {0, 1, 0, 0, 0, 0},
        {1, 1, 1, 0, 0, 0},
        {0, 0, 2, 4, 4, 0},
        {0, 0, 0, 2, 0, 0},
        {0, 0, 1, 2, 4, 0}};

        int sum=-63;

        for(int p=5; p>=2; p--) {
            for(int q=5; q>=2; q--){

                int  sum_hg = arr[p][q]+arr[p][q-1]+arr[p][q-2];
                sum_hg += arr[p-1][q-1];
                sum_hg += arr[p-2][q]+arr[p-2][q-1]+arr[p-2][q-2];

                if(sum_hg>sum) sum=sum_hg;
            }
        }
        System.out.println("Largest sum of the HourGlass is "+ sum);
    }
}

Output:

Largest sum of the HourGlass is 19

This is how you can find the hourglass with largest sum in 2D array. This question was asked in the HackerRank test. The level of the question is low.

coding challengePython
Om Tayade
I'm pursuing B.Tech in Computer Science from Pune Institute of Computer Technology. I'm avid learner and enthusiastic programmer.

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

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