0
15
🔳 🔳 - Improving time complexity - Improving space complexity The lesser time your algorithm takes to give result for bigger values the lesser is the time complexity and the same thing applies to space complexity too. - Use efficient data structure according to problem statement - Make use of hash tables - Make use of memorization techniques - Use dynamic programming - Avoid recursion in general - Avoid repetitive calculation of results for sub-problems, rather store them once calculated - Use bitwise operations - Operate on bit level rather than byte level to save space wherever possible