Video

its giving TLE in c++ code

Worst Explanation...just given the result without any intuition

👍

So many days solve problem. Thanks🎉❤

maine aapke kuch videos dekhe hai, app try accha karte ho but aapke explaination me bahut sare issues hote hai jisse viewer ko acha experience nahi milta,... 1 prob-like ek to aapke voice me clarity nahi hai, kabhi bhi kuch bhi bol dete ho,..for e.g,aapne bola, i+1=10, but actually i+1was =0 and arr[0]=10 and pehle bolte ho arr[i+1] ko swap karenge arr[j] ke sath, phir actual me arr[i] ko swap kar rahe the arr[j] ke sath, etc etc 2 prob- directly batana start kar dete ho ki hum ye kar rahe hai vo kar rahe hai,...isko solve karne ke liye kya kya karna padega aur kyu karna padega, phir kaise karenge ek order me nahi batate ho aap, ek intution nahi dete,... 3 Prob- pehle se hi concept aur code screen par likha hua hota hai jo bahut hi kharab experience deta hai aur samajhne me bhi bahut time lagta hai, aapko bolne ke saath saath likhna chahiye concept aur code dono aur upar se handwriting itni kharab... Ye chhoti chhoti cheej hi matter karti hai for no. of likes, dislikes, subscribers, types of comments etc, mereko quick sort pehle se aata tha bahut acche se, uske baad bhi mereko feel hua ki aap kitna bekar explain kar rahe ho, to jisko nahi aata hoga usko kaise samajh aayega,... For other people, if someone came to watch this video, then go to some other teacher first to understand quick sort algorithm like there are many such as jenny..

Bhaiya I am in btech 1st year , 2nd semester, should I have to focus on dsa or on college to maintain good cgpa , as college make pressure for academics.

👍

Hi akshay, I can't send you connection request for 3 weeks. can you please send from your side. {URL}/jatin-sood-a0878b185/

Bhaiya I am in btech 1st year , 2nd semester, should I have to focus on dsa or on college to maintain good cgpa , as college make pressure for academics.

NICE SUPER EXCELLENT MOTIVATED

👍

Good explanation 👏 👍

class Solution { private static int solve(Node root){ if(root==null)return 0; return root.data+solve(root.left)+solve(root.right); } public static int maxDifferenceBST(Node root,int target) { int sum=0; while(root!=null && root.data!=target){ sum+=root.data; if(root.data>target){ root=root.left; }else{ root=root.right; } } if(root==null)return -1; int left=solve(root.left); int right=solve(root.right); return Math.max(sum-left,sum-right); } } Can anyone tell me what is wrong in this code.

It will be so helpful to all the south students if you teach in English sir once I learned a lot when you taught in English. Hope to see Akshay bro teach in English

instead of adding a new if condition of low++ , can't we just add the <= in the condition for the first half instead of < ??

👍

thanx bro...

👍

O(1) Space complexity Node prev = null; public void populateNext(Node root) { // code here if(root == null) return ; populateNext(root.left); if(prev != null) { prev.next = root; } prev = root; populateNext(root.right); }

Good explanation 👏 👍

sir aap ek playlist bana sakhte ho dp ke liye basic to advanced jaise hamko prequiste kuch nhi ata woh playlist dek ke ham dp mei ache ho jaye

👍

sir i really like your videos that help me in making my logic building more strong thanks a lot sirrr

thanks

Could have explained better

public Node removeDuplicate(Node head){ Node dummy=new Node(-1),cur=dummy; while(head!=null){ int x=0; while(head!=null&&head.next!=null&&head.data==head.next.data){ x=head.next.data; head=head.next.next; } if(head!=null&&x!=head.data){ cur.next=new Node(head.data); cur=cur.next; } if(head!=null) head=head.next; } return dummy.next; } 🎉❤

after so many days make video thanks🎉❤

sir ive used exactly same approach but instead of cnt I've used map.size() and mp.erase instead of cnt-- but only 450 test cases are passing

Thank you for your explanation ❤❤❤

🙌🙌

Good explanation 👏 👍

sir one question kya hum else part me ye nhi likh skte else{ len = lps[ 0 ]; lps[ i ] = 0 ; i++; } please reply tommorow i have my exam at the end hum backtrack krke 0 th index pe phich rhe to phle hi kyu ni krre

don't write comments generally , but your videos made me do so, your videos are always helpful , very much appreciated !

Guru ji apke charan kahan hai

Good explanation. It would be nice if you increase thickness of your marker😅

i read the pdf, but there also it's mentioned to assume l=w, it is not arbitrary etc but kahi explain nahi kiya ki l=w le rahe hai , besides simplying the equations..

but why doesn't the code given in the gfg article for that test case... i am unable to understand...

why so fake ascent sir?

are these questions asked in coding rounds ? I doubt it...

they have marked it easy now and accuracy is increased too

Bro volume is too low. Please re-upload..

🙌

kuch explain bhi kar dete bhai sab ke liye, apni revision kar ke nikal liye

👍

👍

great explaination!

👍