Fullstack Developer

You are given an array of integers 'ARR' containing N elements. Each integer is in the range [1, N-1], with exactly one element repeated in the array.

Your task is to find the duplicate element. The duplicate element may be repeated more than twice in the error, but there will be exactly one element that is repeated in the array.

Note :

All the integers in the array appear only once except for precisely one integer which appears two or more times.

You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to return the list of all pairs of elements such that each sum of elements of each pair equals 'S'.

Note:

Each pair should be sorted i.e the first value should be less than or equals to the second value. 

Return the list of pairs sorted in non-decreasing order of their first value. In case if two pairs have the same first value, the pair with a smaller second value should come first.

 Which frontend technologies you are familiar?

How do you use Jquery to update the element value.

What is the dot selector in css?

What are some of the advantages of Angular over other frameworks?

Design an app like Practo.

Tell me about yourself.

Questions related to my resume

.Have you worked on jira?

Questions on agile framework.

Any Questions?