Quikr Interview Experience for Fresher SDE - Intern, Mar 2021

Consider all numbers from 1 to ‘N’, your task is to find the sum of gcd of all pairs (i, j) such that 1 <= i < j <= N.

For example for N = 3, all pairs are { (1, 2), (1, 3), (2, 3) }.

Note...

You are given an array arr of N non-negative integers, you need to return true if the array elements consist of consecutive numbers otherwise return false.