Bhiya Course main main new aaya hoon mujhe pata nhi chal rha main coder's army start kahan se kroon koi syllabus ya topic based hai kya jhan se main iss sare lecture ko start krron
Sabhi bhaiya didi log first tier college k courses sell kar rhe h lekin apka free Wale course k samne bilkul wo log zero h apka dedication sach me kamaal k h
Sir mene abhi tak dsa ke 33 day per hu apne course ki aur me is video per bass ye batane aya hu ki app abhi tak ke teachers me se sabse acha padate ho me bhi abb course me consistent hu aur mere jo friend he unhe bhi apke bare me batata hu thank you sir for teaching and please don't stop apko abhi mera placement lagvana he ❤❤❤❤
Bhaiya learning++ last problem ka solution using merge sort is really very awesome please keep bringing such a high level content akhri problem mai mza aa gya thankyou ❤❤❤❤❤
Bhaiya ek web dev ka detailed roadmap bana dijiye pls. Konse topics se start karein aur kon kon topics ko depth mein karein. Specifically for MERN stack. For e.g., JavaScript karein toh usme kon kon se topics cover karein
Bhiya Course main main new aaya hoon mujhe pata nhi chal rha main coder's army start kahan se kroon koi syllabus ya topic based hai kya jhan se main iss sare lecture ko start krron please hlep kahan se strat kro iss lectures ko
bhaiya i have a doubt regarding the recursion series. DAY->75 Q 4:Count number of hops. class Solution { public: //Function to count the number of ways in which frog can reach the top. long long countWays(int n) { if(n>=1 && n
Bhaiya why my solution is giving TLE I am using pair Node * mergeKLists(Node *arr[], int k) { Node *head=new Node(-1); Node *temp=head; // construct priority_queue vector v; for(int i=0;idata,arr[i]}); } priority_queue pq(v.begin(),v.end()); while(!pq.empty()){ pair x=pq.top(); pq.pop(); temp->next=x.second; temp=temp->next; if(x.second->next!=NULL){ pq.push({x.second->next->data,x.second->next}); } } temp=head; head=head->next; delete temp; return head; } plzz tell me what is the problem
First Problem Yaad Kis kisko hai?
☺☺
dada 1st problem ko paihle pair use karke kia thaa kal jaise sikhaye the apne
Bhiya Course main main new aaya hoon mujhe pata nhi chal rha main coder's army start kahan se kroon koi syllabus ya topic based hai kya jhan se main iss sare lecture ko start krron
Bro please upload english subtitles to all video it should be helpful to all language people you content is good it's my request
Bhiya python playlist kab laaoo ge
Sabhi bhaiya didi log first tier college k courses sell kar rhe h lekin apka free Wale course k samne bilkul wo log zero h apka dedication sach me kamaal k h
So underrated channel.. respect from Bangladesh..best series!!!!!
sb bangladeshi ko to block krna chahiye , free content dekhne se
Bhaiya don't worry your dsa series will be the one of the G.O.A.T in upcoming times
Does he have course i understood his teaching as well
Should i go for love babar or rohit negi free videos ?
@@TheOddsOneOutxD rohit negi bro. love babbar is not teaching in depth, your choice
@@harshrana3012 you took love babar course ? I want course like full which makes me preppare
@@harshrana3012 you saw love babar videos ?
I am freshet 1st year so
@@TheOddsOneOutxD i am in second year and started dsa, and love babbar videos are not best
Sir mene abhi tak dsa ke 33 day per hu apne course ki aur me is video per bass ye batane aya hu ki app abhi tak ke teachers me se sabse acha padate ho me bhi abb course me consistent hu aur mere jo friend he unhe bhi apke bare me batata hu thank you sir for teaching and please don't stop apko abhi mera placement lagvana he ❤❤❤❤
No one beat this teacher in the all yt Teacher
bhai tu problem solve kar leta hai leetcode pe apne aap se
@@thorff7423 yes bhai
Bhaiya learning++ last problem ka solution using merge sort is really very awesome please keep bringing such a high level content akhri problem mai mza aa gya thankyou ❤❤❤❤❤
Thank you so much for such a great Lecture.
Bhaiya Please Continue the Series..., waiting for the next Lecture...
Jai shree Ram ❤️
Ek dum op level samjhaya aapke jaisa teacher nahi dekha abhi tak 🥂
BHAIYA, THANK YOU FOR YOUR DSA PLAYLIST, PLEASE TEACH GRAPH DATA STRUCTURES ALSO, WE NEED IT
Brother you are messi of coding industry pls upload new videos you are goat bhai
Just Complited this lecture aur maza aa gaya problem ko karne me...🙃mai to abhi bhi soch raha ki merge sort aise bhi lagaya ja saktahai kya >>>>😅😅
Completed everything till now....!
Good morning bhaiya ❤
Pls start graph series after this
Hey… please help me. I am good in java… can I follow this playlist for java?
bhaiya Video kyu nhi aa rahi hai???
Bhaiya …. Aap phir kabse wapas videoes upload karna shuru karenge ?
Sir please cover topics like backtracking problems, greedy algorithm, dynamic programming, bit manipulation also in your series🙏
Aj bhot tough lecture tha bhaiaya
Bhaiya Radhe Radhe 🙏
Love you bhaiya ❤
Awesome content
1: Merge K Sorted Linked List
using pair
Node * mergeKLists(Node *arr[], int K)
{
// Your code here
//using min heap
//using pair
vectortemp;
for(int i=0;idata,arr[i]));
}
priority_queuep(temp.begin(),temp.end());
pairelement;
Node*head=new Node(0);
Node*root=head;
while(!p.empty())
{
element=p.top();
root->next=element.second;
root=root->next;
p.pop();
if(root->next!=NULL)
{
p.push(make_pair(root->next->data,root->next));
}
}
return head->next;
}
};
Bhaiyya abhi toh bahot bacha hai graphs , dynamic programming, trie Kahan chale gaye aap?
Sab theek toh hai?
You are the best bhaiya 🤩
You can use pair with heaps for merge k sorted lists
hello bhai
bhai series continue kardo🙏🏼🙏🏼🙏🏼🙏🏼🙏🏼🙏🏼🙏🏼🙏🏼🙏🏼🙏🏼
GOOD MORNING BHAIYA ♥♥♥♥♥♥♥♥♥♥♥♥♥
Bhaiya ek web dev ka detailed roadmap bana dijiye pls. Konse topics se start karein aur kon kon topics ko depth mein karein. Specifically for MERN stack.
For e.g., JavaScript karein toh usme kon kon se topics cover karein
Good morning bhaiya 😊
bhaiya next video kab ayega
bhaiya new video kab aayega , now its a lot of time
Thanks for this series
merge sort wale approach me maja aa gaya
Good morning Bhaiya ji😍
Bhaiya just wait for 3 months .Our placements will do the talk. Placement season in DTU is going to start
where are you bhiya please complete the course
01:19:19 Salute🫡🫡 to you hardwork, Paseena tapak gya, lekin Video nahi rukni chahiye🫡🫡🫡🫡
waiting for the next lecture : )
I'm thinking about completing DSA from this playlist, my question is..does this course have all the topics of DSA
Jabardast concept
Sir kindly make video on Hashing
Jabardast video bhaiya
Bhiya Course main main new aaya hoon mujhe pata nhi chal rha main coder's army start kahan se kroon koi syllabus ya topic based hai kya jhan se main iss sare lecture ko start krron please hlep kahan se strat kro iss lectures ko
Waiting C++ DSA course next video 😢 kab aayege ? Sir
Series kab end hoga Bhaiya please relpy
Thankyou bhaiya ❤
Bro next video kab aeya
superb Bhaiya
Gud morning bhaiya🎉🎉
Ram Ram bahi❤
vectorans;
vectorres;
for(int i=0;i
Bhaiya aapka NEXUS course or ye DSA course best h
Good morning ❤
Ram Ram bhaiya
Good morning boss ❤
Bhaiya jo padha rehe hai uska notes milega kya
bhaiya i have a doubt regarding the recursion series.
DAY->75
Q 4:Count number of hops.
class Solution
{
public:
//Function to count the number of ways in which frog can reach the top.
long long countWays(int n)
{
if(n>=1 && n
good morning bhaiya
please come again....
done all backlogs
Sir kya yhi tak tha ye course ?
🔥🔥🔥
bhaiya sab thik he na, kaha gayab ho????
Bhaiyya wapis aa jao yaar
Next part bhai
Sir m course start ker reha hu DSA ka to please aap apni playlist ko proper arrange ker degye kyuki m beginner ho
Bhai DSA playlist in c++ wali check karo, usmein included hai sab ek sequence mein❤️
fabulous
Bhaiya plz upload the backtracking videos
Done
Day 191 ✅🔥
Jai Shree Ram!!!!!!!!!!!!!!!!!!!!!!! Bhaiya....
❤❤
Your fees
high level++
Day - 191 #180DaysOfCode
❤
Isse acha to, Leetcode ke solution videos daal dete
Content🗿
chamka++
Bhaiya why my solution is giving TLE I am using pair
Node * mergeKLists(Node *arr[], int k)
{
Node *head=new Node(-1);
Node *temp=head;
// construct priority_queue
vector v;
for(int i=0;idata,arr[i]});
}
priority_queue pq(v.begin(),v.end());
while(!pq.empty()){
pair x=pq.top();
pq.pop();
temp->next=x.second;
temp=temp->next;
if(x.second->next!=NULL){
pq.push({x.second->next->data,x.second->next});
}
}
temp=head;
head=head->next;
delete temp;
return head;
}
plzz tell me what is the problem
Bhai meine abhi code run kiya apne system mein, It passed all the test cases.
Good morning bhaiya ji💖
❤❤❤