#dsa
Read more stories on Hashnode
Articles with this tag
B.T Postorder Traversal using Recursion (TC:O(n) & SC:O(n)(call stack)) & Stack with Iteration (TC:O(n) & SC:O(2n)(2 stack)& SC: O(n)(1 stack)) ·...
B.T inorder traversal using Recursion (TC:O(n) & SC:O(n)(call stack)) & Stack with Iteration (TC:O(n) & SC:O(n)) ·...
B.T Preorder Traversal using Recursion (TC:O(n) & SC:O(n)(call stack)) & Stack with Iteration (TC:O(n) & SC:O(n)) · Question Link:...
Frog jump using Rec DP(Top-Down Approach)(TC : O(n) & SC : O(n + n (call stack))& Itr DP( Bottom-up Approach)(TC : O(n) & SC : O(n)(O(1) in Sp.Optim)) ·...
Special Keyboard using Recursive DP(TC:O(n) & SC:O(n)) & using Iterative DP(TC:O(n) & SC:O(n)) · Question Link:...
Palindromic Partition using Recursion + TDDP (O(n^3) TC & O(n^2) SC) , Recursion+TDDP (O(n^3)TC & O(n^2) SC),using Iteration+BUDP (O(n^3)TC & O(n)SC) ·...
