i
Flipkart
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I applied via Instahyre and was interviewed in Feb 2024. There were 3 interview rounds.
Transform node values in a tree problem
Traverse the tree using depth-first search or breadth-first search
At each node, apply the transformation function to update the node value
Consider using recursion for tree traversal and transformation
Example: Increment each node value by 1 in a binary tree
Implementing sorting algorithm using linked list
Create a linked list data structure to store elements
Implement the sorting algorithm (e.g. bubble sort, merge sort) using linked list operations
Update the pointers accordingly to rearrange the elements in sorted order
I applied via Referral and was interviewed in Oct 2023. There were 3 interview rounds.
I applied via Approached by Company and was interviewed in Oct 2024. There were 3 interview rounds.
Check if array of strings is monotonous
Iterate through the array and compare each string with the next one to check for monotonicity
If all strings are in increasing or decreasing order, the array is monotonous
Examples: ['apple', 'banana', 'cherry'] is monotonous, ['orange', 'kiwi', 'apple'] is not
I have 5 years of experience as an Applications Engineer in the automotive industry.
Designed and implemented software solutions for vehicle diagnostics
Collaborated with cross-functional teams to troubleshoot and resolve technical issues
Provided technical support to customers and conducted product demonstrations
Developed training materials and conducted training sessions for internal teams
Contributed to product developm...
I applied via Naukri.com and was interviewed in Jun 2020. There were 3 interview rounds.
There will be 5 rounds
All the round were mainly focused on the leadership priciples and technical skills
Each round will be carried for 1hr
You should be proefficeint with AWS and devops concepts like CI/CD
This round consist of 2 question mainly focused on DSA concepts like Array and Strings
Here also you will be asked to solve 2 DSA questions form medium to hard level
I applied via LinkedIn and was interviewed in Jun 2024. There was 1 interview round.
Dynamic Programming, Greedy Algorithm
I applied via Walk-in and was interviewed before Mar 2023. There was 1 interview round.
Reverse a linked list
Create three pointers: current, prev, and next
Iterate through the linked list, updating pointers accordingly
Set the head of the linked list to the new tail
The diameter of a binary tree is the number of nodes on the longest path between two leaves in the tree.
The diameter of a binary tree can be calculated by finding the height of the left subtree, the height of the right subtree, and adding them together.
The diameter may or may not pass through the root of the tree.
Example: For the binary tree below, the diameter is 4 (nodes 1, 2, 4, 7).
1
/ \
2 3
/ \
I applied via LinkedIn and was interviewed in Aug 2023. There were 3 interview rounds.
Topics:
data types
scripting
Datatypes,
scripting
I applied via Company Website and was interviewed in Feb 2023. There were 3 interview rounds.
DSA and stakeholder management
based on 2 reviews
Rating in categories
Senior Executive
2.8k
salaries
| ₹2.2 L/yr - ₹9 L/yr |
Operations Executive
1.8k
salaries
| ₹1.2 L/yr - ₹6.5 L/yr |
Team Lead
1.8k
salaries
| ₹1.2 L/yr - ₹9.9 L/yr |
Assistant Manager
1.6k
salaries
| ₹6 L/yr - ₹21 L/yr |
Executive
1.4k
salaries
| ₹1.2 L/yr - ₹6.5 L/yr |
Amazon
Myntra
Snapdeal
Meesho