1380 Lucky Numbers in a Matrix | Zero to FAANG Kunal | Assignment Solution | Leetcode

1380 Lucky Numbers in a Matrix | Zero to FAANG Kunal | Assignment Solution | Leetcode
Problem link :
leetcode.com/p...
Course link:
github.com/kun...
Complete Java + DSA + Interview Preparation + CP Course
• Java + DSA + Interview...
Hi, thanks for watching our video about 2D Arrays in Java
In this video we’ll walk you through:
- Brute Force
- Efficient approach
- Solution Code
TIMESTAMPS
Intro
Explanation begins
IDE solution
ABOUT OUR CHANNEL
Our channel is all about Programming. We cover lots of cool stuff such as solution to problems, concept explanation and tricks to master CP
Check out our channel here:
/ @programmerszone
Don’t forget to subscribe!
CHECK OUT OUR OTHER Playlists
GeeksforGeeks playlist:
• GeeksforGeeks problems
Complete C++ Course playlist:
• Complete C++ playlist
CodeChef Playlist:
• CodeChef Problems
HackerRank playlist:
• HackeRank problems
LeetCode problems
• Leetcode problems Solu...
FIND US AT
www.waadanibha...
GET IN TOUCH
Contact us on [e-mail]
1380. Lucky Numbers in a Matrix
Easy
624
53
Add to List
Share
Given a m * n matrix of distinct numbers, return all lucky numbers in the matrix in any order.
A lucky number is an element of the matrix such that it is the minimum element in its row and maximum in its column.
Example 1:
Input: matrix = [[3,7,8],[9,11,13],[15,16,17]]
Output: [15]
Explanation: 15 is the only lucky number since it is the minimum in its row and the maximum in its column
Example 2:
Input: matrix = [[1,10,4,2],[9,3,8,7],[15,16,17,12]]
Output: [12]
Explanation: 12 is the only lucky number since it is the minimum in its row and the maximum in its column.
Example 3:
Input: matrix = [[7,8],[1,2]]
Output: [7]
Constraints:
m == mat.length
n == mat[i].length
1 = n, m = 50
1 = matrix[i][j] = 10^5.
All elements in the matrix are distinct.
Accepted
51,317
Submissions
72,853
#codechef #coding #python #hackerrank #programming #java #computerscience #coder #code #competitiveprogramming #machinelearning #pythonprogramming #algorithms #cpp #javascript #hackerearth #webdeveloper #geeksforgeeks #codinglife #leetcode #c #codeforces #engineering #codingmemes #programmer #hacker #programmingmemes #topcoder #webdevelopment #bhfyp #DSAwithKunal

[@rutambhagat4556]

where is the optimized solution for this question? please share the optimized approach which is faster than 100% of java submissions as well Also please provide 53. Maximum Subarray video link

[@ProgrammersZone]

Faster than X% of java submissions doesn't means that the code is optimised it just tells a number just focus on time comlexity because each time you'll run your code the faster results will vary I hope you understand :)

[@angshumanvlogs2613]

for the column it is matrix[i].size() right? but here it is the vice versa how???

[@parthkedari5366]

if you found it, please explain.

[@satyamgupta6030]

very nice explaination but please tell us both brute force and optimised solution. So that we can build the logical thinking to optimised our brute force solution with an optimised one.. once again thank you for the video.

[@ProgrammersZone]

Will try thanks for supporting :)

[@aj-lan284]

Bhai yellow/white pe use kro yarr, kucj bhi nhi dikhta

[@deepakchaudhary01]

As a feedback when you write, please keep the handwriting stable, it gets messed up. atleast legible.

[@meetabhashiniparida9417]

Thanku sir🙏🏼

[@ProgrammersZone]

welcome

[@richisantra6407]

explain the last for loop

[@ProgrammersZone]

Of brute force approach or optimised one?

[@richisantra6407]

@@ProgrammersZone brute force

[@ProgrammersZone]

Using the 1st inner nested for loop we calculate the minimum value in the row and using the second one we check whether that value is maximum in its column I hope now it is clear else we can schedule a meet

[@richisantra6407]

@@ProgrammersZone r u available in instagram?

[@ProgrammersZone]

Yepp programmers_zone_official