who else is here from daily leetcode problem 💀

Amazing explanation bhaiya , so cool and calm and clear .

Atleast bulid the approach with dry run coding part is not a very big deal.

how do one come up with this on his own i could never think of backtracking

@prathamsharma3502

Жыл бұрын

leetcode daily problem se sidha idhar xD

Recursion stack space ki wajah se space constant nahi hogi.

Great

class Solution { public: int maximumRequests(int n, vector& requests) { vectorinner(n,0); vectorouter(n,0); for(int i=0;i

Change the thumbnail bro. It's showing some other question

@mohammadfraz

3 жыл бұрын

thanks