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 Software Developer Interview Questions, Process, and Tips

Updated 14 Jan 2022

Top Quikr Software Developer Interview Questions and Answers

  • Q1. Buy and Sell Stock Problem Statement Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' days. You ...read more
  • Q2. Subsequences of String Problem Statement You are provided with a string 'STR' that consists of lowercase English letters ranging from 'a' to 'z'. Your task is to determi ...read more
  • Q3. Find Missing Number In String Problem Statement You have a sequence of consecutive nonnegative integers. By appending all integers end-to-end, you formed a string S with ...read more
View all 35 questions

Quikr Software Developer Interview Experiences

5 interviews found

Interview Questionnaire 

12 Questions

  • Q1. Given a no K and an array. Find pair of elements whose sum is equal to given no K
  • Ans. 

    Find pair of elements in an array whose sum is equal to a given number K.

    • Iterate through the array and for each element, check if K minus the element exists in the array.

    • Use a hash table to store the elements and their indices for faster lookup.

    • If multiple pairs exist, return any one of them.

    • If no pair exists, return null or an appropriate message.

  • Answered by AI
  • Q2. If there is a website run by 2 servers. These 2 servers balances the load using Load Balancer. So, if 1 session is created on 1 server and say load is shift to another server immediately, then how session ...
  • Ans. 

    Session is maintained using session affinity or sticky sessions.

    • Session affinity ensures that a user's session is always directed to the same server.

    • Load balancer uses a unique identifier to route requests to the same server.

    • Sticky sessions can be implemented using cookies or URL rewriting.

    • Session replication can also be used to maintain session data across multiple servers.

  • Answered by AI
  • Q3. WAP to implement some basic Design Patterns like Singleton?
  • Ans. 

    Singleton pattern ensures only one instance of a class is created and provides a global point of access to it.

    • Create a private constructor to prevent direct instantiation of the class

    • Create a private static instance of the class

    • Create a public static method to access the instance

    • Ensure thread safety by using synchronized keyword or static initialization block

    • Examples: Logger, Configuration Manager, Database Connection

  • Answered by AI
  • Q4. Abstract class? How it is different from interface? Is multiple inheritance possible in php? How?
  • Ans. 

    Explaining abstract class, interface and multiple inheritance in PHP.

    • Abstract class is a class that cannot be instantiated and can have abstract methods.

    • Interface is a collection of abstract methods and constants that can be implemented by a class.

    • Multiple inheritance is not possible in PHP, but can be achieved using interfaces.

    • Interfaces can be implemented by multiple classes, allowing for multiple inheritance-like be

  • Answered by AI
  • Q5. Write a stored procedure from a given set of tables and conditions. Simple one
  • Ans. 

    Write a stored procedure from given tables and conditions

    • Identify the tables and their relationships

    • Determine the conditions to be used in the stored procedure

    • Write the SQL code for the stored procedure

    • Test the stored procedure to ensure it returns the desired results

  • Answered by AI
  • Q6. How to increase php memory at run time, if it exhausts?
  • Ans. 

    To increase PHP memory at run time, modify the php.ini file or use ini_set() function.

    • Edit the memory_limit value in php.ini file

    • Use ini_set('memory_limit', '256M') function to increase memory limit at run time

    • Check for memory leaks in the code

    • Use unset() function to free up memory after use

  • Answered by AI
  • Q7. What all we can do with php.ini?
  • Ans. 

    php.ini is a configuration file for PHP that allows users to customize various settings.

    • Change PHP settings such as memory limit, file upload size, and error reporting

    • Enable or disable extensions and modules

    • Set timezone and language settings

    • Configure email settings

    • Control caching and session settings

  • Answered by AI
  • Q8. Session and cookies?
  • Q9. Javascript clausers?
  • Q10. Jquery function to get domain from a url?
  • Ans. 

    Use window.location to get domain from a url in jQuery.

    • Use window.location to get the full url

    • Use .hostname to get the domain name

    • Use .replace() to remove 'www.' if present

  • Answered by AI
  • Q11. WAP to get smallest plindron number larger than the given no?
  • Ans. 

    WAP to find smallest palindrome number larger than given number.

    • Convert the given number to string and check if it is already a palindrome.

    • If not, increment the number and check if it is a palindrome.

    • Repeat until a palindrome number larger than the given number is found.

    • Use a while loop to implement the above steps.

  • Answered by AI
  • Q12. WAP to check if linked list elements is a palindrome without using any extra space?
  • Ans. 

    WAP to check if linked list elements is a palindrome without using any extra space.

    • Traverse the linked list and reverse the second half of the list

    • Compare the first half with the reversed second half

    • Use two pointers to traverse the list, one at normal speed and other at double speed

  • Answered by AI

