1. Convert Binary Tree to Mirror Tree Convert a given binary tree into its mirror tree, where the left and right children of all non-leaf nodes are interchanged. Input: An integer ‘T’ denoting the number of test cases. For each test case, the elements of the tree in level order form, separated by a single space. Use -1 in place of a null left or right child. Output: For each test case, the inorder traversal of the mirror tree, printed on a separate line. Example: Input: 11 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1 Output: 7 4 2 1 6 3 5 Constraints: 1 <= T <= 100 1 <= N <= 3000 -10^9 <= DATA <= 10^9 Note: Modify the binary tree in place to get the mirror, without creating a new tree.
2. Explain Dynamic Programming (DP) with brute force and memoization approaches.
3. What is the difference between sympathy and empathy?
4. Given three tables and their attributes, how would you find the names of employees whose balance is less than 200?
5. Write a Java program to count the frequency of characters/words in a given string and sort them based on the number of occurrences in descending order. Return the maximum number of characters and words along with the number of occurrences. For example, given the string "Sharing interview experience certainly helps others.", implement the solution.