Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Quikr Team. If you also belong to the team, you can get access from here

Quikr Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Quikr Software Engineer Interview Questions and Answers

Updated 9 May 2021

Quikr Software Engineer Interview Experiences

1 interview found

I applied via Naukri.com and was interviewed before May 2020. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Android components, lifecycle, providers, receivers, fragments, view components, Ui design related questions.

Interview questions from similar companies

Interview Questionnaire 

15 Questions

  • Q1. Indexes in mysql
  • Ans. 

    Indexes in MySQL are used to improve query performance by allowing faster data retrieval.

    • Indexes are created on one or more columns of a table.

    • They work by creating a separate data structure that allows for faster data retrieval.

    • Indexes can be created using the CREATE INDEX statement.

    • Indexes can also be dropped using the DROP INDEX statement.

    • Indexes can be used to speed up SELECT, UPDATE, and DELETE statements.

    • Indexes ...

  • Answered by AI
  • Q2. Difference between include_once and require_once?
  • Ans. 

    include_once and require_once are PHP functions used to include files. The difference is in how they handle errors.

    • include_once will only include the file once, and will not throw a fatal error if the file is not found

    • require_once will also only include the file once, but will throw a fatal error if the file is not found

    • Both functions are used to include files that contain functions or variables that are needed in the

  • Answered by AI
  • Q3. Constructor and destrutor?
  • Q4. Sessions vs cookie. Detailed discussion
  • Ans. 

    Sessions and cookies are both used for maintaining user state, but sessions are server-side and cookies are client-side.

    • Sessions store user data on the server, while cookies store data on the client's browser

    • Sessions are more secure than cookies because the data is not accessible to the client

    • Cookies can be used for tracking user behavior and preferences

    • Sessions are typically used for authentication and authorization p...

  • Answered by AI
  • Q5. Some questions on lucene, solr as it was mentioned in my resume
  • Q6. 8 ball puzzle
  • Q7. Design patterns?
  • Q8. Array of first n numbers.One number is missing.Find missing number?
  • Ans. 

    To find missing number in an array of first n numbers.

    • Calculate the sum of first n numbers using formula n*(n+1)/2

    • Calculate the sum of given array using loop

    • Subtract the sum of array from sum of first n numbers to get the missing number

  • Answered by AI
  • Q9. What is memcache. Some discussion around it
  • Q10. Design a database schema for a chat application where user can send message to an individual or in group
  • Ans. 

    Design a database schema for a chat application with individual and group messaging.

    • Create a 'users' table with unique user IDs

    • Create a 'messages' table with message IDs, sender and receiver IDs, message content, and timestamp

    • Create a 'groups' table with unique group IDs and group names

    • Create a 'group_members' table with group ID and user ID to track group membership

    • Use foreign keys to link tables together

    • Consider inde

  • Answered by AI
  • Q11. Write sql to retrieve all unread messages when user sign in
  • Ans. 

    SQL query to retrieve all unread messages upon user sign in

    • Use a JOIN statement to combine the messages and user tables

    • Filter the results to only show messages that have not been read by the user

    • Use the user's sign in information to identify which messages are unread

  • Answered by AI
  • Q12. Why do you want to join OLX?
  • Ans. 

    I am excited to join OLX because of its innovative approach to online marketplaces and its commitment to customer satisfaction.

    • I am impressed by OLX's user-friendly platform and its ability to connect buyers and sellers from all over the world.

    • I am excited to work with a team of talented developers who are passionate about creating cutting-edge technology.

    • I believe that OLX's focus on customer satisfaction aligns with ...

  • Answered by AI
  • Q13. What difficulties have you faced
  • Ans. 

    I have faced difficulties in debugging complex code and managing project timelines.

    • Debugging complex code with multiple dependencies

    • Managing project timelines with changing requirements

    • Working with legacy code and outdated technologies

    • Collaborating with team members in different time zones

    • Dealing with unexpected bugs and errors

  • Answered by AI
  • Q14. How is the Employee hierarchy in your current organization.Whom do you report to
  • Ans. 

    I report to the Technical Lead and am part of the development team.

    • I report to the Technical Lead

    • I am part of the development team

  • Answered by AI
  • Q15. How much is the web traffic on your site etc
  • Ans. 

    Our website receives an average of 10,000 unique visitors per day.

    • Our website has a steady flow of traffic with a consistent number of unique visitors per day.

    • We use Google Analytics to track our web traffic and analyze user behavior.

    • Our peak traffic times are during weekdays from 9am to 5pm.

    • We have noticed an increase in mobile traffic over the past year.

    • Our website's traffic is primarily driven by organic search and

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
Experience: Round 4 with CTO :It was a normal discussion.

