Path Sum III | leetcode 437 | Hindi

subarray sum equals k :- • Subarray Sum Equals K ...
liked this video? Click here / @codebix1096
join our Facebook group :- / 258049468776636
problem :-leetcode.com/p...
code :- github.com/luc...

[@mayankguptacse5904]

Every KZbin video explained the O(n^2) approach but this one showed the O(n) approach as well in a superb intuitive way. Well done.

[@kirtimanmishra8097]

Awesome sir!! The backtracking part helped me.

[@codebix1096]

Great please share this channel with your friends

[@vibhanshusharma9143]

can some body help me why this is wrong public: int ans = 0; unordered_map freq; int curr_sum = 0; void solve(TreeNode* root, int target) { if (root == nullptr) return; curr_sum += root->val; if (freq.find(curr_sum - target) != freq.end()) { ans+=freq[curr_sum-target]; } freq[curr_sum]++; solve(root->left, target); solve(root->right, target); freq.erase(curr_sum); curr_sum -= root->val; return; } int pathSum(TreeNode* root, int targetSum) { freq[0]++; solve(root, targetSum); return ans; } for [1,-2,-3,1,3,-2,null,-1] target =2; output is 0 but ans is 1;

[@pushkardureja6863]

well explained ..... you gained a sub :)

[@utkarshsharma1185]

thanks for the amazing explanation sir

[@palakjain2505]

shouldn't we backtrack (i.e., remove sum from hashmap) before making the right subtree call?

[@AyushiSharmaDSA]

Thank you so much for explaining....Helped a lot :)

[@codebix1096]

You are welcome please share this channel with your friends

[@Saurabh-gg9lv]

👀🤭

[@vishalverma2986]

i was reading comment and found u,i also follow your channel.but when i search a particular question i always prefer codebix first and then you.both r great teacher.helps me alot.

[@urs_Gaurav_drdz]

Optimise approach submit nhi ho rhi Wrong answer aa rh hai😢

[@himanshuchugh1186]

All the very best for your youtube channel brother!! keep growing...

[@codebix1096]

Thank you so much 🙂

[@rajgupta5158]

Awesome explanation sir, please make more such video.

[@rahul_singh_rajput3292]

sir your explanations are always OP 🔥..

[@shantanukumar4081]

thanks bhaiya amazing solution

[@SURAJOMAR-q8b]

lekin bhai wrong anser aa rha tha n^2 mein

[@chrisy.703]

hard to understand ur english... accent is too heavy...

[@rhythmbhandari1700]

Truu

[@yashsahay1096]

Most underrated coding channel I have ever encountered. Really intuitive approach!

[@ankitmilmile6513]

your brute force solution failing this test case [1000000000,1000000000,null,294967296,null,1000000000,null,1000000000,null,1000000000] can you please debug why?

[@rashvikumari3782]

even O(n) solution is failing for same test case. I changed data type of sum from int to long as sum goes over the max range of int

[@financewithsom485]

you channel will grow exponentially.doing great job

[@codebix1096]

hope so SOMMAN EDU share vare kro tum channel tbhi to grow karega

[@pubglittlepro9585]

ye solution completly sahi nahi hai ... leetcode pr 127/128 passed hai but ek test case failed hai jisse submit nahi ho pa rha hai. just trying to solve..🙃

[@sanchit9450]

use long instead of Integer

[@kueen3032]

Hey, what software do you use for explaining?

[@codebix1096]

Openboard

[@harshitsaxena3064]

Just a simple change in code which will pass all the test cases on leetcode: class Solution { Map visited=new HashMap(); int count=0; public int pathSum(TreeNode root, int targetSum) { visited.put(0L,1); helper(root,targetSum,0); return count; } public void helper(TreeNode root,long targetSum,long currentSum){ if(root==null) return; currentSum+=root.val; if(visited.containsKey(currentSum-targetSum)){ count=count+(int)visited.get(currentSum-targetSum); } visited.put(currentSum,visited.getOrDefault(currentSum,0)+1); helper(root.left,targetSum,currentSum); helper(root.right,targetSum,currentSum); visited.put(currentSum,visited.get(currentSum)-1); } }

[@ovipoddar2723]

