Linkedin | SRE | Coding OA and Solutions | Set-23 | 2022

Question

For proper oa or interview experiences list of all top tech companies visit :

https://oa.desiqna.in

https://interview.desiqna.in

 

 

Answer 1

Analyzing Arrays
Consider a 1-based array of n integers, arr[n]. For each element arr[i] where 1 <= i < n, determine the value of arr[i] ** arr[i+1] modulo (10 ** 9 + 7).  Return the lowest index of the highest modulo value.

Answer 2

Solution:

#include <bits/stdc++.h>
using namespace std;
int calculate(int a, int b){
	    return (int)((int)pow(a,b) % (int)(pow(10,9)+7));
	}
int powerArray(vector<int> arr){
    int result = INT_MAX;
    int n = arr.size();
	for(int i=1; i<=n-2; i++){
	    if(calculate(arr[i], arr[i+1])  >= calculate(arr[i+1], arr[i+2])){
	        result = min(result, i);
	    }
	}
	return result+1;
}