Interview Preparation Tips

Skills: Algorithm, JQuery, Javascript
College Name: na

Skills evaluated in this interview

Interview Questionnaire 

7 Questions

  • Q1. Find the first non repetitive character in a string?
  • Ans. 

    Find the first non-repeating character in a string.

    • Create a hash table to store the frequency of each character in the string.

    • Iterate through the string and check the frequency of each character.

    • Return the first character with a frequency of 1.

  • Answered by AI
  • Q2. What is connection pooling
  • Ans. 

    Connection pooling is a technique of reusing database connections to improve performance.

    • Connection pooling helps to reduce the overhead of creating and destroying database connections.

    • It maintains a pool of connections that can be reused by multiple clients.

    • Connection pooling is commonly used in web applications to handle multiple requests simultaneously.

    • It can be configured with parameters like maximum number of conn...

  • Answered by AI
  • Q3. Write a singleton class in php?
  • Ans. 

    A singleton class in PHP is a class that can only be instantiated once.

    • Create a private constructor to prevent direct instantiation

    • Create a private static variable to hold the instance of the class

    • Create a public static method to get the instance of the class

    • Ensure that the public static method always returns the same instance

  • Answered by AI
  • Q4. How to write a Connection class to MySQL database using PHP?
  • Ans. 

    To connect to MySQL database using PHP, create a Connection class.

    • Use mysqli_connect() function to establish a connection

    • Pass the database credentials as parameters to the function

    • Create a constructor method to initialize the connection

    • Create a query method to execute SQL queries

    • Close the connection using mysqli_close() method

  • Answered by AI
  • Q5. What are the different types of error in php?
  • Ans. 

    There are three types of errors in PHP: syntax errors, runtime errors, and logical errors.

    • Syntax errors occur when the code is not written correctly, such as missing semicolons or parentheses.

    • Runtime errors occur during the execution of the code, such as trying to access an undefined variable.

    • Logical errors occur when the code runs without errors, but produces unexpected results, such as a miscalculation in a formula.

  • Answered by AI
  • Q6. How session works in php?
  • Ans. 

    Session in PHP allows to store user data on the server for later use.

    • Session starts when a user logs in and ends when the user logs out or the session expires.

    • Session data is stored on the server and identified by a unique session ID.

    • Session variables can be set and accessed using the $_SESSION superglobal array.

    • Session can be destroyed using the session_destroy() function.

    • Session can be used to store user-specific dat...

  • Answered by AI
  • Q7. Find missing element in an array of elements from 0 to n-1?
  • Ans. 

    Find missing element in an array of elements from 0 to n-1

    • Calculate sum of all elements in array and subtract from sum of n natural numbers

    • Use XOR operation on all elements and n natural numbers

    • Sort the array and find the missing element

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: You have been given stack of documents that have already been processed and some that have not. your task is to classify these documents into one of the eight categories: [1,2,3..8]. However you notice that there are already large amount of documents which have already been correctly processed(training data). you decide to use machine learning on this data in order to categorize.First line of the input file contain T number of documents. T lines will follow each containing a series of space separated words which represents the processed word.

Skills: PHP, data base, data structure
College Name: NA

Skills evaluated in this interview

Software Developer Interview Questions Asked at Other Companies

asked in Amazon
Q1. Maximum Subarray Sum Problem Statement Given an array of integers ... read more
asked in Amazon
Q2. Minimum Number of Platforms Needed Problem Statement You are give ... read more
asked in Rakuten
Q3. Merge Two Sorted Arrays Problem Statement Given two sorted intege ... read more
asked in Cognizant
Q4. Nth Fibonacci Number Problem Statement Calculate the Nth term in ... read more
Q5. Find Duplicate in Array Problem Statement You are provided with a ... read more

I appeared for an interview before Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was a written coding test with 2 coding questions to be solved in 60 minutes.

  • Q1. 

    Find Missing Number In String Problem Statement

    You have a sequence of consecutive nonnegative integers. By appending all integers end-to-end, you formed a string S without any separators. During this pro...

  • Ans. 

    Given a string of consecutive nonnegative integers with one missing number, find the missing integer.

    • Iterate through the string to find the missing number by checking the consecutive integers.

    • If there is more than one missing number, all integers are present, or the string is invalid, return -1.

    • Handle cases where the missing number is at the beginning or end of the sequence.

    • Consider edge cases such as single-digit numb

  • Answered by AI
  • Q2. 

    First Non-Repeating Character Problem Statement

    You are given a string consisting of English alphabet characters. Your task is to identify and return the first character in the string that does not repeat...

  • Ans. 

    The task is to find the first non-repeating character in a string, or return the first character if all characters repeat.

    • Iterate through the string to count the frequency of each character

    • Find the first character with a frequency of 1, or return the first character if no such character exists

    • Handle both uppercase and lowercase characters separately

    • Use a hashmap to store character frequencies efficiently

  • Answered by AI
