Quikr Software Developer Intern Interview Questions and Answers

Easy to medium level of leet code

Q1. 1. Fibonacci series with recursion and without recursion 2. String Palindrome 3. Count all repeated numbers from the array
Ans. 
Answering questions related to Fibonacci series, string palindrome, and counting repeated numbers in an array.
• For Fibonacci series with recursion, write a function that calls itself to calculate the next number in the series.

• For Fibonacci series without recursion, use a loop to calculate the series.

• For string palindrome, compare characters from start and end of the string.

• To count all repeated numbers from the array, u
Answered by AI
View 2 more answers

Q1. 1.Given an array(0-based indexing), you have to find the max sum of i*A[i] where A[i] is the element at index i in the array. The only operation allowed is to rotate(clock-wise or counter clock-wise) the ...read more
Ans. 
Rotate array to find max sum of i*A[i]
• Rotate array to bring maximum element to front

• Calculate sum of i*A[i] for each rotation

• Keep track of maximum sum found
Answered by AI
Add your answer

Q1. 1.Oops concepts 2.Oops code 2.About Java Spring 3. Array stack questions 4.Project discussion
Add your answer

3 question of basic and 3 mcq

Strings,Sort 0 1 2,invert binary tree

Q1. Project Basics and Technical skills
Add your answer
Q2. Your Daily routine
Ans. 
My daily routine involves coding, debugging, attending meetings, and learning new technologies.
• Start the day by checking emails and prioritizing tasks

• Code and debug new features or fix existing issues

• Attend team meetings to discuss progress and roadblocks

• Spend time learning new technologies or improving coding skills

• Collaborate with team members on projects
Answered by AI
Add your answer

Q1. It was based on dynamic programming
Add your answer

Was asked to build a REST API for inventory management of a store using Django REST framework.

Q1. Had a discussion regarding my project and resume with the founder, he paid attention to detail and was polite and supportive.
Add your answer

Round duration - 90 Minutes
Round difficulty - Hard

Test Description/Instruction as Mentioned on the portal and mail :

1) The test will consist of 3 algorithmic problems.
2) The test time is 1.5 hours in which you will need to solve the 3 problems. The test link will be active from 10:00 AM onwards.
3) Please do not change the tabs since all the actions will be recorded and logged.

Q1. 
Flood Fill Algorithm Task
Assist Ninja in altering the color of a specific region in his photo. Given the image as a 2D array where each pixel is a positive integer, update the color of a specified pixel ...read more
Ans. 
The Flood Fill Algorithm is used to change the color of a particular region in an image and all its adjacent same-colored pixels.
• The image is represented as a 2D array of positive integers

• The starting pixel and new color are given

• Adjacent pixels are connected in up, down, left, or right directions

• Diagonal pixels are not considered adjacent

• Implement the Flood Fill Algorithm to replace the color of the given pixel and it...read more
Answered by AI
View 1 more answer
Q2. 
Kruskal’s Minimum Spanning Tree Algorithm Problem Statement
You are given a connected undirected weighted graph. Your task is to determine the weight of the minimum spanning tree of this graph.
A minimum...read more
Ans. 
The task is to find the weight of the minimum spanning tree of a given connected undirected weighted graph.
• Implement Kruskal's algorithm to find the minimum spanning tree

• Use a disjoint set data structure to keep track of connected components

• Sort the edges in non-decreasing order of their weights

• Iterate through the sorted edges and add them to the minimum spanning tree if they don't create a cycle

• Return the sum of weigh
Answered by AI
Add your answer
Q3. 
Merge Sort Problem Statement
You are given a sequence of numbers, ARR. Your task is to return a sorted sequence of ARR in non-descending order using the Merge Sort algorithm.
Explanation:
The Merge Sort...read more
Ans. 
The task is to implement the merge sort algorithm to sort a given sequence of numbers in non-descending order.
• Merge sort is a divide and conquer algorithm that recursively divides the input array into two halves until the size becomes 1.

• Then it merges the two sorted halves to produce a single sorted array.

• The time complexity of merge sort is O(n log n), where n is the size of the input array.

• The algorithm is efficient ...read more
Answered by AI
Add your answer

Round duration - 24 hours
Round difficulty - Medium

Round duration - 120 Minutes
Round difficulty - Medium

It was a Data Structures and Algorithm Round and Discussion on My assignment round to check my Problem Solving Skills.
And the Interviewer was very friendly to me. I first introduced myself to the interviewer and what did I have done in past as a Software Engineer and Why I want to work in Grofers.
 

Q1. 
Top View of Binary Tree
Given a binary tree of integers, the task is to return the top view of the given binary tree. The top view of the binary tree is the set of nodes visible when viewed from the top.
...read more
Ans. Using Pre-Order Traversal
As we know that all three traversals, i.e. pre-order, in-order and post-order, visit the tree node at once. We can use any of them. Here we are going to use pre-order traversal for the explanation. So while traversing in the pre-order traversal, we will keep track of horizontal distance of the node which is going to be visited from the root node, and we also keep track of the vertical level of ...read more
Answered Anonymously
Add your answer
Q2. 
Maximum Possible Time Problem Statement
Given an array ARR consisting of exactly four integer digits, your task is to form the maximum possible valid time in a 24-hour format using those digits.
Explanat...read more
Ans. Maximum Possible Time
Approach:
• The basic idea is that we will iterate over all the permutations of the 4 digits and check whether we are able to form a valid 24 Hr format time. If so we will then also find the maximum possible time.
• Here we will use the ‘NEXT_PERMUTATION’ method to find all the permutations.
 
Algorithm:
• There are two conditions for valid 24 Hr format time:
  • The first two digits i.e the hour should be le...read more
Answered Anonymously
Add your answer