Flipkart Software Engineer Interview Questions and Answers

Round duration - 90 minutes
Round difficulty - Medium

The online round was conducted on Hackerearth around 11:30 PM 
This round was an online coding plus MCQ round which includes 15 MCQ with positive 4 and negative 1 and 3 coding questions with two questions 10 marks and one was of 20 marks . MCQ were easy to medium and covers all the topic of Networks OOPS DBMS and CPP/JAVA 
In Coding section one 20 marks question was medium and two 10 marks were of easy level, like if you practice regularly you can crack two 10 marks means you can score 20 marks out of 40 in coding

Q1. 
Reach the Destination Problem Statement
You are given a source point (sx, sy) and a destination point (dx, dy). Determine if it is possible to reach the destination point using only the following valid mo...read more
Ans. 
The problem involves determining if it is possible to reach a destination point from a source point using specified moves.
• Iterate through each test case and check if destination is reachable from source using specified moves

• Implement a recursive function to simulate the moves and check if destination is reached

• Consider constraints to optimize the solution

• Example: For input (1, 1, 3, 5), the output should be true as des
Answered by AI
Add your answer
Q2. 
Ways To Make Coin Change
Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...read more
Ans. 
The task is to find the total number of ways to make change for a specified value using given denominations.
• Use dynamic programming to solve this problem efficiently.

• Create a 1D array to store the number of ways to make change for each value from 0 to the target value.

• Iterate through the denominations and update the array based on the current denomination.

• The final answer will be the value at the target index of the ar
Answered by AI
Add your answer
Q3. 
Min Jumps Problem Statement
In Ninja town, represented as an N * M grid, people travel by jumping over buildings in the grid's cells. Santa is starting at cell (0, 0) and must deliver gifts to cell (N-1, ...read more
Ans. 
Santa needs to find the quickest path to deliver gifts in Ninja town by jumping over buildings with least travel time.
• Santa starts at (0, 0) and needs to reach (N-1, M-1) on Christmas Eve.

• Santa can jump to (x+1, y+1), (x+1, y), or (x, y+1) from any cell (x, y).

• Travel time between two buildings equals the absolute difference in their heights.

• Find the quickest path with least travel time.

• Example: For grid [[1, 3, 5], [2,
Answered by AI
Add your answer

Round duration - 50 minutes
Round difficulty - Medium

It was a technical interview which was scheduled on 16th October 2020 at 10:00 AM 
This round mainly focus on your DSA, DBMS , OS Networking and coding skills like how optimised you can write code 
This round was conducted on Zoom 
Their were 2 interviewers and both of them were very calm and supportive

Q1. 
Pythagorean Triplets Detection
Determine if an array contains a Pythagorean triplet by checking whether there are three integers x, y, and z such that x² + y² = z² within the array.
Input:
The first lin...read more
Ans. 
Detect if an array contains a Pythagorean triplet by checking if there are three integers x, y, and z such that x^2 + y^2 = z^2.
• Iterate through all possible triplets of numbers in the array and check if they form a Pythagorean triplet.

• Use a nested loop to generate all possible combinations of three numbers from the array.

• Check if the sum of squares of two numbers is equal to the square of the third number for each trip...read more
Answered by AI
Add your answer
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 ...read more
Ans. 
Detect if a singly linked list forms a cycle by checking if a node's next pointer points back to a previous node.
• Use Floyd's Tortoise and Hare algorithm to detect a cycle in the linked list.

• Maintain two pointers, one moving at twice the speed of the other.

• If there is a cycle, the two pointers will eventually meet.

• If one of the pointers reaches the end of the list (null), there is no cycle.
Answered by AI
Add your answer

Round duration - 10 minutes
Round difficulty - Easy

This was the HR round conducted online through ZOOM on 16th October 2020 around 4:00 PM
There were two interviewers and both were quite good and frank 
This round mainly focus on basic resume questions and about yourself