1. Given a string, find all palindromes within it.

2. Implement a debounce function.

3. Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element is distinct.

4. Find the Third Greatest Element Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array. Input: The first line contains a single integer 'T' representing the number of test cases. Each test case consists of: A single integer 'N', the number of elements in the array, on a new line. Followed by 'N' space-separated distinct integers that comprise the array 'ARR'. Output: For each test case, output the third largest element from the array 'ARR'. Example: Input:T = 2N = 5ARR = [7, 4, 9, 1, 3]N = 4ARR = [10, 20, 30, 40] Output:420 Constraints: 1 <= T <= 50 3 <= N <= 104 -105 <= ARR[i] <= 105 Note: You don’t need to print anything; it has been handled. Implement the provided function to solve the problem.

5. What is threading, and what are the different scheduling algorithms?