Software Engineer

You are given an integer array of size N. Your task is to rotate the array by one position in the clockwise direction.

For example :

If N = 5 and arr[ ] = {1, 2, 3, 4, 5} then output will be 5 1 2 3 4.

If N = 8 and arr[ ] = {9, 8, 7, 6, 4, 2, 1, 3} then output will be 3 9 8 7 6 4 2 1.

You are given an array A of length N, where N is always an odd integer. There are (N-1)/2 elements in the array that occur twice and one element which occurs once.

Your task is to find the only element that occurs once in the array.

Note: There are (N-1)/2+1 elements that are unique in the array.

Example:

Consider the array be 1,6,4,6,2,4,2
The integers 2, 4, 6 occur twice and only the integer 1 occurs once. 

You are given a binary tree. Your task is to check whether the given binary tree is a Complete Binary tree or not.

A Complete Binary tree is a binary tree whose every level, except possibly the last, is completely filled, and all nodes in the last level are placed at the left end.

Example of a complete binary tree :

You have been given a singly linked list of integers. Write a function that returns the index/position of integer data denoted by 'N' (if it exists). Return -1 otherwise.

Note :

Assume that the Indexing for the singly linked list always starts from 0.

• Tell me about Keys
• What are the acid properties?
• What do you understand by normalization in DBMS?

• Introduce yourself
• What are your strength?
• What are your tech expertise?
• What are your strength and weakness?
• Why do you want to join RTDS?
• Explain the working of your project