#cpp
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:...
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) ·...
Next Permutation using in-built function called next_permutation(O(n!*n)TC & O(1)SC) and using Intuition and efficient method (O(n)TC & O(1)SC) ·...
