i
Flipkart
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Code to check if a tree is BST or not
Check if left subtree is BST
Check if right subtree is BST
Check if max value in left subtree is less than root
Check if min value in right subtree is greater than root
Modify code to find maximum BST subtree and maximum BST tree in a given tree.
Create a function to check if a given tree is a BST
Traverse the tree and check if each subtree is a BST
Keep track of the maximum BST subtree found so far
To find maximum BST tree, check if each node can be the root of a BST
Keep track of the maximum BST tree found so far
Algorithm to determine valid variables on a given line of code.
Create a stack to keep track of variable declarations
Traverse the code line by line
When encountering a variable declaration, push it onto the stack
When encountering a closing brace, pop all variables declared within that scope
Return all variables still on the stack when reaching the given line number
Implement LRU cache with put, get, and remove operations.
LRU stands for Least Recently Used.
The cache should have a maximum capacity.
When the cache is full, the least recently used item should be removed.
When an item is accessed, it should be moved to the front of the cache.
Use a doubly linked list and a hash map to implement the cache efficiently.
next_permutation function generates the next greater lexicographic permutation of a sequence
The function modifies the sequence to its next permutation if possible
If the sequence is already the largest permutation, it rearranges it to the smallest permutation
The function returns true if a next permutation exists, else false
The sequence must be sorted in non-descending order before calling the function
Given n sequences with start, stop and score, find maximum subset of non-overlapping sequences with maximum total score.
Sort the sequences by their end points.
Use dynamic programming to find the maximum sum of non-overlapping sequences.
Keep track of the previous non-overlapping sequence with maximum sum.
Return the maximum sum and the corresponding non-overlapping sequences.
I applied via Referral and was interviewed in Oct 2024. There were 2 interview rounds.
Dp question of jump game
I was asked to design a stack where push and pop operations are done at every version in O(1)
I was interviewed in Sep 2024.
A coding question on qraphs
Flipkart interview questions for designations
Design an airline service for booking flights and managing reservations.
Create a user-friendly website or mobile app for customers to search and book flights.
Implement a secure payment system for online bookings.
Develop a system for managing flight schedules, seat availability, and reservations.
Include features for customers to check-in online, select seats, and view flight status.
Offer loyalty programs and discounts f
Get interview-ready with Top Flipkart Interview Questions
Dsa was asked, focus on Binary Search
I applied via Company Website and was interviewed in Mar 2024. There was 1 interview round.
I applied via Naukri.com and was interviewed in Jan 2024. There were 2 interview rounds.
Cleared this round. It was easy
To reverse a doubly linked list, swap the next and previous pointers of each node.
Start from the head of the list
Swap the next and previous pointers of each node
Update the head and tail pointers accordingly
I applied via Company Website and was interviewed in Jan 2024. There were 3 interview rounds.
Programming language
Arithematic logic questions
Programming topic any one topic
Hard problems, with limited time
I applied via campus placement at Indian Institute of Technology (IIT), Guwahati and was interviewed before Nov 2023. There were 3 interview rounds.
It was a typical coding assessment with 3 questions, Med to hard level questions.
Implement a tree data structure and perform a medium to hard level operation on it.
Create a Node class with left and right pointers
Implement methods for insertion, deletion, and traversal
Solve a specific problem like finding the lowest common ancestor
Top trending discussions
Some of the top questions asked at the Flipkart Software Developer interview -
The duration of Flipkart Software Developer interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 15 interviews
4 Interview rounds
based on 30 reviews
Rating in categories
Senior Executive
2.7k
salaries
| ₹1.8 L/yr - ₹9 L/yr |
Team Lead
1.9k
salaries
| ₹1.2 L/yr - ₹9.9 L/yr |
Operations Executive
1.8k
salaries
| ₹1.2 L/yr - ₹6.3 L/yr |
Assistant Manager
1.6k
salaries
| ₹6 L/yr - ₹20.4 L/yr |
Executive
1.3k
salaries
| ₹1.2 L/yr - ₹7 L/yr |
Amazon
Myntra
Snapdeal
Meesho