Path Sum III LEETCODE PROBLEM

#1

Plz tell me where I am wrong
question link


my solution code

#2

hello @coderajay03 please give me time as i have to go through the question and then i will try to implement myself and then let you know .
till then you can try another question .

#3

hey @coderajay03 could you please explain your approach ?
i think you have unncessariy complicated the question .

#4

I am just returning the path sum of the node and recursively using that path sum on all nodes and check whether that node equals sum, or the pathsum+node->data equals sum from left or right !!!

#5

hey @coderajay03 try if you can understand this:
https://ide.codingblocks.com/s/380533 .
your code is not even passing half of the test cases .
this means that your code is going wrong in many test cases.
but i have understood your logic i have tried to reframe your logic .
try to go think with that .
if you dont understand anything you can ask here

#6

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.