Round 2 - Face to Face 

(5 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical interview round with questions around PHP and DBMS.

  • Q1. What is connection pooling?
  • Ans. 

    Connection pooling is a technique used to manage a pool of database connections to improve performance and efficiency.

    • Connection pooling reduces the overhead of opening and closing database connections for each request.

    • It allows multiple clients to reuse a pre-established set of connections to the database.

    • Connection pooling helps in improving the scalability and performance of applications by efficiently managing data...

  • Answered by AI
  • Q2. How would you create a singleton design pattern in PHP 5?
  • Ans. 

    To create a singleton design pattern in PHP 5, use a private static variable to store the instance and a static method to retrieve it.

    • Create a private static variable to store the instance of the class.

    • Create a private constructor to prevent outside instantiation of the class.

    • Create a static method to check if an instance already exists and return it, or create a new instance if it doesn't.

  • Answered by AI
  • Q3. Can you write code to connect PHP to MySQL?
  • Ans. 

    Yes, PHP can be used to connect to MySQL by using MySQLi or PDO extensions.

    • Use MySQLi extension to connect PHP to MySQL

    • Use PDO extension to connect PHP to MySQL

    • Example using MySQLi: $conn = new mysqli($servername, $username, $password, $dbname);

    • Example using PDO: $conn = new PDO('mysql:host=$servername;dbname=$dbname', $username, $password);

  • Answered by AI
  • Q4. What are the different types of errors in PHP?
  • Ans. 

    Different types of errors in PHP include syntax errors, runtime errors, and logical errors.

    • Syntax errors: Occur when there is a mistake in the code syntax, preventing the script from running.

    • Runtime errors: Happen during script execution, such as division by zero or calling a function that does not exist.

    • Logical errors: Difficult to detect as the code runs without errors, but produces incorrect results.

    • Fatal errors: St...

  • Answered by AI
  • Q5. How does session management work in PHP?
  • Ans. 

    Session management in PHP involves storing user data on the server to maintain state between multiple requests.

    • Sessions are started using session_start() function in PHP.

    • Session data is stored on the server and a unique session ID is sent to the client's browser.

    • Session variables can be set, accessed, and unset using $_SESSION superglobal array.

    • Sessions can be destroyed using session_destroy() function.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAQuikr interview preparation:Topics to prepare for the interview - PHP, data base, data structures, AlgorithmsTime required to prepare for the interview - 3 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 interviewRejected

Skills evaluated in this interview

I appeared for an interview before Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was a coding test where we had to solve 2 coding questions in 60 minutes.

  • Q1. 

    Buy and Sell Stock Problem Statement

    Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' days. You can perform up to two buy-and-sell ...

  • Ans. 

    The task is to determine the maximum profit that can be achieved by performing up to two buy-and-sell transactions on a given set of stock prices.

    • Iterate through the array of stock prices to find the maximum profit that can be achieved by buying and selling stocks.

    • Keep track of the maximum profit that can be obtained by performing up to two transactions.

    • Consider all possible combinations of buying and selling stocks to...

  • Answered by AI
  • Q2. 

    Subsequences of String Problem Statement

    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...

  • Ans. 

    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 a current index to keep track of the characters being considered.

    • Append the current character to each subsequence generated so far.

    • Recursively call the function with the next index to include the next character in subsequences.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was a technical round where the interviewer asked me questions related to OS and Java.

  • Q1. What is the critical section problem?
  • Ans. 

    The critical section problem is a synchronization issue in concurrent programming where multiple processes access shared resources.

    • Critical section is a code segment that accesses shared resources and must be executed by only one process at a time.

    • The goal is to prevent race conditions and ensure mutual exclusion.

    • Solutions include using locks, semaphores, and mutex to control access to critical sections.

    • Example: Multip...

  • Answered by AI
  • Q2. How can we create a thread in Java?
  • Ans. 

    A thread in Java can be created by extending the Thread class or implementing the Runnable interface.

    • Extend the Thread class and override the run() method

    • Implement the Runnable interface and provide the implementation for the run() method

    • Start the thread using the start() method

  • Answered by AI
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

Typical HR round with behavioral questions.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAQuikr interview preparation:Topics to prepare for the interview - Java, Data Structures, Algorithms, System Design,OOPSTime required to prepare for the interview - 4 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

Quikr interview questions for designations

 Software Developer Intern

 (3)

 Software Engineer

 (1)

 Wordpress Developer

 (1)

 Associate Software Engineer

 (1)

 Associate Software Test Engineer

 (1)

 Lead Software Consultant

 (1)

 Frontend Developer Intern

 (1)

 QA Engineer

 (1)

I appeared for an interview before Jan 2021.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical round where the interviewer asked me questions based on data structures , algorithms and load balancer and session management.

  • Q1. 

    Pair Sum Problem Statement

    You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.

    Note:
    ...
  • Ans. 

    Find pairs of elements in an array that sum up to a given value, sorted in a specific order.

    • Iterate through the array and use a hashmap to store the difference between the target sum and each element.

    • Check if the difference exists in the hashmap, if so, add the pair to the result list.

    • Sort the result list based on the criteria mentioned in the problem statement.

  • Answered by AI
  • Q2. 

    Next Smallest Palindrome Problem Statement

    Find the next smallest palindrome strictly greater than a given number 'N' represented as a string 'S'.

    Explanation:

    You are given a number in string format, a...

  • Ans. 

    Find the next smallest palindrome greater than a given number represented as a string.

    • Convert the string number to an integer for comparison.

    • Increment the number until a palindrome greater than the input is found.

    • Handle cases where the input is already a palindrome or has leading zeros.

    • Return the next greater palindrome as a string.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical round where the interviewer asked me questions based on data structures , design patterns and php.

  • Q1. 

    Check If Linked List Is Palindrome

    Given a singly linked list of integers, determine if the linked list is a palindrome.

    Explanation:

    A linked list is considered a palindrome if it reads the same forwar...

  • Ans. 

    Check if a given singly linked list of integers is a palindrome.

    • Create a function to reverse the linked list.

    • Use slow and fast pointers to find the middle of the linked list.

    • Compare the first half of the linked list with the reversed second half to determine if it's a palindrome.

  • Answered by AI
  • Q2. Can you explain the implementation of the Singleton Design pattern?
  • Ans. 

    Singleton Design pattern ensures a class has only one instance and provides a global point of access to it.

    • Ensure the class has a private static instance variable.

    • Provide a public static method to access the instance.

    • Make the constructor private to prevent instantiation from outside the class.

    • Lazy initialization can be used to create the instance only when needed.

    • Thread safety considerations may be necessary in a multi

  • Answered by AI
Round 3 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical round where the interviewer asked me questions based on Javascript, dbms, oops concepts and php.

  • Q1. Write a stored procedure to join two tables.
  • Ans. 

    A stored procedure to join two tables in a database.

    • Use the JOIN keyword to combine rows from two or more tables based on a related column between them.

    • Specify the columns to be selected from each table in the SELECT statement.

    • Use the ON keyword to specify the join condition.

    • Consider using INNER JOIN, LEFT JOIN, RIGHT JOIN, or FULL JOIN based on the desired result.

    • Test the stored procedure with sample data to ensure it

  • Answered by AI
  • Q2. What is the difference between an abstract class and an interface in Object-Oriented Programming?
  • Ans. 

    Abstract class can have both abstract and non-abstract methods, while interface can only have abstract methods.

    • Abstract class can have constructors, fields, and methods, while interface cannot have any implementation.

    • A class can only extend one abstract class, but can implement multiple interfaces.

    • Abstract classes are used to define common characteristics among subclasses, while interfaces are used to define a contract...

  • Answered by AI
  • Q3. How can you extract the domain name from a URL using jQuery?
  • Ans. 

    Use jQuery to extract domain name from a URL

    • Use the 'a' element to create a temporary link with the URL

    • Access the 'hostname' property of the link to get the domain name

    • Use regular expressions to extract the domain name from the URL

  • Answered by AI
  • Q4. What are closures in JavaScript?
  • Ans. 

    Closures in JavaScript are functions that have access to variables from their outer scope even after the outer function has finished executing.

    • Closures allow functions to access variables from their parent function even after the parent function has finished executing.

    • They are created whenever a function is defined within another function.

    • Closures are commonly used to create private variables and functions in JavaScrip...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAQuikr interview preparation:Topics to prepare for the interview - Algorithms,Data structures, JQuery, Javascript, PHPTime required to prepare for the interview - 6 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 interviewRejected

Skills evaluated in this interview

Get interview-ready with Top Quikr Interview Questions

Interview questions from similar companies

I appeared for an interview before Dec 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 minutes
Round difficulty - Medium

The Entire Test is held in HackerRank Platform. It has: 
2 coding questions (one easy and one medium)
2 output questions(medium)
2 Aptitude(easy)
1 general Computer science(medium)
It took me 30 min for each coding questions. I did not know that general question is related to bash commands.
Tips: Practice the Warmup questions in Hacker Rank.
Do some Basic aptitude questions.
Thorough with the basic C and C++ concepts

  • Q1. 

    Binary Tree to Doubly Linked List

    Transform a given Binary Tree into a Doubly Linked List.

    Ensure that the nodes in the Doubly Linked List follow the Inorder Traversal of the Binary Tree.

    Input:

    The fi...
  • Ans. 

    Convert a Binary Tree into a Doubly Linked List following Inorder Traversal.

    • Perform Inorder Traversal of the Binary Tree to get the nodes in order.

    • Create a Doubly Linked List by linking the nodes in the order obtained from Inorder Traversal.

    • Return the head of the Doubly Linked List as the output.

  • Answered by AI
  • Q2. 

    Unique Element in Array

    Given an arbitrary array arr consisting of N non-negative integers where every element appears thrice except for one. Your task is to find the element in the array that appears onl...

  • Ans. 

    Find the unique element in an array where every other element appears thrice.

    • Use XOR operation to find the unique element.

    • Iterate through the array and XOR each element to find the unique one.

    • Return the unique element as the answer.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

It's completely around the data structures. The questions are a bit tricky but once u think without any tension u can get through easily. The interviewer is helpful and gives u few hints if u catch them at the right point of time u got it. 
Tips: got through Data Structures and Algorithms Made Easy by Narasimha Karumanchi. It's a best book for the interviews.

  • Q1. 

    Binary Tree Traversals Problem Statement

    Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...

  • Ans. 

    Implement a function to compute In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.

    • Parse the input level-order tree elements to construct the binary tree.

    • Implement recursive functions for In-Order, Pre-Order, and Post-Order traversals.

    • Return the traversals as lists of lists for each test case.

  • Answered by AI
  • Q2. 

    Delete N Nodes After M Nodes in a Linked List

    Given a singly linked list and two integers 'N' and 'M', traverse the linked list to retain 'M' nodes and then delete the next 'N' nodes. Continue this proces...

  • Ans. 

    Traverse a linked list to retain 'M' nodes and then delete the next 'N' nodes, repeating until the end of the list.

    • Create a function that takes the head of the linked list, 'N', and 'M' as input parameters.

    • Traverse the linked list, retaining 'M' nodes and deleting the next 'N' nodes in each iteration.

    • Update the pointers accordingly to skip 'N' nodes after retaining 'M' nodes.

    • Repeat this process until the end of the lin...

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

The interviewer asked to put everything on the blackboard and write down the code of each and everything.

Question : Explain all the search algorithm you know with space and Time complexities. 
Answer : Linear search : It is a sequential search algorithm where the entire array is traversed till the desired element is not found. Time complexity is O(N) and auxiliary space is O(1). 
Binary search : In this algorithm, a sorted array is searched by repeatedly dividing the search interval in half. 
Steps : 
1. Initially the interval covers the whole array.
2. If the value to be searched is less than the item in the middle of the interval, narrow the interval to the lower half. Otherwise, narrow it to the upper half. 
3. The process is repeated until the value is found or the interval is empty.
Time complexity is O(log n) and auxiliary space is O(1) in case of iterative implementation.

  • Q1. 

    Maximum Frequency Number Problem Statement

    Given an array of integers with numbers in random order, write a program to find and return the number which appears the most frequently in the array.

    If multip...

  • Ans. 

    Program to find the number with maximum frequency in an array of integers.

    • Create a dictionary to store the frequency of each number in the array.

    • Iterate through the array and update the frequency count in the dictionary.

    • Find the number with the maximum frequency in the dictionary and return it.

    • If multiple elements have the same maximum frequency, return the one with the lowest index.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMyntra 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 : 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

Software Developer Interview Questions & Answers

Myntra user image Thommandru Vishnu

posted on 10 Mar 2015

Interview Questionnaire 

9 Questions

  • Q1. All the leaf nodes of tree are doubly linked,print only the leaf nodes of a tree
  • Ans. 

    Print only the leaf nodes of a doubly linked tree.

    • Traverse the tree and check if a node has no children and both left and right pointers are null.

    • If yes, then it is a leaf node and print it.

    • If no, then continue traversing the tree.

    • Use recursion to traverse the tree in a depth-first manner.

  • Answered by AI
  • Q2. LRU page Replacement Algorithm for large data
  • Ans. 

    LRU page replacement algorithm is used to replace the least recently used page in memory with a new page.

    • LRU stands for Least Recently Used

    • It is a cache eviction algorithm

    • It is used to manage memory in operating systems

    • It works by keeping track of the pages that are used recently and the ones that are not

    • When a new page is to be loaded into memory, the algorithm checks which page has not been used for the longest time

  • Answered by AI
  • Q3. Given a linked list with 2 parameters m,n. Now start reversing the m nodes and leave n nodes and continue it till u reach the end
  • Ans. 

    Reverse m nodes and leave n nodes in a linked list till the end.

    • Traverse the linked list till m nodes and reverse them

    • Traverse n nodes and continue reversing m nodes

    • Repeat the above step till the end of the linked list

    • Handle edge cases like m or n being greater than the length of the linked list

  • Answered by AI
  • Q4. Inorder Traversal of a tree
  • Ans. 

    Inorder traversal is a way of visiting all nodes in a binary tree by visiting the left subtree, then the root, and then the right subtree.

    • Start at the root node

    • Traverse the left subtree recursively

    • Visit the root node

    • Traverse the right subtree recursively

    • Repeat until all nodes have been visited

  • Answered by AI
  • Q5. Inorder Travesal of a tree without recursion(write the code)
  • Ans. 

    Inorder traversal of a tree without recursion

    • Create an empty stack and initialize current node as root

    • Push the current node to stack and set current = current.left until current is NULL

    • If current is NULL and stack is not empty, pop the top item from stack, print it and set current = popped_item.right

    • Repeat step 2 and 3 until stack is empty

  • Answered by AI
  • Q6. Given an array of numbers in which duplicates are there and one triplicate is there. find that number
  • Ans. 

    Find the triplicate number in an array of duplicates.

    • Iterate through the array and keep track of the frequency of each number.

    • Return the number that appears three times.

    • If no number appears three times, return null.

  • Answered by AI
  • Q7. Explain all the serach algorithm you know with space and Time complexities
  • Ans. 

    Explanation of search algorithms with their space and time complexities.

    • Linear Search - O(n) time complexity, O(1) space complexity

    • Binary Search - O(log n) time complexity, O(1) space complexity

    • Jump Search - O(√n) time complexity, O(1) space complexity

    • Interpolation Search - O(log log n) time complexity, O(1) space complexity

    • Exponential Search - O(log n) time complexity, O(1) space complexity

    • Fibonacci Search - O(log n)

  • Answered by AI
  • Q8. Given a situation and asks you which search algorithm suits the best in that situation
  • Q9. Given an array of length n and in which numbers from 1-n will be there and each number can repeat any number of times find out which repeated more number of times
  • Ans. 

    Find the most repeated number in an array of length n with numbers 1-n.

    • Create a dictionary to store the count of each number in the array

    • Iterate through the array and update the count in the dictionary

    • Find the key with the highest count in the dictionary

  • Answered by AI

Interview Preparation Tips

Round: Resume Shortlist
Experience: Basically, it's not resume shortlist, it's a 9 pointer shortlist

Round: Test
Experience: The Entire Test is held in HackerRank Platform. it has
2 coding questions (one easy and one medium)
2 output questions(medium)
2 Aptitude(easy)
1 general Computer science(medium)
it took me 30 min for each coding questions.I was not known that general question is related to bash commands.
Tips: Practice the Warmup questions in Hacker Rank.
Do some Basic aptitude questions.
Thorough with the basic c and c++ concepts
Duration: 120 minutes
Total Questions: 7

Round: Technical Interview
Experience: It's completely around the data structures. The questions are a bit tricky but once u think without any tension u can get through easily. The interviewer is helpful and gives u few hints if u catch them at the right point of time u got it.There are 2 more questions which I haven't mentioned.
Tips: got through Data Structures and Algorithms Made Easy by Narasimha Karumanchi. It's a best book for the interviews.

Round: Technical Interview
Experience: The interviewer asked to put everything on the blackboard and write down the code of each and everything.
Tips: Go to the website -----/ and study all the interview questions and modules

Round: HR Interview
Experience: It's Technical+ HR interview all the technical questions went around resume. it went around 45 minutes they are very particular about what you wrote in the resume.HR questions are general like
whats your future plans
where will u see yourself in the office after 5 years?
Tips: please make sure that whatever you write in resume should be known to you very well.Don't write false things about yourself.And make sure you know completely about the projects you are going to write in resume(atleast the part you worked)

General Tips: Be sure of what you are saying. Don't be tensed and answer to your best.
Skills: Programming, Data Structures
College Name: VIT VELLORE

Skills evaluated in this interview

I appeared for an interview before Dec 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Easy

Myntra had conducted a coding test on campus before the start of the placement season with 2 questions, one on stack and other on DP.
Tips : For the test, the DP question asked was pretty standard, on Longest Common Subsequence. The question on stacks, I don't remember what it was but it was also pretty straight forward. For the test, I would recommend to solve problem from GFG. If they do come to resume shortlisting, they are looking for people who have done good projects and internships.

  • Q1. 

    Longest Common Subsequence Problem Statement

    Given two strings STR1 and STR2, determine the length of their longest common subsequence.

    A subsequence is a sequence that can be derived from another sequen...

  • Ans. 

    The task is to find the length of the longest common subsequence between two given strings.

    • Implement a function to find the longest common subsequence between two strings.

    • Use dynamic programming to solve this problem efficiently.

    • Iterate through the strings and build a matrix to store the lengths of common subsequences.

    • Return the length of the longest common subsequence found.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

The interview started off with questions on my general interest in Software Development. The first round had two coding questions, I was supposed to write the code on paper. 
For the questions, they asked me to code the solution first. And then gave a specific input and asked me to demonstrate step by step in my code, how it would lead to the correct answer.
Tips: It's ok if you can't code a general solution, if you can write a code which works for the particular input they have given then also it's ok with them. But be thorough with Data structures.

  • Q1. 

    Add Two Numbers as Linked Lists

    You are given two singly linked lists, where each list represents a positive number without any leading zeros.

    Your task is to add these two numbers and return the sum as ...

  • Ans. 

    Add two numbers represented as linked lists and return the sum as a linked list.

    • Traverse both linked lists simultaneously while keeping track of carry from previous sum

    • Create a new linked list to store the sum, updating the value and carry as needed

    • Handle cases where one linked list is longer than the other by adding remaining digits with carry

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

I wasn't asked to write any code in this interview. They asked me some questions on Machine Learning, because of my projects in them. Then they asked me if I knew graph algorithms. Since I knew BFS and DFS, I told them. They asked the difference between the two. Then they asked me if I knew how to find the shortest distance between two points in a graph. I didn't know Dijkstra's properly but I knew it worked on the greedy approach so was able to tell that. Then they asked me how would I find the second shortest path. I tried to answer it with the same greedy approach, but couldn't arrive at the complete solution.
Tips: They ask a tough theoretical question. It's ok if you don't know the answer, they only look for your approach.

  • 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 in a disconnected graph starting from vertex 0.

    • Use a queue to keep track of nodes to visit next in BFS traversal

    • Start traversal from vertex 0 and explore its neighbors first

    • Continue exploring neighbors level by level until all nodes are visited

    • Ensure to print connected nodes in numerical sort order

  • 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 to find connected components in an undirected and disconnected graph.

    • Perform DFS traversal on each vertex to find connected components

    • Maintain a visited array to keep track of visited vertices

    • Print the vertices of each connected component in ascending order

  • Answered by AI
  • Q3. 

    Dijkstra's Shortest Path Problem

    Given an undirected graph with ‘V’ vertices (labeled 0, 1, ... , V-1) and ‘E’ edges, where each edge has a weight representing the distance between two connected nodes (X,...

  • Ans. 

    Dijkstra's algorithm is used to find the shortest path from a source node to all other nodes in a graph with weighted edges.

    • Implement Dijkstra's algorithm to find the shortest path distances from the source node to all other nodes in the graph.

    • Use a priority queue to efficiently select the next node with the shortest distance.

    • Update the distances of neighboring nodes based on the current node's distance and edge weight...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPA, Eligible branches : Computer Science & Engineering, Mathematics & Computing, Electrical Engineering and Electronics & Communication Engineering.Myntra 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 : Be thorough with Data Structures and Algorithms and also with your resume.
Tip 2 : Must do Previously asked Interview as well as Online Test Questions.
Tip 3 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 4 : 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

I appeared for an interview before Jan 2016.

Interview Preparation Tips

College Name: Thapar University, Patiala

I appeared for an interview before Dec 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 minutes
Round difficulty - Medium

This was a 2 hour round consisting of 5 mcqs and 2 codes. The mcqs were pretty much simple based on DS, DBMS, OS, OOP, and C.

  • Q1. 

    Rabbit Jumping Problem

    Consider 'n' carrots numbered from 1 to 'n' and 'k' rabbits. Each rabbit jumps to carrots only at multiples of its respective jumping factor Aj (i.e., Aj, 2Aj, 3Aj, ...), for all ra...

  • Ans. 

    Calculate uneaten carrots by rabbits with specific jumping factors.

    • Iterate through each carrot and check if any rabbit jumps on it.

    • Use the jumping factors to determine which carrots are eaten.

    • Subtract the eaten carrots from the total to get the uneaten count.

  • Answered by AI
  • Q2. 

    Flip Bits Problem Explanation

    Given an array of integers ARR of size N, consisting of 0s and 1s, you need to select a sub-array and flip its bits. Your task is to return the maximum count of 1s that can b...

  • Ans. 

    Given an array of 0s and 1s, find the maximum count of 1s by flipping a sub-array at most once.

    • Iterate through the array and keep track of the maximum count of 1s obtained by flipping a sub-array.

    • Consider flipping a sub-array from index i to j by changing 0s to 1s and vice versa.

    • Update the maximum count of 1s if the current count after flipping is greater.

    • Return the maximum count of 1s obtained by flipping a sub-array

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Started with a brief discussion on my projects and internships. A thorough discussion on whichever languages, frameworks I had used in my projects. Followed by discussion on coding questions. Apart from the codes there were some questions on OS, process stack, heap memory in Java, Garbage collection, OOP principles and comparison based sorting

  • Q1. 

    Sum of Maximum and Minimum Elements Problem Statement

    Given an array ARR of size N, your objective is to determine the sum of the largest and smallest elements within the array.

    Follow Up:

    Can you achie...

  • Ans. 

    Find sum of maximum and minimum elements in an array with least number of comparisons.

    • Iterate through the array and compare each element with current maximum and minimum to update them.

    • Initialize max as smallest possible value and min as largest possible value.

    • Return the sum of max and min after iterating through the array.

  • Answered by AI
  • Q2. 

    Invert a Binary Tree Problem Statement

    Given a Binary Tree and one of its leaf nodes, invert the binary tree by following these guidelines:

    • The given leaf node becomes the root after the inversion. • F...
  • Ans. 

    Invert a binary tree based on a given leaf node as the root.

    • Start by finding the leaf node in the binary tree.

    • Move the left child of the leaf node to the right side of the leaf node.

    • Make the parent of the leaf node the left child of the leaf node.

    • Repeat the process for each test case.

    • Return the inverted binary tree in level order format.

  • Answered by AI
Round 3 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Questions based on programming, DBMS and puzzles were asked in this round.

  • Q1. 

    Rearrange Array to Form Largest Number

    Given an array ARR consisting of non-negative integers, rearrange the numbers to form the largest possible number. The digits within each number cannot be changed.

    ...

  • Ans. 

    Rearrange the array elements to form the largest possible number by concatenating them.

    • Sort the array elements in a custom way where the concatenation of two numbers results in a larger number.

    • Use a custom comparator function while sorting the array elements.

    • Convert the sorted array elements to a single string to get the largest possible number.

  • Answered by AI
  • Q2. What is indexing in the context of databases?
  • Ans. 

    Indexing in databases is a technique used to improve the speed of data retrieval by creating a data structure that allows for quick lookups.

    • Indexes are created on columns in a database table to speed up the retrieval of rows that match a certain condition.

    • They work similar to the index in a book, allowing the database to quickly find the relevant data without having to scan the entire table.

    • Examples of indexes include ...

  • Answered by AI
  • Q3. What are the advantages of B+ Trees in database management systems?
  • Ans. 

    B+ Trees are advantageous in database management systems due to their ability to efficiently store and retrieve data.

    • B+ Trees have a high fanout, allowing for more keys to be stored in each node, reducing the height of the tree and improving search performance.

    • B+ Trees are balanced trees, ensuring that operations like search, insertion, and deletion have a predictable time complexity of O(log n).

    • B+ Trees are optimized ...

  • Answered by AI
Round 4 - Video Call 

Round duration - 45 minutes
Round difficulty - Medium

Puzzles and HR based questions were asked in this round.
He asked questions like : what are my career goals, what do you look forward to in a boss , how do you see yourself in 5 years ,etc etc .

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMyntra 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 : 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 interviewRejected

Skills evaluated in this interview

Quikr Interview FAQs

What are the top questions asked in Quikr Software Developer interview?

Some of the top questions asked at the Quikr Software Developer interview -

  1. If there is a website run by 2 servers. These 2 servers balances the load using...read more
  2. Find the first non repetitive character in a stri...read more
  3. How to write a Connection class to MySQL database using P...read more

Tell us how to improve this page.

Quikr Software Developer Salary
based on 14 salaries
₹5 L/yr - ₹16.5 L/yr
17% more than the average Software Developer Salary in India
View more details
Key Account Manager
258 salaries
unlock blur

₹2.4 L/yr - ₹6 L/yr

Senior Executive
89 salaries
unlock blur

₹2.2 L/yr - ₹5.5 L/yr

Assistant Manager
85 salaries
unlock blur

₹3.6 L/yr - ₹11.7 L/yr

Senior Key Account Manager
81 salaries
unlock blur

₹3.2 L/yr - ₹6.9 L/yr

Sales Manager
71 salaries
unlock blur

₹4.3 L/yr - ₹10.8 L/yr

Explore more salaries
Compare Quikr with

OLX

3.8
Compare

Udaan

4.0
Compare

Swiggy

3.8
Compare

BlackBuck

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