2373. Largest Local Values in a Matrix | leetcode daily challenge | DSA | Hindi

Problem Name:
2373. Largest Local Values in a Matrix
Problem Statement:
You are given an n x n integer matrix grid.
Generate an integer matrix maxLocal of size (n - 2) x (n - 2) such that:
maxLocal[i][j] is equal to the largest value of the 3 x 3 matrix in grid centered around row i + 1 and column j + 1.
In other words, we want to find the largest value in every contiguous 3 x 3 matrix in grid.
Return the generated matrix.
Problem link:
leetcode.com/p...
Java Plus DSA Placement Course Playlist:
• Java and DSA Course Pl...
Java Plus DSA Sheet:
docs.google.co...
Notes:
github.com/Tiw...
Telegram Link:
shashwattiwari...
Ultimate Recursion Series Playlist:
• Recursion and Backtrac...
Instagram Handle: (@shashwat_tiwari_st)
shashwattiwari...
Samsung Interview Experience:
• I cracked Samsung | SR...
Company Tags:
Facebook | Amazon | Microsoft | Netflix | Google | LinkedIn | Pega Systems | VMware | Adobe | Samsung
Timestamp:
0:00 - Introduction
#ShashwatTiwari #coding​​ #problemsolving​

[@shashwat_tiwari_st]

can you guys answer this? There are some common cells so can we use a sliding window to solve this? Will it be more optimal?

[@decodingNikhil]

YESSSSSSSSSSSS but i don't know why I am not getting it how its working !

[@GouravCE]

Never used sliding window for 2d arrays😢

[@tekikarthik4603]

sir thanks for excellent explanation

[@RohitKumar-dz8dh]

Sir i need to learn sliding window technique to answer your question. Thanks 😊.

[@mr.nishantawasthi4402]

Sir tress k baad next data structure kon sa padhenge please reply 🙏

[@Harsh-jc2bz]

graph padh lo, agar tree,stack,queue, recurssion, backtracking ata h toh