Leetcode 113 Path Sum II | DP Coding Decoded SDE Sheet

Here is the solution to "Path Sum II
" leetcode question. Hope you have a great time going through it.

🔴 Connect with me here:
------------------------------------------------------------------------------------------------------------------------------------------------
------------------------------------------------------------------------------------------------------------------------------------------------
Master Data Structures and algorithms 🔽🔽🔽🔽

👉 Solution

🔥🔥🔥🔥👇👇👇 For discussion/feedback/humour/doubts/new openings

🔴 Checkout the series:

✨ Hashtags ✨
#CodingDecoded #ProductBased #SoftwareEngineering #FAANGM #FAANG #NSIT #NSUT #engineering #internship #college #Freshers #amazon #apple #coding

[sagarbora]

Nice growth guruji 12.5k
13k soon❤❤❤❤❤💫

[tanson]

and and target can be made global variables to make the rec function call less scary 😧
Instead of making so many array list isn't it better to keep adding and removing from 1 array list?

[MrUdit]

Hi Sanchit, I have doubt on passing the newly created arraylist while moving towards left and right.I think we should not create new arrayList while adding it to final result, as this already the new list so there should not be a problem with references.

[VasheshJ]

TC will be O(n^2). Check out this post from the discuss section for the explanation.