Leetcode Weekly Contest 387 | Video Solutions - A to D | by Raghav Goel | TLE Eliminators 

Please fill the Feedback form solutions: forms.gle/2qV3aK4wMm15QXPs7

second question could have been done without using extra space by just transforming the grid using prefix sum over row and columns

Thanks for sharing! We really appreciate your upload, and it's awesome that you take the time to include additional common concepts. Not everyone does that, and it's super helpful for future reference. Keep up the great work! 🚀

Please provide Biweekly contest solutions also...

Hello , Here is my code for the Question No.2 of this contest. int countSubmatrices(vector& grid, int k) { int n = grid.size(); int m = grid[0].size(); if(grid[0][0]>k) return 0; vector temp(n,vector(m)); int ans = 0; for(int i=0;i

thank you so much keep posting

I don't know abou segment trees but explanation sunke achha laga😂

Hi, when can we expect the opening of courses?

for first problem in question it is given as 1 indexed but we are using 0 indexed why?

use better mic voice is not at all loud