i
Quikr
Filter interviews by
I was interviewed in Mar 2021.
Round duration - 75 minutes
Round difficulty - Easy
Timing was 10AM. Environment was quite good.
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.
T
(the number of test case...
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
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.
The first line of inp...
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.
Tip 1 : Do 2 projects.
Tip 2 : Practice javascript basics too.
Tip 3 : Practice array questions.
Tip 1 : Have some projects on resume.
Tip 2 : Keep it short.
I was interviewed in Mar 2021.
Round duration - 75 Minutes
Round difficulty - Medium
Timing was 10AM. Environment was quite good.
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.
T
(the number of test case...
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.
The first line of inp...
Tip 1 : Do 2 projects.
Tip 2 : Practice javascript basics too.
Tip 3 : Practice array questions.
Tip 1 : Have some projects on resume.
Tip 2 : Keep it short.
I was interviewed in Mar 2021.
Round duration - 75 minutes
Round difficulty - Medium
Timing was 10AM. Environment was quite good.
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.
T
(the number of test case...
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
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.
The first line of inp...
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.
Tip 1 : Practice javascripts
Tip 2 : Practice data structure
Tip 1 : Keep it short
Tip 2 : Don't add false information
I applied via Naukri.com and was interviewed before Sep 2022. There were 3 interview rounds.
General topics related to daily
Quikr interview questions for popular designations
I applied via Referral and was interviewed in Dec 2021. There was 1 interview round.
Get interview-ready with Top Quikr Interview Questions
I applied via Internshala and was interviewed before Feb 2022. There was 1 interview round.
I applied via Company Website and was interviewed before May 2022. There were 4 interview rounds.
Questions regarding Manual testing, Java , Selenium Automations
Questions regarding Selenium and Java
I was interviewed in Nov 2020.
Round duration - 45 minutes
Round difficulty - Easy
Basics of HTML, JavaScript was asked along with a coding question.
You are provided with an array ARR
consisting of N
distinct integers in ascending order and an integer TARGET
. Your objective is to count all the distinct pairs in ARR
whose sum...
Count the number of distinct pairs in an array whose sum equals a given target.
Iterate through the array and for each element, check if the complement (target - current element) exists in a hash set.
If the complement exists, increment the count of pairs and add the current element to the hash set.
Return the count of pairs at the end.
Round duration - 45 minutes
Round difficulty - Medium
Asked CSS,JavaScript and project related question and asked to code algorithm problem in JavaScript.
You are provided with a string 'STR'
that consists of lowercase English letters ranging from 'a' to 'z'. Your task is to determine all non-empty possible subsequen...
Generate all possible subsequences of a given string.
Use recursion to generate all possible subsequences by including or excluding each character in the string.
Maintain the order of characters while generating subsequences.
Handle base cases where the string is empty or has only one character.
Example: For input 'abc', possible subsequences are 'a', 'ab', 'abc', 'ac', 'b', 'bc', 'c'.
Tip 1 : Know basics of HTML and CSS
Tip 2 : Know basics of Javascript. Good to know ReactJS
Tip 3 : Practice basic, standard DS and Algo.
Tip 1 : Mention frontend developer skills like HTML, CSS, JavaScript, ReactJS, etc
Tip 2 : Have 1 or 2 good projects on your resume
I applied via Referral
I applied via Referral and was interviewed before Apr 2021. There was 1 interview round.
Top trending discussions
Some of the top questions asked at the Quikr interview -
The duration of Quikr interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 21 interviews
Interview experience
Key Account Manager
286
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
85
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Executive
84
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Manager
80
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Key Account Manager
80
salaries
| ₹0 L/yr - ₹0 L/yr |
OLX
JustDial
MagicBricks
Cartrade.com