1. Character Frequency Problem Statement You are given a string 'S' of length 'N'. Your task is to find the frequency of each character from 'a' to 'z' in the string. Example: Input: S : abcdg Output: 1 1 1 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Input Format: The first line of the input contains an integer 'T' denoting the number of test cases. The next 'T' lines, each contain one string 'S'. Output Format: For each test case, output a single line containing 26 space-separated integers, where the 'i'th integer represents the frequency of the 'i'th character. Constraints: 1 ≤ T ≤ 102 1 ≤ Length of the given string ≤ 104 All characters in the string are lowercase English alphabets. Time Limit: 1 sec Note: You don’t have to print anything; the printing is already managed. Just implement the required function.

2. Determine the Left View of a Binary Tree You are given a binary tree of integers. Your task is to determine the left view of the binary tree. The left view consists of nodes that are visible when the tree is viewed from the left side. Example: Input: T = 1Binary Tree Level Order Input: 1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1 Output: 1 2 4 7 Explanation: The left view of the binary tree is 1, 2, 4, 7 as shown in the image below: Constraints: 1 <= T <= 100 0 <= N <= 3000 1 <= data <= 105 and data ≠ -1 Note: You do not need to handle any input/output operations; just implement the function to return the required result.

3. What is the most efficient way to reverse a string of characters?

4. Difference between rest and soap api Calling method @Test Difference between before and before method What are annotations What is testng what does it do

5. What factors are considered during code review?