10+ Flipkart Software Developer Intern Interview Questions and Answers

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 the maximum length of the longest decreasing subsequence fo...read more

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

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

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.

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.

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

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, 3], V=4, the output is 4 as there are 4 ways to make cha...read more

Use a two-pass approach to mark rows and columns with zeros based on existing zeros in the matrix.

• Iterate through the matrix to mark rows and columns with zeros based on existing zeros

• Use two arrays to keep track of which rows and columns need to be zeroed out

• Perform a second pass to update the matrix based on the marked rows and columns

A parking lot app designed for blind people to easily navigate and find available parking spots.

• Include voice-guided navigation to direct users to available parking spots

• Use sensors to detect empty parking spaces and relay information to the app

• Provide audio alerts for obstacles or other vehicles in the parking lot

• Include a feature for users to easily locate their parked vehicle when returning