Leetcode Weekly Contest 403 | Video Solutions - A to D | by Viraj Chandra | TLE Eliminators

[@TLE_Eliminators]

Please fill the feedback form: forms.gle/UetQqvq4TiZVZtbx7

[@kavinshah4302]

Very Well Explaination Viraj Sir !!

[@prabhjeetsingh6305]

for 2nd question, I was not able to come up with this logic during the contest, now that I see this, it seems easy, but, would request you to suggest any other ideas too, though I understand that this is the easiest possible logic

[@amanasrani6405]

Here is my approach for the 2nd question class Solution { public: int findMax(const vector& indexArray) { if (indexArray.empty()) return -1; return *max_element(indexArray.begin(), indexArray.end()); } int findMin(const vector& indexArray) { if (indexArray.empty()) return -1; return *min_element(indexArray.begin(), indexArray.end()); } int minimumArea(vector& grid) { int rows = grid.size(); int cols = grid[0].size(); vector oneRowIndex; vector oneColIndex; for(int i = 0; i < rows; i++) { for(int j = 0; j < cols; j++) { if(grid[i][j] == 1) { oneRowIndex.push_back(i); oneColIndex.push_back(j); } } } if(oneColIndex.empty()) return 0; int minRow = findMin(oneRowIndex); int maxRow = findMax(oneRowIndex); int minCol = findMin(oneColIndex); int maxCol = findMax(oneColIndex); int height = maxRow - minRow + 1; int width = maxCol - minCol + 1; return height * width; } };

[@fuel-the-fire-now]

brother!!, beautiful explanation for 4th one

[@yashmalviya0149]

[2, -3, -7] taking subarrays [2, -3, -7] or [2, -3] and [-7] gives -2 as total cost but taking subarrays [2] and [-3, -7] gives you 6 as total cost...

[@prakashdeshmukh222]

Good explanation with how he thinks about the problem in the contest

[@rishabhjain563]

amazing explanation of the d question!

[@krishmakhija8333]

Great explanation of 4th ,understood competely

[@Abhay14]

great explaination bhaiya 😊

[@vickyroy3595]

Virajj !! Great explanation!!❤

[@SumitKumar-du6vf]

For Q3 how to tackle during the contest as their problem statements are such bullshit... though Excellent explanation brother🔥

[@-VLaharika]

The solution for third is giving TLE in java

[@roshangeorge97]

best mentor❤

[@omikakadiya]

very nice solution of 3rd and 4th bro

[@ammanchhetri6716]

im going to see ur code.....just to copy those boxes you draw for future reference 😏

[@VirajChandra]

Hahaha lol

[@ashutoshpatel2050]

I was able to come up with the exact same approach for the 4th question but missed it just by some mins due to wrong coordinates , However Will memoizing the answer for a particular set of rectangles optimize the soln any further or there would be no overlapping rectangles?

[@VirajChandra]

I did not think about this since this seemed within the TC boundaries.

[@rizwanaman-q3n]

No audio..😢

[@TLE_Eliminators]

The audio issue at some specific timestamp or in the entire video?

[@jitushekkumar7083]

bro use darkmode.

[@VirajChandra]

Ok Bro. I'll take care.

[@23cash86]

Viraj 🫡🫡🫡

[@Munnu-hs6rk]

Leetcode contest are so shit now

[@voicechanger3635]

true, they should be more hard

[@vickyroy3595]

whenever i see dp problem doing greedily!!🥲