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

Quikr Lead Software Consultant Interview Questions and Answers

Updated 25 Sep 2023

Quikr Lead Software Consultant Interview Experiences

1 interview found

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

I applied via LinkedIn and was interviewed before Sep 2022. There were 2 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Properly align and format text in your resume. A recruiter will have to spend more time reading poorly aligned text, leading to high chances of rejection.
View all tips
Round 2 - Technical 

(5 Questions)

  • Q1. Interview regarding the HL7 intervace and Mirth Engine integration
  • Ans. Keep the knowledge on Hands on experience of your techinical skills
  • Answered Anonymously
  • Q2. The question was based on you worked on technical skill
  • Ans. Both Javascript and XML integration interview based on you skill used on interface
  • Answered Anonymously
  • Q3. TCP/IP integration
  • Q4. Related on connectivity of the integration
  • Q5. Workflow of the integration and other application involved on integration
  • Ans. 

    The integration workflow involves connecting different applications to enable seamless data exchange.

    • Identify the systems that need to be integrated

    • Define the data flow between the systems

    • Develop APIs or connectors for data exchange

    • Test the integration to ensure data accuracy and consistency

    • Monitor and maintain the integration for ongoing performance

    • Examples: Integrating CRM system with marketing automation platform, c...

  • Answered by AI

Skills evaluated in this interview

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

I was interviewed before Feb 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

It comprised of general aptitude questions and two coding questions. It was an offline test.

  • Q1. 

    N Queens Problem

    Given an integer N, find all possible placements of N queens on an N x N chessboard such that no two queens threaten each other.

    Explanation:

    A queen can attack another queen if they ar...

  • Ans. 

    The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard where no two queens threaten each other.

    • Use backtracking algorithm to explore all possible configurations.

    • Keep track of rows, columns, and diagonals to ensure queens do not attack each other.

    • Generate and print valid configurations where queens are placed safely.

    • Consider constraints and time limit for efficient solution.

    • Exam...

  • Answered by AI
  • Q2. 

    Sort 0 1 2 Problem Statement

    Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.

    Input:

    The first line contains an integer 'T' representing the n...
  • Ans. 

    Sort an integer array containing only 0s, 1s, and 2s in linear time complexity.

    • Use three pointers to keep track of the positions of 0s, 1s, and 2s in the array.

    • Iterate through the array and swap elements based on the values encountered.

    • Achieve sorting in a single scan over the array without using any extra space.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

After having a technical discussion about my CV. He gave me two questions to code.

  • Q1. 

    Ninja and Substrings Problem Statement

    Ninja has to determine all the distinct substrings of size two that can be formed from a given string 'STR' comprising only lowercase alphabetic characters. These su...

  • Ans. 

    Find all unique contiguous substrings of size two from a given string.

    • Iterate through the string and extract substrings of size two

    • Use a set to store unique substrings

    • Return the set as an array of strings

  • Answered by AI
  • Q2. 

    Cycle Detection in a Singly Linked List

    Determine if a given singly linked list of integers forms a cycle or not.

    A cycle in a linked list occurs when a node's next points back to a previous node in the ...

  • Ans. 

    Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.

    • Traverse the linked list using two pointers, one moving one step at a time and the other moving two steps at a time.

    • If the two pointers meet at any point, there is a cycle in the linked list.

    • If one of the pointers reaches the end of the list (null), there is no cycle.

  • Answered by AI
Round 3 - HR 

(1 Question)

Round duration - 30 minutes
Round difficulty - Easy

This was supposed to be the HR round but out of surprise the interviewer started by giving me a question to code. 
After I approached this question with the right solution he just asked about my family. After that he said to wait. After half an hour the results were announced. A total of three students were hired and I was amongst one of them.

  • Q1. 

    Balanced Parentheses Combinations

    Given an integer N representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.

    Explanati...

  • Ans. 

    Generate all possible combinations of balanced parentheses for a given number of pairs.

    • Use recursion to generate all possible combinations of balanced parentheses.

    • Keep track of the number of open and close parentheses used in each combination.

    • Return the valid combinations as an array of strings.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMagicbricks interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 5 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

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
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - HR 

(2 Questions)

  • Q1. What is thread ?
  • Ans. 

    A thread is a lightweight process that can run concurrently with other threads within the same process.

    • Threads allow for parallel execution of tasks within a single process.

    • Threads share the same memory space and resources of the process they belong to.

    • Threads can communicate with each other through shared memory or message passing.

    • Examples: Java threads, POSIX threads (pthreads) in C/C++.

  • Answered by AI
  • Q2. Inter process communication and project?

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. Stock buy and sell with at most 2 transaction
  • Ans. 

    Implement a solution to find the maximum profit from buying and selling stocks with at most 2 transactions.

    • Use dynamic programming to keep track of maximum profit at each day with 0, 1, or 2 transactions.

    • Consider the possibility of splitting the transactions into two separate parts.

    • Calculate the maximum profit by iterating through the prices array and updating the maximum profit accordingly.

  • Answered by AI
  • Q2. Binary search to find target
  • Ans. 

    Binary search is a divide and conquer algorithm that efficiently finds a target value in a sorted array.

    • Divide the array in half and compare the target value with the middle element

    • If the target is less than the middle element, search the left half. If greater, search the right half

    • Repeat the process until the target is found or the subarray is empty

  • Answered by AI
Round 2 - System Design 

(2 Questions)

  • Q1. General about project
  • Q2. Design paytm wallet
  • Ans. 

    Design a digital wallet system similar to Paytm.

    • Allow users to add money to their wallet using various payment methods like credit/debit cards, net banking, UPI, etc.

    • Enable users to make payments for various services like mobile recharge, bill payments, online shopping, etc.

    • Implement security measures like two-factor authentication, encryption of sensitive data, and regular security audits.

    • Provide features like transac...

  • Answered by AI

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

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

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 tips
Round 2 - Coding Test 

