#Day 47/100 #100DaysOfCode Problem Solved :(LeetCode 71) Simplify Path Time Complexity: O(n) Space Complexity: O(n) #Java #LeetCode #CodingDaily #DSA #CodeWithLogic #100DaysOfCode #javadeveloper

#Day 43/100 #100DaysOfCode Problem Solved :Path Sum (LeetCode 112) Approach : Recursive logic: If node is null → return false. If leaf node → check if target == node value. Else → call recursively on left or right with (target - node value). Time Complexity: O(N) Space Complexity: O(H) - H refer to height #Java #LeetCode #CodingDaily #DSA #BinaryTree #Recursion #CodeWithLogic #100DaysOfCode #javadeveloper

21/160 problems solved on @geeksforgeeks 🎉! Today’s mission: sorting arrays with 0s, 1s, and 2s. 🧮 A quick and efficient way to bring order to chaos! 🚀 #CodeWithLogic #GeeksForGeeks #geekstreak2024 #gfg160