i
Flipkart
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I applied via Campus Placement and was interviewed before Apr 2023. There was 1 interview round.
I applied via Approached by Company and was interviewed in Aug 2023. There was 1 interview round.
The actual rule for selling more products in this company is to focus on customer needs and provide excellent customer service.
Focus on customer needs and preferences
Provide excellent customer service
Offer promotions and discounts
Maintain high product quality
Stay up-to-date with market trends
Build strong relationships with customers
Encourage customer feedback and use it to improve
Train sales staff to be knowledgeable a
I applied via Naukri.com and was interviewed before Jun 2023. There was 1 interview round.
AI stands for Artificial Intelligence, which is the simulation of human intelligence processes by machines, especially computer systems.
AI involves the development of algorithms that can perform tasks that typically require human intelligence.
Examples of AI include speech recognition, image recognition, natural language processing, and autonomous vehicles.
AI can be categorized into narrow AI (focused on a specific task...
Machine learning is a branch of artificial intelligence that involves developing algorithms and models that can learn from and make predictions or decisions based on data.
Machine learning uses algorithms to analyze data, learn from it, and make predictions or decisions.
It is used in various fields such as healthcare, finance, marketing, and more.
Examples of machine learning applications include recommendation systems, ...
I applied via Company Website and was interviewed in Sep 2022. There were 2 interview rounds.
SAP MM is a module in SAP ERP that deals with procurement and inventory management.
SAP MM stands for Material Management
It includes functionalities such as purchasing, inventory management, and invoice verification
Projects oriented towards SAP MM can involve implementing the module in a company's ERP system, optimizing procurement processes, or improving inventory management
Examples of SAP MM projects include implement...
I was interviewed in Oct 2020.
Round duration - 90 minutes
Round difficulty - Medium
The online round was conducted on Hackerearth around 11:30 PM
This round was an online coding plus MCQ round which includes 15 MCQ with positive 4 and negative 1 and 3 coding questions with two questions 10 marks and one was of 20 marks . MCQ were easy to medium and covers all the topic of Networks OOPS DBMS and CPP/JAVA
In Coding section one 20 marks question was medium and two 10 marks were of easy level, like if you practice regularly you can crack two 10 marks means you can score 20 marks out of 40 in coding
You are given a source point (sx, sy) and a destination point (dx, dy). Determine if it is possible to reach the destination point using only the following valid mo...
The problem involves determining if it is possible to reach a destination point from a source point using specified moves.
Iterate through each test case and check if destination is reachable from source using specified moves
Implement a recursive function to simulate the moves and check if destination is reached
Consider constraints to optimize the solution
Example: For input (1, 1, 3, 5), the output should be true as des
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...
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 1D array to store the number of ways to make change for each value from 0 to the target value.
Iterate through the denominations and update the array based on the current denomination.
The final answer will be the value at the target index of the ar
In Ninja town, represented as an N * M
grid, people travel by jumping over buildings in the grid's cells. Santa is starting at cell (0, 0) and must deliver gifts to cell (N-1, ...
Santa needs to find the quickest path to deliver gifts in Ninja town by jumping over buildings with least travel time.
Santa starts at (0, 0) and needs to reach (N-1, M-1) on Christmas Eve.
Santa can jump to (x+1, y+1), (x+1, y), or (x, y+1) from any cell (x, y).
Travel time between two buildings equals the absolute difference in their heights.
Find the quickest path with least travel time.
Example: For grid [[1, 3, 5], [2,
Round duration - 50 minutes
Round difficulty - Medium
It was a technical interview which was scheduled on 16th October 2020 at 10:00 AM
This round mainly focus on your DSA, DBMS , OS Networking and coding skills like how optimised you can write code
This round was conducted on Zoom
Their were 2 interviewers and both of them were very calm and supportive
Determine if an array contains a Pythagorean triplet by checking whether there are three integers x, y, and z such that x2 + y2 = z2 within the array.
The first lin...
Detect if an array contains a Pythagorean triplet by checking if there are three integers x, y, and z such that x^2 + y^2 = z^2.
Iterate through all possible triplets of numbers in the array and check if they form a Pythagorean triplet.
Use a nested loop to generate all possible combinations of three numbers from the array.
Check if the sum of squares of two numbers is equal to the square of the third number for each trip...
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next
points back to a previous node in the ...
Detect if a singly linked list forms a cycle by checking if a node's next pointer points back to a previous node.
Use Floyd's Tortoise and Hare algorithm to detect a cycle in the linked list.
Maintain two pointers, one moving at twice the speed of the other.
If there is a cycle, the two pointers will eventually meet.
If one of the pointers reaches the end of the list (null), there is no cycle.
Round duration - 10 minutes
Round difficulty - Easy
This was the HR round conducted online through ZOOM on 16th October 2020 around 4:00 PM
There were two interviewers and both were quite good and frank
This round mainly focus on basic resume questions and about yourself
Tip 1 : Practice DSA and have a proper grasp on that as cramming wont help you because the questioned asked are different and you might get confused and rather you wont be able to answer at all
Tip 2 : When you are preparing for the company be it off campus or on-campus always go through the job description and read it carefully what technologies they use because they might ask some question related to it
Tip 3 : In my views if you are starting to code then start with GFG , for me it worked you will get all level question from basic and then you can move to platforms like LEETCODE , LEETFREE
Tip 4 : Don't rush ever if you think you are not able to solve question , don't panic everyone is not able to do good but the main thing is to develop your thought process and its done by practicing more and more questions
Tip 5 : While solving don't try to look for answer at once, read the question understand it try to make a flow chart on paper and try to code it if after a long try if you are not able to solve then have a look at it and analyze where you went wrong .
Tip 6 : Always make a time table it will help you to prepare well and on time with every concept
Tip 7 : Do a minimum of 2 to 3 projects that you know well because sometimes they may ask you to run in front of them and explain it so you should be confident enough to explain
Tip 8 : While giving a interview don't ever say a no to any question just try to answer what all you know related to it and reply in positive that you know that much related to this topic and don't try to fool them as they catch mistakes easily
Tip 9 : Last but not least always keep a smile on your face and don't be nervous it will help you to show that you are confident enough and it will be interesting for both of you .
Tip 1 : It should be a one page resume for freshers
Tip 2 : Keep it crisp , don't include everything about yourself , keep those details for the interview
Tip 3 : Read the JD know about the company, its vision and the requisites for the position you are applying for and develop the resume with the things keeping in mind
Tip 4 : You should be also clear about career objective because they may ask on your career objectives in HR or Managerial Round
Tip 5 : Organize the information while writing it , have a proper heading and all the extra information using bullet points and avoid writing paragraphs
Tip 6 : Keep the resume short and simple as the recruiter don't like the long and exaggerated resumes
Tip 7 : While writing your work experiences try to write your accomplishment not your duties .
Tip 8 : Only include the projects that you know well otherwise who knows if they ask something that you know , it may give a bad impression and chances can be low
I applied via Campus Placement and was interviewed before Apr 2023. There were 2 interview rounds.
The first circular tour that visits all petrol pumps can be found using the concept of a circular linked list.
Create a circular linked list with each node representing a petrol pump
Calculate the difference between petrol available at each pump and the distance to the next pump
Start from a pump where the sum of differences is positive and traverse the circular linked list until completing the tour
Reverse a stack without using extra space
Convert Roman numerals to integers using a mapping of values for each symbol.
Create a mapping of Roman numeral symbols to their corresponding integer values.
Iterate through the input Roman numeral string from right to left.
If the current symbol's value is less than the next symbol's value, subtract it from the total. Otherwise, add it to the total.
I was interviewed before Sep 2020.
Round duration - 90 minutes
Round difficulty - Easy
This was MCQ+Coding round.
Check if two strings are anagrams by comparing the sorted versions of the strings.
Sort both strings and compare if they are equal.
Use a hashmap to store the frequency of characters in each string and compare the maps.
Ignore spaces and punctuation when comparing the strings.
Round duration - 90 minutes
Round difficulty - Easy
This was face to face interview round.
Round duration - 90 minutes
Round difficulty - Easy
This was face to face interview round.
Tip 1 : Participate in live contests on websites like Codechef, Codeforces etc as much as possible.
Tip 2 : Practice previous interview questions from LeetCode, GeeksForGeeks.
Tip 3 : Revise Computer Science subjects like DBMS, OOPS thoroughly.
Add projects and Internships if you have done any and add only those things which you really know.
Final outcome of the interviewSelectedI was interviewed before Sep 2020.
Round duration - 90 Minutes
Round difficulty - Medium
Interview started at 11:00 am. It was an online round. During the coding round I submitted optimized solution and got full acceptance of the solutions.
You are provided with a directed graph composed of 'N' nodes. You have a matrix called 'EDGES' with dimensions M x 2, which specifies the 'M' edges in the graph. Each edge...
Detect cycle in a directed graph using depth-first search (DFS) algorithm.
Use DFS to traverse the graph and detect back edges indicating a cycle.
Maintain a visited array to keep track of visited nodes during traversal.
If a node is visited again during traversal and it is not the parent node, then a cycle exists.
Return true if a cycle is detected, false otherwise.
Round duration - 80 Minutes
Round difficulty - Medium
Interview started at 10:00 am. Interview went well, I was able to connect with the interviewer and enjoyed the whole interview
Find the next smallest palindrome strictly greater than a given number 'N' represented as a string 'S'.
You are given a number in string format, a...
Find the next smallest palindrome greater than a given number represented as a string.
Convert the string to an integer, find the next greater palindrome, and convert it back to a string.
Handle cases where the number is a palindrome or has all digits as '9'.
Consider both odd and even length numbers when finding the next palindrome.
Round duration - 80 Minutes
Round difficulty - Medium
Interview started at 11:00 am. Interview went well.
Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.
The first line ...
Return the boundary nodes of a binary tree in Anti-Clockwise direction starting from the root node.
Traverse the left boundary nodes in a top-down manner
Traverse the leaf nodes from left to right
Traverse the right boundary nodes in a bottom-up manner
Handle cases where duplicates occur in the boundary nodes
Implement the function without printing as printing is already managed
Tip 1 : For Data Structures number of questions doesn't matter. Try to understand the logic behind them and try to apply them in creating multiple scenario's. Learn them by heart.
Tip 2 : For Web.Development Try to learn full stack development. See which part interests you more, Increase your knowledge horizon, Always try to build a system a system considering It will be served to millions of customers. By doing this 1-2 projects will increase and cover all the major things which one should learn in their career/college.
Tip 1 : Always try to make it a single page
Tip 2 : Always make resume company specific. eg. Data Structures part more if you are applying for MNC's eg. Amazon, Google, DE Shaw, browserstack.
based on 1 interview
Interview experience
Senior Executive
2.5k
salaries
| ₹0 L/yr - ₹0 L/yr |
Operations Executive
1.8k
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Lead
1.8k
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
1.6k
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Entry Operator
1.4k
salaries
| ₹0 L/yr - ₹0 L/yr |
Amazon
Myntra
Snapdeal
Meesho