Video

Bht sahi smjha diya bhaiya aapne ... Thank you :)

Thank you so much.

following

Ghnte ki knowledge tere me

Bullshit explanation

class Solution: def reverseWords(self,S): m=S.split(".") ans="" m.reverse() for ch in m: ans=ans+"."+ch return ans[1::] python Be Like

are Bhai Ram Ram

bro we want you back ,please upload youtube videos

legend

Thank you. Clear thought process.💚

can I join it now

Bhaiya Flipkart grid comp se job or summer internship offer mil rhi h can u make one video on that too

gazab samjhaye sir, dhanyawad

😮😮😢🎉😂

such a simple and point to point explanation

Muh Se Supari Nikal Ke Baat Kar Re Baba😁

Aap konsa device use kar rahe hai? It's helpful during interview. Digital pad jaisa hai kya?

If all internal vectors would had been sorted then the tc would have been ->O(nlogm), btw loving the series ! I was having a good run in all topics like recursion, backtracking, heap, queue, stack, binary search and trees! Greedy was was something i was not sure about,Then i found you guys, this series has really been a boon and Now In day or two i will start dp and after I achieve a threshold in dp. I will be taking benefit from your dp series! Wishing you guys health and prosperity...keep it up guys🤘🤘🤘

Why is the title and description in english if the video is not??? Downvoted

bro optimize it

thanks for the upload!

bhai upr se gya

Ran Ram. Dhanyawad

Noice....................................................................................................................................

bhai pannniii thuukk muuu se

Bhai which video should I refer to for 3*3 matrix logic @16:30?

why we are subtracting nums.begin()

Ram Ram 🙏🙏 Awesome bhailog🙌

great video and most important i like the idea!

ae bhai optmize soln ke liye aaya tha, saala bruteforce bata raha hai ye le optimized soln public int unequalTriplets(int[] A) { int trips = 0, pairs = 0, count[] = new int[1001]; for (int i = 0; i < A.length; ++i) { trips += pairs - count[A[i]] * (i - count[A[i]]); pairs += i - count[A[i]]; count[A[i]] += 1; } return trips; } ye sikh le

Speak properly ,jo uppar wala video hai usme jo admi bol raha uski awaaz thekk hai , neeche wala pata nahi kya bol raha jaldi jaldi

i pledge sir that i will be an 3 star coder in upcoming 75 days

I Pritam Roy pledge that from today (10/6/24) I will solve questions everyday consistently and become a better coder. I will come back here after 6 months and I will share my progress. I was a newbie till now , but I won't be that stupid lazy boy anymore. I promise.

Do you understand yourself?

Sir meri samjh me kuch nahi aa raha hai

Grate explanation, and patience

irritating voice

Improve explanation brother

bhai time complexity bhi please discuss kia kroo kaafi mushkil hojata hai samajhna code

RAM RAM Bhaiya...........🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻

Thank You So Much for this wonderful video..........🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻

Time complexity and space complexity

You make it simple ❤❤tq even i did not know hindi understand the logic now

maja aayga solution dkhke

some test case wrong by this code not working well

Great explanation .

bhai thoda slow bol lo yaar

for O(log m*n) complexity: bool searchMatrix(vector<vector<int>>& matrix, int target) { int col=matrix[0].size(); int row=matrix.size(); int start=0; int end=row*col-1; int mid=start+(end-start)/2; while(start<=end){ int element=matrix[mid/col][mid%col]; if(element==target){ return 1; } if(element<target){ start=mid+1; } else{ end=mid-1; } mid=start+(end-start)/2; } return 0; }

Why did you do A-- in the code, I couldn't understand that?