GenC (Trainee Programmer Analyst)

Basic to medium-level questions on profit and loss, mensuration, blood relations, and crossword puzzles.

Find antonyms and synonyms, along with reading passages and comprehension questions.

English audio clips of 10 to 15 seconds were played once, and we had to record ourselves repeating the narration exactly as it was said.

You are given a sorted array 'arr' of positive integers of size 'n'.

It contains each number exactly twice except for one number, which occurs exactly once.

Find the number that occurs exactly once.

Example :

Input: ‘arr’ = {1, 1, 2, 3, 3, 4, 4}.

Output: 2

Explanation: 1, 3, and 4 occur exactly twice. 2 occurs exactly once. Hence the answer is 2.

For a given Binary Tree of type integer, your task is to determine if the height of the root's left subtree is exactly equal to the height of the root's right subtree.

The height of a binary tree is the number of nodes on the longest path from its root node down to the farthest leaf node.

An empty tree (a null node) has a height of 0.

A tree with a single node has a height of 1.

You must implement a function that calculates the height of the left subtree and the right subtree and returns true if they are equal, and false otherwise.

In an Employees table, there is a column named First Name and another column named Last Name. Fetch the full name of all employees by combining the First Name and Last Name.

Given a Students table and a Books table in the library database, fetch the number of books issued to all the students.

Given a string 'S' of length 'N' and a character 'C', the task is to count the occurrence of the given character in the string.

Return the total number of times the character 'C' appears in the string 'S'.

For Example :

Let 'N' = 5, 'S' = "bbacb", 'C' = 'b'.
The character 'b' appears 3 times in the string "bbacb".
Therefore, the answer is 3.

Implement an SQL INNER JOIN.

What was the most difficult problem you faced during your internship, and how did you overcome it?