Software Developer

You are given a sorted array 'ARR' and a number 'X'. Your task is to count the number of occurrences of 'X' in 'ARR'.

Note :

1. If 'X' is not found in the array, return 0.
2. The given array is sorted in non-decreasing order.

You are given two strings 'str1' and 'str1'.

You have to tell whether these strings form an anagram pair or not.

The strings form an anagram pair if the letters of one string can be rearranged to form another string.

Pre-requisites:

Anagrams are defined as words or names that can be formed by rearranging the letters of another word. Such as "spar" can be formed by rearranging letters of "rasp". Hence, "spar" and "rasp" are anagrams. 

Other examples include:

'triangle' and 'integral'
'listen' and 'silent'

Note:

Since it is a binary problem, there is no partial marking. Marks will only be awarded if you get all the test cases correct. 

You are given an array ‘ARR’ of size ‘N’ consisting of integers. The array needs to be tweaked a little bit.

Firstly, calculate ‘TotalSum’ = ‘ARR[0]’ + ‘ARR[1]’ + ... + ‘ARR[N - 1]’.

Now, for every ‘i’ (0 <= ‘i’ <= ‘N’ - 1), ‘ARR[i]’ is replaced with ‘ARR[i]’ = ‘TotalSum’ - ‘ARR[i]’.

Output the final array after tweaking it.

Example :

'N' = 3
'ARR' = {2, 4, 1, 1}

TotalSum = 2 + 4 + 1 + 1 = 8

Tweaked Array = {6, 4, 7, 7}.

• What is method overriding?
• What is Encapsulation?
• Difference between Procedural programming and OOPs?
• What are the characteristics of an abstract class?