Видео

solution just like fibonacci Best DP series

Now i am able to solve recursion problem by my own. Thank you so much sir

last part was best

best course kindly bring all topics. please

def checkIfPangram(self, sentence: str) -> bool: alpha = [0]*26 for c in sentence: alpha[ord(c) - ord('a')]+=1 if 0 in alpha: return False return True just python it😁

13:34 😂😂😂

Clear hai ?? Haan ji bhaiya clear hai 😂😂wahh😂😂

day of dsa 25 lecture complete..... thank you bhaiya

shaktiman

Last code will give O(n^2) time complexity

I am java developer ..but love your content sir ji❤

pls continue

Rhohit Sir kmal ker dia.Thank you soo much.

maza aa gaya bhaiya

❤

slow and fast chamak chuka hai asman mein

❤

Bhot acche se chamak gya bhaiya ❤️✨ thank you so much linked list or pakka hota ja rha h ❤❤

is video me audio lag sach me hai ya mujhe hi lag raha hai ??

Which theme u r using?

Very Helpful Video ✨

thank u bhaiya yrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrr ❤‍🔥❤‍🔥❤‍🔥❤‍🔥❤‍🔥❤‍🔥❤‍🔥❤‍🔥❤‍🔥❤‍🔥❤‍🔥❤‍🔥❤‍🔥❤‍🔥❤‍🔥❤‍🔥❤‍🔥❤‍🔥❤‍🔥❤‍🔥❤‍🔥

How much time is needed to complete dsa in order to start cp? Pls help. This playlist is never getting finished😢

chamak chuka hai

DP is OP

Sir I love you sir I am follows you DSA playlist and I don't I became emotional and I cry little bit because you struggle and efforts able me to solve problem of DSA I salutes you of your efforts I don't know how can I perform you thinks ❤❤❤ love from Afghanistan

Meri back legi hai

All clear

bhaiya khud se ho gaya this problem is similar to generate parenthesis thank you so much bhaiya

Great ho

Kab apka live class chalta hai sir

Lecture 14 complete on 9/11/2024..❤❤❤❤

pen ulta pkda h sir aapne

came here just to comment, because I have already downloaded the whole playlist..... completed all the previous lectures, learned so many things from you, bhaiya. You are the best teacher I have ever had, everything seems so clear with you,,,,,,,,,,,,🙏🙏🙏 ###(tried to implement on my own bfs and it worked❤‍🔥) queue<int>q; // needed for level wise traversal vector<bool>visited(adj.size(),0); // checks if one vertex is visited or not vector<int>ans; // stores vertices in bfs q.push(0); int temp; while(!q.empty()){ // while the queue have atleast one vertex // take the front vertex temp = q.front(); q.pop(); // if it is not visited yet then push it in the ans and make it visited if(visited[temp]==0){ ans.push_back(temp); visited[temp]=1; } //put all the vertices connected with temp into queue for(int i=0 ; i<adj[temp].size() ; i++){ // which are not visited yet if(visited[adj[temp][i]] == 0){ q.push(adj[temp][i]); } } } return ans;

amaaaaazing

nice

amazing explaination sir

Sir thoda animation bhi late toh aur acha rahta kaam kaise kar rhi hai cheejien

First time maine 1:43:01 ek bar me complete Kiya or clearly Har ek approach smjh me Aaya thank u so much Bhaiya you r the great lots of love ❤❤

cout<<"Brilliant teacher" 💥💥

raapchik content ,guyz pls do share with your frnds, bcz likes != 💎💎📄📄,so please like and subscribe after watching the vdos of neggi bhaiya❤❤

kinggkinggkingg😭❤️

❤

kya samjhate ho rohit da mja aa jata hai ekdam chammak gya......

class Solution: def findKthPositive(self, arr: List[int], k: int) -> int: start = 0 end = len(arr) - 1 while end >= start: mid = start + (end - start) // 2 if arr[mid] - 1 - mid < k: start = mid + 1 else: end = mid - 1 return start + k

Bhaiya aap Theme konsa use krte ho?

chamak gaya elder brother😊😊 08-Nov-24

chamak gaya elder brother😊😊 09-Nov-24

kilear hai

second approach is awesome 😇