Flipkart Software Development Engineer 1 Interview Questions and Answers

Q1. 3 Similar to leetcode problems: Difficulty level hard
Add your answer
Q2. Explain the code that you wrote in detail.
Ans. 
The code I wrote is a function that sorts an array of integers in ascending order using bubble sort algorithm.
• The code starts by iterating through the array and comparing adjacent elements, swapping them if they are in the wrong order.

• This process is repeated until no more swaps are needed, indicating that the array is sorted.

• The time complexity of bubble sort is O(n^2) in the worst case scenario.

• Example: int[] arr = {
Answered by AI
Add your answer

There is two question :
One from Sliding window : medium
Another from Graph same as leetcode island problem : medium
Solved both within time limit

Q1. First Question is on binary tree finding ancestor
Add your answer
Q2. Second one is DP finding max sum
Add your answer

Q1. General Question: Introduction, some verbal question about project
Add your answer

Duration was 1 hour with Graph problem medium level.

Platform - HackerRank
Duration - 2 hrs
Question Types - 2 coding question and some behavioural question
first question was related to hashing concept and 2nd was related to BFS concept and 1 more thing that you have to also explain your approach and time complexity of your code that you have written.

Q1. Round-2 :- the interview was taken by a SDE-2 and 2 questions were asked 1 was binary search question and 2nd one was on priority queue concept. Time :- 1Hr
Add your answer

Q1. Round 3:- Same as 2nd round 2 questions 1 was from two pointer concept and 2nd was a tricky sorting question.
Add your answer

Q1. Round-4 :- 2 questions were asked 1 was related to trie data structure and 2nd was related to matrix manipulation.
Add your answer

Q1. Round-5 :- 1 coding question and it was leetcode hard problem related to variable size sliding window concept and some behavioural question related to my project that I have done in my College.
Add your answer

Medium hard questions with mcq.

Q1. MAX intersections in a range of time.
Ans. 
Find maximum number of intersections in a given time range.
• Consider all the intervals and their start and end times.

• Sort the intervals based on their start times.

• Use a priority queue to keep track of the intervals that are currently active.

• Update the maximum number of intersections whenever a new interval is added or removed from the priority queue.
Answered by AI
Add your answer

Q1. Median in stream of Numbers.
Ans. 
Finding the median of a stream of numbers.
• Maintain two heaps, one for smaller half and one for larger half of the stream.

• If the heaps are of equal size, median is the average of the top elements of both heaps.

• If the heaps are of different sizes, median is the top element of the larger heap.

• Add new elements to the appropriate heap and balance the heaps accordingly.
Answered by AI
Add your answer

Q1. Computer science basics in OOP, OS, Networks.
Add your answer

Q1. Design LRU cache, project discussion.
Add your answer