Develop 5 recursive string manipulation algorithms with time and space complexity analysis: 1) A function to reverse a string using only recursion and no additional data structures 2) A balanced parentheses checker for nested expressions with multiple types of brackets 3) A function to generate all possible palindromic partitions of a string 4) A Levenshtein distance calculator using recursion with memoization 5) A function to find the longest repeated substring pattern. Include implementation in Python, detailed explanations of base cases, recursive steps, and optimization techniques.