Seat reservation system
bit manipulation
binary tree related

Round 3 - Technical 

(1 Question)

  • Q1. Bfs / dfs traversal question

I was interviewed in Jul 2021.

Round 1 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Easy level DSA questions were asked to implement.

  • Q1. 

    BFS Traversal in a Graph

    Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...

  • Ans. 

    BFS traversal of an undirected and disconnected graph starting from vertex 0.

    • Implement BFS algorithm to traverse the graph starting from vertex 0.

    • Use a queue to keep track of visited nodes and their neighbors.

    • Ensure the traversal starts from vertex 0 and follows the BFS order.

    • Output the BFS traversal sequence for each test case in a separate line.

    • Handle disconnected components by checking for unvisited nodes.

    • Consider t...

  • Answered by AI
  • Q2. 

    DFS Traversal Problem Statement

    Given an undirected and disconnected graph G(V, E), where V is the number of vertices and E is the number of edges, the connections between vertices are provided in the 'GR...

  • Ans. 

    DFS traversal problem to find connected components in an undirected and disconnected graph.

    • Use Depth First Search (DFS) algorithm to traverse the graph and find connected components

    • Maintain a visited array to keep track of visited vertices

    • Iterate through all vertices and perform DFS on unvisited vertices to find connected components

  • Answered by AI
  • Q3. 

    Nth Fibonacci Number Problem Statement

    Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2), with initial conditions F(1) = F(2) = 1.

    Input:

    ...
  • Ans. 

    Calculate the Nth Fibonacci number efficiently using dynamic programming.

    • Use dynamic programming to store and reuse previously calculated Fibonacci numbers.

    • Start with base cases F(1) and F(2) as 1, then calculate subsequent Fibonacci numbers.

    • Optimize the solution to avoid redundant calculations by storing intermediate results.

    • Time complexity can be reduced to O(N) using dynamic programming.

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

DSA questions based on trees were asked to implement.

  • Q1. 

    Determine the Left View of a Binary Tree

    You are given a binary tree of integers. Your task is to determine the left view of the binary tree. The left view consists of nodes that are visible when the tree...

  • Ans. 

    The task is to determine the left view of a binary tree, which consists of nodes visible when viewed from the left side.

    • Traverse the binary tree level by level from left to right, keeping track of the first node encountered at each level.

    • Use a queue to perform level order traversal of the binary tree.

    • Store the leftmost node at each level in the result array.

    • Return the result array containing the left view of the binary

  • Answered by AI
  • Q2. 

    Right View of Binary Tree

    Given a binary tree of integers, your task is to output the right view of the tree.

    The right view of a binary tree includes the nodes that are visible when the tree is observed...

  • Ans. 

    The task is to output the right view of a binary tree, which includes the nodes visible when observed from the right.

    • Perform level order traversal of the binary tree.

    • For each level, add the rightmost node to the result.

    • Print the result as the right view of the binary tree.

    • Handle null nodes represented by -1 in the input.

  • Answered by AI
  • Q3. 

    Height of Binary Tree

    You are provided with the Inorder and Level Order traversals of a Binary Tree composed of integers. Your goal is to determine the height of this Binary Tree without actually construc...

  • Ans. 

    Find the height of a Binary Tree given its Inorder and Level Order traversals without constructing it.

    • Use the properties of Inorder and Level Order traversals to determine the height of the Binary Tree.

    • The height of a Binary Tree is the number of edges on the longest path from the root to a leaf node.

    • Consider edge cases like a single node tree or empty tree while calculating the height.

  • Answered by AI
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

Typical HR round where the interviewer asked questions to know more about me.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAPolicyBazaar.com interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Learn DS, SQL for the interview as it will be ask and be confident about what you are saying
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Quikr Interview FAQs

How many rounds are there in Quikr Lead Software Consultant interview?
Quikr interview process usually has 2 rounds. The most common rounds in the Quikr interview process are Resume Shortlist and Technical.
What are the top questions asked in Quikr Lead Software Consultant interview?

Some of the top questions asked at the Quikr Lead Software Consultant interview -

  1. Workflow of the integration and other application involved on integrat...read more
  2. Interview regarding the HL7 intervace and Mirth Engine integrat...read more
  3. The question was based on you worked on technical sk...read more

Tell us how to improve this page.

Quikr Lead Software Consultant Interview Process

based on 1 interview

Interview experience

3
  
Average
View more

Interview Questions from Similar Companies

Swiggy Interview Questions
3.8
 • 439 Interviews
PolicyBazaar Interview Questions
3.6
 • 346 Interviews
Udaan Interview Questions
4.0
 • 335 Interviews
JustDial Interview Questions
3.5
 • 329 Interviews
Meesho Interview Questions
3.7
 • 329 Interviews
Myntra Interview Questions
4.0
 • 216 Interviews
Blinkit Interview Questions
3.7
 • 182 Interviews
BlackBuck Interview Questions
3.8
 • 174 Interviews
Spinny Interview Questions
3.7
 • 168 Interviews
FirstCry Interview Questions
3.7
 • 167 Interviews
View all

Quikr Lead Software Consultant Reviews and Ratings

based on 1 review

4.0/5

Rating in categories

4.0

Skill development

4.0

Work-life balance

4.0

Salary

3.0

Job security

4.0

Company culture

3.0

Promotions

4.0

Work satisfaction

Explore 1 Review and Rating
Key Account Manager
286 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Assistant Manager
85 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Executive
84 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.6
Compare

Cartrade.com

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