Quikr Interview Questions, Process, and Tips

Round duration - 75 minutes
Round difficulty - Easy

Timing was 10AM. Environment was quite good.

Q1. 
GCD Sum Problem Statement
Given an integer 'N', the task is to find the sum of the greatest common divisor (GCD) of all pairs (i, j) such that 1 <= i < j <= N.
Input:
T (the number of test case...read more
Ans. 
Calculate the sum of GCD of all pairs of numbers from 1 to N.
• Iterate through all pairs of numbers from 1 to N and calculate GCD

• Sum up all the calculated GCDs to get the final result

• Optimize the GCD calculation using Euclidean algorithm
Answered by AI
Add your answer
Q2. 
Consecutive Elements
Given an array arr of N non-negative integers, determine whether the array consists of consecutive numbers. Return true if they do, and false otherwise.
Input:
The first line of inp...read more
Ans. 
Check if an array of integers consists of consecutive numbers.
• Iterate through the array and check if the absolute difference between consecutive elements is 1.

• Sort the array and check if the elements are consecutive.

• Use a set to store the elements and check if the size of the set is equal to the length of the array.
Answered by AI
Add your answer

Round duration - 75 Minutes
Round difficulty - Medium

Timing was 10AM. Environment was quite good.

Q1. 
GCD Sum Problem Statement
Given an integer 'N', the task is to find the sum of the greatest common divisor (GCD) of all pairs (i, j) such that 1 <= i < j <= N.
Input:
T (the number of test case...read more
Add your answer
Q2. 
Consecutive Elements
Given an array arr of N non-negative integers, determine whether the array consists of consecutive numbers. Return true if they do, and false otherwise.
Input:
The first line of inp...read more
Add your answer

Round duration - 75 minutes
Round difficulty - Medium

Timing was 10AM. Environment was quite good.

Q1. 
GCD Sum Problem Statement
Given an integer 'N', the task is to find the sum of the greatest common divisor (GCD) of all pairs (i, j) such that 1 <= i < j <= N.
Input:
T (the number of test case...read more
Ans. 
Calculate the sum of GCD of all pairs of numbers from 1 to N.
• Iterate through all pairs of numbers from 1 to N and calculate GCD

• Add all the calculated GCDs to get the final sum

• Optimize the GCD calculation using Euclidean algorithm
Answered by AI
Add your answer
Q2. 
Consecutive Elements
Given an array arr of N non-negative integers, determine whether the array consists of consecutive numbers. Return true if they do, and false otherwise.
Input:
The first line of inp...read more
Ans. 
Check if an array of integers consists of consecutive numbers.
• Iterate through the array and check if the absolute difference between consecutive elements is 1.

• Sort the array and check if the elements are consecutive.

• Use a set to store unique elements and check if the size of the set matches the length of the array.
Answered by AI
Add your answer

General topics related to daily

Q1. Why do u want to join quikr
Add your answer