Flipkart Software Development Engineer Intern Interview Questions and Answers

2 mid level questions on ds

Q1. System design on my done projects.
Ans. 
Designed a system for a project involving real-time data processing and analysis.
• Utilized microservices architecture for scalability and flexibility

• Implemented message queues for asynchronous communication between components

• Used a combination of relational and NoSQL databases for different data storage needs
Answered by AI
Add your answer
Q2. What pattern have you followed while building modules.
Ans. 
I have followed the modular design pattern while building modules.
• I break down the software into smaller, independent modules that can be easily managed and maintained.

• I ensure each module has a clear purpose and well-defined interfaces for communication with other modules.

• I use techniques like encapsulation, abstraction, and separation of concerns to create modular designs.

• Example: Using the MVC (Model-View-Controller...read more
Answered by AI
Add your answer

Q1. Questions on team work.
Add your answer

Q1. Sum of right leaf nodes, swap nodes in k groups
Ans. 
The question involves finding the sum of right leaf nodes and swapping nodes in groups of k.
• The sum of right leaf nodes can be found by traversing the tree and checking if a node is a right leaf node.

• Swapping nodes in groups of k can be done by iterating through the linked list and swapping the nodes in each group.

• Examples: For the sum of right leaf nodes, consider a binary tree with nodes 1, 2, 3, 4, 5. The sum would ...read more
Answered by AI
Add your answer

Q1. Combinatorics, find pivot in rotated array, standard hr questions
Add your answer

Medium Level DSA problems were asked

Q1. Medium Level DSA based on Hashing
Add your answer
Q2. Binary Tree medium level problem
Ans. 
The question involves solving a medium level problem related to binary trees.
• Understand the basic concepts of binary trees such as nodes, edges, and traversal methods.

• Practice implementing common operations on binary trees like insertion, deletion, and searching.

• Consider using recursion to solve problems involving binary trees.

• An example of a medium level problem could be finding the lowest common ancestor of two nodes
Answered by AI
Add your answer

Q1. Reverse nodes in k groups, sum of right leaf nodes
Ans. 
The question involves reversing nodes in groups of k and finding the sum of right leaf nodes.
• Implement a function to reverse nodes in groups of k

• Traverse the reversed linked list and find the sum of right leaf nodes

• Handle edge cases like when the number of nodes is not a multiple of k
Answered by AI
Add your answer

Q1. Combinatorics, find pivot in rotated sorted array, count sort
Ans. 
The question involves finding the pivot in a rotated sorted array using combinatorics and count sort.
• To find the pivot in a rotated sorted array, we can use a modified binary search algorithm.

• First, we compare the middle element with the first element to determine if the pivot is in the left or right half.

• Then, we continue dividing the array in half and adjusting the search range based on the pivot's location.

• Count sor...read more
Answered by AI
Add your answer

2 medium leetcode questions were asked. Overall it was an easy round.

It was an aptitude test. Read up on the Leadership principles and be ready to sit in one place for 2 hours.

Q1. LC: to delete the nth node in a linked list.
Ans. 
Delete the nth node in a linked list.
• Traverse the linked list to find the nth node and keep track of the previous node.

• Update the previous node's next pointer to skip the nth node.

• Free the memory allocated to the nth node.
Answered by AI
Add your answer
Q2. Aptitude situational questions were asked reply in star format
Add your answer

Very good question and answers easy leetcode question

Q1. Tree based leetcode hard question
Add your answer
Q2. Linked list question
Add your answer

2 Medium difficulty level questions + situation-based questions on Amazon leadership principles are asked.

Q1. 1 Medium-level DSA Question based on the linked list and pointers to copy source list to destination list.
Add your answer
Q2. Questions asked on Previous internships and Amazon leadership principles
Add your answer

Q1. Print boundary nodes of a tree
Ans. 
Print the boundary nodes of a tree.
• Boundary nodes are the leftmost and rightmost nodes of each level of the tree and the leaf nodes that are not part of the subtree.

• Traverse the tree in a clockwise direction and print the nodes as you encounter them.

• Use recursion to traverse the tree and keep track of the level and whether the node is a left or right boundary node.
Answered by AI
Add your answer
Q2. What are hamming distance and hamming weights? Write code to calculate hamming distance between 2 numbers.
Ans. 
Hamming distance is the number of differing bits between two binary strings. Hamming weight is the number of 1s in a binary string.
• Hamming distance is used in error detection and correction codes.

• Hamming weight is also known as population count or popcount.

• To calculate hamming distance, XOR two numbers and count the number of 1s in the result.

• Example: Hamming distance between 1010 and 1110 is 1.

• Example: Hamming weight
Answered by AI
Add your answer
Q3. What data structure do you know? Advantages and disadvantages of singly and doubly linked lists
Ans. 
Singly and doubly linked lists are linear data structures used to store and manipulate data.
• Singly linked lists use less memory than doubly linked lists

• Doubly linked lists allow for traversal in both directions

• Singly linked lists are faster for insertion and deletion at the beginning of the list

• Doubly linked lists are faster for insertion and deletion in the middle of the list

• Both have O(n) time complexity for searchin
Answered by AI
Add your answer
Q4. List some sorting algorithms. Why time complexity of merge sort is O(nlogn)
Ans. 
Sorting algorithms include bubble sort, insertion sort, selection sort, quick sort, merge sort, etc. Merge sort has O(nlogn) time complexity.
• Sorting algorithms are used to arrange data in a specific order.

• Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts each half, and then merges the sorted halves.

• The time complexity of merge sort is O(nlogn) because it divides the input ...read more
Answered by AI
Add your answer
Q5. Questions asked on projects
Add your answer

It was a mix of the following:
Short debugging-type questions from DSA.
2 DSA problems medium level

Q1. Technical Interview around 1.5 hrs
Add your answer
Q2. One was a variation of merging intervals.
Add your answer
Q3. Subtree sum problem based on tree topic.
Add your answer