General Tips: I got a call through recruiter. My telephonic interview got scheduled. Overall process was very fast. It took not more than 3-4 days till I received offer letter.
Skills: Algorithm, Data structure, SQL
College Name: na

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

2 questions in 60 minutes

Round 2 - Technical 

(2 Questions)

  • Q1. System design, 1 hr
  • Q2. Don’t remember the question
Round 3 - HR 

(2 Questions)

  • Q1. Asked about my school life
  • Q2. Asked about my family

I applied via LinkedIn and was interviewed in Jul 2022. There were 2 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Aptitude Test 

Q1 - array questions.
Q2 - Graph questions.
Q3 - DP questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Must do medium questions on leetcode. Should be know all the data structures and algorithms. Should be know all CS fundamentals. No need to give advanced contest on codeforces.
Interview experience
2
Poor
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

In test I had to solve 3 dsa questions in 1 hour

Round 2 - Technical 

(1 Question)

  • Q1. I have asked 2 DSA questions in my interview
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Jul 2024. There were 4 interview rounds.

Round 1 - Coding Test 

It was a coding round where i need to solve 3 DSA Questions in 1.5 hour

Round 2 - Technical 

(2 Questions)

  • Q1. This is Technical round where i was asked to implement the Two Question of Dsa one is bases on greedy and another is dp , another one is leetcode hard (finding maxaimal area of rectangle in matrix of 1 and...
  • Q2. Greedy Q was direct i don't remember clearly. I was selected for the 2nd round
Round 3 - One-on-one 

(1 Question)

  • Q1. It was also a technical round but bases on LLD problem statement. I was given a problem statement to design a society security system and the they need psudo code for complete implementation using correct ...
Round 4 - HR 

(1 Question)

  • Q1. I was not selected for 4th round but heard that there were Q on cs fundamentals.

I was interviewed in Apr 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

The round consisted of 2 coding Problems and it lasted for 60 minutes from 12:00 PM to 1:00 PM on Hackerearth.
Use of other IDEs was prohibited and video was on.

  • Q1. 

    Implement indexOf Function

    You are provided with two strings A and B. Your task is to find the index of the first occurrence of A within B. If A is not found in B, return -1.

    Example:

    Input:
    A = "bc", ...
  • Ans. 

    Implement a function to find the index of the first occurrence of one string within another string.

    • Iterate through the second string and check if a substring of the same length as the first string matches the first string.

    • Return the index of the first occurrence of the first string within the second string, or -1 if not found.

    • Handle edge cases like empty strings or when the first string is longer than the second string

  • Answered by AI
  • Q2. 

    Problem: Search In Rotated Sorted Array

    Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer Q queries. Each query is represented by an integer Q[i], and you must ...

  • Ans. 

    Search for integers in a rotated sorted array efficiently.

    • Implement binary search to find the target integer in the rotated array.

    • Handle the rotation by checking which side of the array is sorted before performing binary search.

    • Return the index of the target integer if found, else return -1.

    • Time complexity of O(logN) is required for each query.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

The round was conducted on Google Meet with 2 interviewers . They were friendly and helpful.
The timing was 12:00 to 1:00 PM.
Our Video was on .

  • Q1. 

    Distinct Subsequences Problem Statement

    You are given a string 'S' of length 'N' which may include duplicate alphabets. Your goal is to calculate the number of distinct subsequences in the string.

    Exampl...

  • Ans. 

    Calculate the number of distinct subsequences in a string with possible duplicates.

    • Use dynamic programming to keep track of the count of distinct subsequences for each character in the string.

    • Consider the cases where the current character is included or excluded in the subsequence.

    • Handle duplicates by considering the previous occurrence of the character.

    • Return the count of distinct subsequences modulo 10^9 + 7.

  • Answered by AI
Round 3 - HR 

Round duration - 60 minutes
Round difficulty - Easy

This was a Behavioral Round. It lasted for 45-50 minutes. It consisted of a discussion on my projects. The interviewer was very impressed by the way I explained my projects. She even appreciated me for that. This was followed by normal HR questions .Timing of This round was 4:00 PM to 5:00 PM

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Guru Gobind Singh Indraprastha University. I applied for the job as SDE - 1 in HyderabadEligibility criteriaAbove 8 CGPAUrban Clap interview preparation:Topics to prepare for the interview - Dynamic Programming, OOPS, Operating System, DBMS, Greedy Algorithms, Computer NetworksTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : I prepared all topics from my Coding Ninjas Course - Competitive Programming
Tip 2 : I practiced 300+ questions on CodeZen ( Coding Ninjas Platform), LeetCode, InterviewBit
Tip 3 : I took part in contests on CodeForces.
Tip 4 : Apart from Data Structures and Algorithms , I also studied DBMS, OOPs and other course subjects

Application resume tips for other job seekers

Tip 1 : Keep Resume up to date for the role you are applying.
Tip 2 : Mention atleast 1 project or past work experience.
Tip 3 : Try to keep a 1 pager resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Oct 2020.

Round 1 - Coding Test 

(3 Questions)

Round duration - 75 minutes
Round difficulty - Medium

The test had 3 questions which had to solved in 75 minutes.The test was of medium difficulty.

  • Q1. 

    Meeting Rooms Allocation Problem Statement

    Stark Industry is planning to organize meetings for various departments in preparation for Stark Expo. Due to limited rooms in Stark Tower, the goal is to alloca...

  • Ans. 

    Determine the minimum number of conference rooms needed to schedule meetings without overlap.

    • Sort the meetings by start time.

    • Iterate through the meetings and keep track of the rooms in use.

    • If a meeting starts after another ends, it can reuse the same room.

    • If a meeting starts before another ends, a new room is needed.

    • Return the maximum number of rooms in use at any point.

  • Answered by AI
  • Q2. 

    Maximize XOR Value

    You are provided with an integer X and are tasked with identifying an integer Y such that the bitwise XOR operation between X and Y yields the maximum possible value. The condition is t...

  • Ans. 

    Find an integer Y such that XOR operation with X yields maximum value within given constraints.

    • Iterate from the most significant bit to find the highest bit that can be toggled to maximize XOR value.

    • To maximize XOR value, toggle the highest bit of X to 0 and all lower bits to 1.

    • Ensure the final Y does not exceed (2^61) - 1.

    • Example: For X = 3, the highest bit to toggle is at position 61, so Y = 2305843009213693950.

    • Examp...

  • Answered by AI
  • Q3. 

    Minimize Maximum Difference Between Adjacent Elements

    You are provided with a non-decreasing array and an integer K. Your task is to remove exactly K elements from this array so that the maximum differenc...

  • Ans. 

    Remove K elements from a non-decreasing array to minimize the maximum difference between adjacent elements.

    • Sort the array in non-decreasing order.

    • Iterate through the array and calculate the difference between adjacent elements.

    • Remove elements to minimize the maximum difference.

    • Return the minimized maximum difference.

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

The interview was taken by SDE2 and she was very friendly. All the questions asked were related to DS and algo. The first 10 minutes were used for introductions and the last 5 minutes were reserved for any questions that I have. Always try to ask meaningful questions at the end of the interview.

  • Q1. 

    Frequency in a Sorted Array Problem Statement

    Given a sorted array ARR and a number X, your task is to determine the count of occurrences of X within ARR.

    Note:

    • If X is not found in the array, return...
  • Ans. 

    Count occurrences of a number in a sorted array efficiently.

    • Use binary search to find the first and last occurrence of the target number in the array.

    • Calculate the count of occurrences by subtracting the indices of the last and first occurrences.

    • Handle cases where the target number is not found in the array.

    • Time complexity: O(log(N)), Space complexity: O(1).

  • Answered by AI
  • Q2. 

    Rotting Oranges Problem Statement

    You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:

    • 0 - representing an empty cell
    • 1 - representing a fre...
  • Ans. 

    Find the minimum time required to rot all fresh oranges in a grid.

    • Use Breadth First Search (BFS) to simulate the rotting process

    • Track the time taken to rot all oranges and return -1 if any fresh oranges remain

    • Handle edge cases such as no fresh oranges or all oranges already rotten

    • Consider using a queue to efficiently process neighboring oranges

  • Answered by AI
  • Q3. 

    Clone Linked List with Random Pointer Problem Statement

    Given a linked list where each node has two pointers: one pointing to the next node and another which can point randomly to any node in the list or ...

  • Ans. 

    Yes, the cloning of a linked list with random pointer can be accomplished without utilizing extra space.

    • Use a hashmap to store the mapping between original nodes and cloned nodes.

    • Iterate through the original linked list to create the cloned linked list by mapping the random pointers using the hashmap.

    • Time complexity of this approach is O(N) where N is the number of nodes in the linked list.

  • Answered by AI
Round 3 - Video Call 

Round duration - 60 minutes
Round difficulty - Medium

The focus of this round was mainly on my projects and internships. It was taken by a Senior SDE and it more of a technical interaction. I was asked in-depth about my projects and most of the questions asked around OS/DBMS were based on my projects.
The interviewer wanted to judge whether I have core knowledge about subjects like OS and DBMS and also about the projects that I had done.

Round 4 - HR 

Round duration - 60 minutes
Round difficulty - Easy

It was the culture fit round taken by the Director of Engineering.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Delhi Technological University. I applied for the job as SDE - 1 in GurgaonEligibility criteriaNoneUrban Clap interview preparation:Topics to prepare for the interview - Data Structures, OOPS, Dynamic programming, Algorithms, DBMS, OSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Learn the concepts, not the solutions.
Tip 2 : You should have deep knowledge about the projects mentioned in your resume.

Application resume tips for other job seekers

Tip 1 : Resume should be only 1 page.
Tip 2 : Try to tell a story through your resume. For eg - always mention the impact or scale of your projects/internship.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Oct 2020.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

The test was conducted in the evening from 5:00 pm to 6:30 pm. Because of the covid situation, all the students attempted the test from their homes. But it was a webcam-based test to avoid any kind of cheating.
There were 3 coding problems to be done in 90 minutes.
After resume based shortlisting, 70 candidates were selected to appear for the test out of which 30 were shortlisted for interviews.

  • Q1. 

    Amazing Strings Problem Statement

    Determine if the third string contains all the characters from both the first and second strings in any order. If so, return "YES"; otherwise, return "NO".

    Input:

    Line ...
  • Ans. 

    Check if the third string contains all characters from the first and second strings in any order.

    • Create a frequency map for characters in the first and second strings.

    • Check if all characters in the third string are present in the frequency map.

    • Ensure the count of characters in the third string matches the count in the frequency map.

    • Return 'YES' if all conditions are met, otherwise return 'NO'.

  • Answered by AI
  • Q2. 

    Shortest Path Visiting All Nodes

    You are given a connected undirected unweighted graph comprising 'N' nodes and 'M' edges. In this graph, each pair of connected nodes is linked by exactly one undirected e...

  • Ans. 

    Find the length of the shortest path visiting all nodes in a connected undirected unweighted graph.

    • Use Breadth First Search (BFS) to find the shortest path that visits all nodes at least once.

    • Maintain a bitmask to keep track of visited nodes and their states.

    • Consider all possible permutations of nodes to find the shortest path length.

  • Answered by AI
  • Q3. 

    Meeting Rooms Allocation Problem Statement

    Stark Industry is planning to organize meetings for various departments in preparation for Stark Expo. Due to limited rooms in Stark Tower, the goal is to alloca...

  • Ans. 

    Determine the minimum number of conference rooms required for scheduling meetings.

    • Sort the meetings by start time.

    • Iterate through the meetings and keep track of rooms needed based on overlapping times.

    • Use a priority queue to efficiently allocate rooms.

    • Example: For meetings (1pm-4pm), (3pm-5pm), (4pm-6pm), 2 rooms are required.

    • Ensure linear time complexity by optimizing the room allocation process.

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 50 minutes
Round difficulty - Medium

This round started at 9 am and went till 4 pm.
Out of 70 students that appeared in online coding test, 30 were shortlisted for the first round (this round) of interviews.
In this round, everyone was asked one moderate level coding question. The interviewer provided the link to an IDE, where I wrote my code.
The interview started with the introduction being followed by 1 coding problem. In the end, the interviewer asked me if I wanted to ask any questions. To which I asked him my feedback so that I can improve my wear areas.
Of the 30 candidates, 17 were selected for the final interview round.

  • Q1. 

    Print All Subsets Challenge

    Given an array arr containing 'N' distinct integers, your task is to generate all possible non-empty subsets of this array.

    Note: While the elements within each subset should ...

  • Ans. 

    Generate all possible non-empty subsets of an array of distinct integers.

    • Use recursion to generate all subsets by including or excluding each element in the array.

    • Maintain a current subset and add it to the result when reaching the end of the array.

    • Ensure elements within each subset are in increasing order.

    • Handle the input and output format as specified in the question.

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 50 minutes
Round difficulty - Easy

This was a technical + HR round. Started in the evening at 4:30 pm, this round went till 9:30 pm.
17 students were shortlisted for this final round of interview.
This interview was also virtual and involved both technical and HR-related questions. The interview started with an introduction and then questions based on my resume were asked.
Out of 17 candidates, 8 candidates got a full-time offer from Urban Company.

  • Q1. 

    Find Row With Maximum 1's in a Sorted 2D Matrix

    You are provided with a 2D matrix containing only the integers 0 or 1. The matrix has dimensions N x M, and each row is sorted in non-decreasing order. Your...

  • Ans. 

    Find the row with the maximum number of 1's in a sorted 2D matrix.

    • Iterate through each row of the matrix and count the number of 1's in each row.

    • Keep track of the row index with the maximum number of 1's seen so far.

    • Return the index of the row with the maximum number of 1's.

    • If multiple rows have the same number of 1's, return the row with the smallest index.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPA and more than 70% in 10th and 12thUrban Clap interview preparation:Topics to prepare for the interview - Object-Oriented Programming, Data Structures, Dynamic Programming, Operating System, Database Management System, System DesignTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Coding Problems are asked from DSA, so a good practice of standard problems is a must. Revisit these problems before the interview to ace and crack the interview.
Tip 2 : To tackle the conceptual questions, you need to have thorough knowledge about the concepts, so to prepare for OS and DBMS, read one standard book.
Tip 3 : Have proper and clear knowledge about your project. Basic but tricky questions are asked based on the internship experience and the projects you have done.

Application resume tips for other job seekers

Tip 1 : The best way to ace an interview is to take command of your interview in your hands. And this is done by having a balanced resume. Projects give direction to the interview and increase the probability of selection. So add at least 2 projects.
Tip 2 : Urban Company seeks team players and not just good coders. So add your achievements outside the academics to get shortlisted.

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Sep 2023. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Coding Test 

Seat reservation system
bit manipulation
binary tree related

Round 3 - Technical 

(1 Question)

  • Q1. Bfs / dfs traversal question
Contribute & help others!
anonymous
You can choose to be anonymous

Quikr Interview FAQs

How to prepare for Quikr Software Engineer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Quikr. The most common topics and skills that interviewers at Quikr expect are Golang, Java, Nestjs, NoSQL and Python.

Recently Viewed

SALARIES

Sysmex

SALARIES

OLX

SALARIES

Ciena

INTERVIEWS

OLX

No Interviews

INTERVIEWS

Sysmex

No Interviews

INTERVIEWS

Ciena

No Interviews

INTERVIEWS

OLX

No Interviews

INTERVIEWS

Sysmex

No Interviews

SALARIES

OnMobile Global

SALARIES

Ciena

Tell us how to improve this page.

Quikr Software Engineer Salary
based on 20 salaries
₹5.8 L/yr - ₹20 L/yr
48% more than the average Software Engineer Salary in India
View more details

Quikr Software Engineer Reviews and Ratings

based on 3 reviews

2.9/5

Rating in categories

2.9

Skill development

3.7

Work-life balance

3.3

Salary

4.4

Job security

3.8

Company culture

3.2

Promotions

2.2

Work satisfaction

Explore 3 Reviews and Ratings
Key Account Manager
286 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Executive
91 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Assistant Manager
85 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Sales Manager
80 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Key Account Manager
80 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Quikr with

OLX

3.8
Compare

JustDial

3.5
Compare

MagicBricks

3.7
Compare

Cartrade.com

4.0
Compare
Did you find this page helpful?
Yes No
write
Share an Interview