1. Longest Palindromic Substring Problem Statement You are provided with a string STR of length N. The goal is to identify the longest palindromic substring within this string. In cases where multiple palindromic substrings have maximum lengths, return the substring which begins at the smaller index. Input: The first line consists of an integer 'T', indicating the number of test cases.Each test case contains one line, a string 'STR'. Output: For each test case, print the longest palindromic substring on a separate line.If there is more than one, choose the one with the smallest start index. Example: Input: T = 1STR = "ababc" Output: "aba" Explanation: The longest palindromic substring of "ababc" is "aba". Although "bab" is also a palindrome of the same length (3), "aba" starts earlier. Constraints: 1 <= T <= 10 0 <= N <= 10^3 Each 'STR' is composed of lowercase English letters. Time Limit: 1 second

2. Optimize Memory Usage Problem Statement Alex wants to maximize the use of 'K' memory spaces on his computer. He has 'N' different document downloads, each with unique memory usage, and 'M' computer games, each with unique memory usage. The computer can execute at most one download and one game at the same time, without exceeding the memory limit 'K'. Determine the pairs of downloads and games to maximize the memory usage. Example: Input: T = 1N = 3, M = 3, K = 10download = [4, 8, 5]game = [2, 1, 6] Output: [[1, 0], [2, -1]] Constraints: 1 <= T <= 10 1 <= N, M <= 10^5 1 <= K <= 10^9 1 <= game[i], download[i] <= 10^6 Time Limit: 1 sec Note: You only need to implement the function and return the result; printing is handled elsewhere.

3. Given a table, identify its normal form and normalize it.

4. How do you troubleshoot the boot process?

5. How do virtual pointers work?