ROW WITH MINIMUM SUM IN 2D ARRAY USING JAVA | USER INPUT | BHARAT TECH SHOW
HELLO EVERYONE, WELCOME TO BHARAT TECH SHOW!
In this Java tutorial, we learn how to find the row with the minimum sum in a 2D array (matrix) using a simple and beginner-friendly approach.
The program takes user input for the number of rows, columns, and array elements using the Scanner class. After storing the elements in a 2D array, we calculate the sum of each row using nested for loops and identify which row has the minimum sum.
🔹 Basic Idea (Comment Style)
// Take rows and columns as user input
// Store elements in 2D array
// Calculate sum of each row
// Compare row sums
// Find row having minimum sum
🔹 Concepts Covered
2D Array (Matrix) in Java
User input using Scanner class
Nested for loops
Row-wise sum calculation
Logic to find minimum row sum
Printing row index with minimum sum
🔹 Sample Input
// Number of rows = 3
// Number of columns = 3
// Array elements:
// 1 2 3
// 4 5 6
// 7 8 9
🔹 Output
// Min Sum of the row = 6
// Row index with minimum sum = 0
🎯 This program is very useful for beginners, college practicals, viva questions, and Java interview preparation.
👍 LIKE | SHARE | SUBSCRIBE
📺 BHARAT TECH SHOW