Your r great sir..Your way of explanation is outstanding..

[@abhinaygupta]

The second solution is great.

[@codebix1096]

please share this channel with your friends

[@KamleshSharma-si2rq]

wo nei karoge to ispe palla nei karega choro meh kehna chor deta hu.. This is my python solution and Thanks for the awesome explaination. ```python def pathSum(self, root: TreeNode, sum: int) -> int: self.total=0 if(root is None): return 0 d={0:1} self.findpathSum(root,0,sum,d) return self.total def findpathSum(self,root,s,target,d): if root is None: return s+=root.val if(s-target in d): self.total+=d[s-target] if(s in d): d[s]+=1 else: d[s]=1 self.findpathSum(root.left,s,target,d) self.findpathSum(root.right,s,target,d) d[s]=-1 ```

[@Day-je4um]

/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} * TreeNode(int val) { this.val = val; } * TreeNode(int val, TreeNode left, TreeNode right) { * this.val = val; * this.left = left; * this.right = right; * } * } */ class Solution { int flag =0; ArrayList list = new ArrayList(); public int pathSum(TreeNode root, int sum) { getSum(root,sum); return flag; } public void getSum(TreeNode root , int sum){ if(root == null){ return; } list.add(root.val); getSum(root.left,sum); getSum(root.right,sum); int temp=0; for(int i=list.size()-1;i>=0;i--){ temp+=list.get(i); if(temp==sum) flag++; list.remove(list.size()-1); } } }

[@baaznotapro5479]

Should i use dp or graph for traveling salesman problem

[@saunaknandi1814]

what should be the time complexity??

[@hemantkumar2585]

the way of teaching is awesome 👌👌👌👌👌👌

[@decodingParinda]

clean and crisp explanation :) Thank for it

[@codebix1096]

You're welcome!

[@shubhamkumargupta3478]

I was confused on a different question related to this, if I have a binary tree and I have 2 nodes given and I have to find the path sum of these two nodes , no maximum or target sum is there just I have to get path sum of two nodes, how to do that?

[@abhishektanwar7902]

What if we have to print those path whose sum is equals 8.Can you provide the code for that. Btw nice explanation.

[@prasannamalatesha3887]

Great video, nicely explained

[@raghavjha8040]

why we have to do backtrack ?

[@kzy747]

boi you saved my career

[@vaarigupta6332]

Nice and clear explanation

[@farazjawaid2982]

what an explanation sir

[@akashkumardas6521]

sir simple sa code nah h, isko samajh toh google me apply karoonga sidha..

[@aryans_space]

excellent solution sir

[@sarthakyadav9148]

great explanation.

[@codebix1096]

Glad you liked it Follow our linkedin page for regular updates www.linkedin.com/company/codebix/?viewAsMember=true

[@leetcodebegineer6704]

saii solution

[@letsconclude8023]

O(n) wala approach badhiya tha guru.

[@trevorPhillips284]

Thanks for the hint.

[@kushal800]

Great video

[@rishiwork5922]

awesome explanation

[@kartiksoni]

you are a legend bro !!!

[@suvamgupta2914]

Just Awesome ❤️

[@vadirajjahagirdar9342]

Very good video!

[@21pranavsingh]

bhtubhut shukriya ;>

[@singerpranavmodi]

bhai yar gazab ho !!! Brilliant explanation.. EK request.. Please make video on longest increasing subsequence. Both O(n^2) and O(nlogn) approach.

[@codebix1096]

Thanks will try when i continue DP playlist

[@abhishekk1231]

Helpful!

[@akshaygill4692]

Thanku ❤

[@aamirjamal6833]

Wow! First video and Subscribed!

[@codebix1096]

Welcome aboard! Thank you. Follow our linkedin page for regular updates www.linkedin.com/company/codebix/?viewAsMember=true

[@umangsomtiya5826]

i stop in the mid of video and come here first to say !!!great explaination

[@codebix1096]

Thanks :)

[@bitrish34]

💥💥🔥

[@ragingpahadi]

Great explanation brother !

[@codebix1096]

Thanks 🙂

[@harshalgarg1149]

Great Explanation.

[@codebix1096]

Thanks :)