Flipkart Software Developer Intern Interview Questions and Answers

Round duration - 75 minutes
Round difficulty - Hard

Round was scheduled in the evening within a window of two hours.

Q1. 
Reverse Linked List Problem Statement
Given a singly linked list of integers, return the head of the reversed linked list.
Example:
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...read more
Ans. 
Reverse a singly linked list of integers and return the head of the reversed linked list.
• Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.

• Use three pointers to keep track of the current, previous, and next nodes while reversing the linked list.

• Update the head of the reversed linked list as the last node encountered during the reversal process.
Answered by AI
Add your answer
Q2. 
Minimum Steps for a Knight to Reach Target
Given a square chessboard of size 'N x N', determine the minimum number of moves a Knight requires to reach a specified target position from its initial position...read more
Ans. 
Calculate minimum steps for a Knight to reach target position on a chessboard.
• Use BFS algorithm to find shortest path from Knight's starting position to target position.

• Consider all possible moves of the Knight on the chessboard.

• Keep track of visited positions to avoid revisiting them.

• Return the minimum number of moves required to reach the target position.
Answered by AI
Add your answer

Round duration - 65 minutes
Round difficulty - Medium

This online assessment comprised of 12 questions with 2 coding questions and 10 MCQs.
Coding Questions:
It was one of the most common Dynamic Programming problems: Longest decreasing sub-sequence.
It was an easy question that needed us to find out the mean, median and mode in an array.

Q1. 
Longest Decreasing Subsequence Problem Statement
Given an array/list of integers ARR consisting of N integers, your task is to determine the length of the longest decreasing subsequence.
Explanation:
A ...read more
Ans. 
Find the length of the longest decreasing subsequence in an array of integers.
• Use dynamic programming to keep track of the length of the longest decreasing subsequence ending at each index.

• Initialize an array to store the length of the longest decreasing subsequence for each element.

• Iterate through the array and update the length of the longest decreasing subsequence for each element based on previous elements.

• Return t...read more
Answered by AI
Add your answer
Q2. 
Remove All The Palindromes Problem Statement
Given a string STR consisting only of lowercase letters, your task is to modify the string by replacing the minimum characters such that the string doesn’t con...read more
Ans. 
The task is to modify a string by replacing minimum characters to remove all palindromic substrings.
• Identify palindromic substrings in the given string

• Replace characters in the substrings to break the palindrome

• Count the minimum number of characters replaced to remove all palindromic substrings
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

There was only one interviewer, I was asked one coding question followed by one puzzle.

Q1. 
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 2D array to store the number of ways to make change for each value up to the specified value.

• Iterate through each denomination and update the array accordingly.

• The final answer will be stored in the last cell of the array.

• Example: For N=3, D=[1, 2...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Hard

This round was held on Hackerearth and had 2 questions of Medium-Hard difficulty. Both were based on concepts of DP.
The use of offline IDE was prohibited so we were supposed to code it on Hackerearth IDE itself. I was able to code the second problem well with only 3 Test Cases failing but was stuck on the first problem for quite a long time and wasn't able to pass all the major Test Cases .

Q1. 
Binary Tree Cameras Problem Statement
Given a binary tree where each node can carry a camera that monitors its parent, itself, and its immediate children, determine the minimum number of cameras needed to...read more
Ans. 
The problem involves determining the minimum number of cameras needed to monitor all nodes in a binary tree.
• Implement a function to solve the problem efficiently.

• Consider the different cases where cameras can be placed to cover all nodes.

• Use recursion to traverse the tree and place cameras strategically.

• Optimize the solution to minimize the number of cameras needed.

• Test the function with different test cases to ensure ...read more
Answered by AI
Add your answer
Q2. 
Longest Palindromic Substring Problem Statement
You are provided with a string STR of length N. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind...read more
Ans. 
Given a string, find the longest palindromic substring with the smallest start index.
• Iterate through the string and expand around each character to find palindromes

• Keep track of the longest palindrome found and its starting index

• Return the longest palindromic substring with the smallest start index
Answered by AI
Add your answer