i
Amazon
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Clear (1)
I applied via LinkedIn
Search for a specific string in an array of strings.
Iterate through the array and compare each string with the target string.
Use a loop to go through each element in the array and check for a match.
Consider using built-in methods like indexOf() or includes() for efficient searching.
Handle cases where the target string is not found in the array.
Search for a specific string in an array of strings.
Iterate through the array and compare each string with the target string.
Use a loop to go through each element in the array and check for a match.
Consider using built-in methods like indexOf or includes for efficient searching.
Find all subarrays in a given array of strings
Iterate through the array and consider each element as the starting point of a subarray
For each starting point, iterate through the array to find all possible subarrays
Store each subarray found in a separate list
Use stack data structure to check for balanced parentheses in a string.
Create an empty stack to store opening parentheses
Iterate through the string and push opening parentheses onto the stack
When encountering a closing parenthesis, pop from the stack and check if it matches the corresponding opening parenthesis
If stack is empty at the end and all parentheses have been matched, the string is balanced
A mean heap is a data structure that minimizes the cost of accessing the smallest element.
Mean heap is a type of binary heap where the value of each node is less than or equal to the values of its children.
It is useful for finding the minimum element quickly, as the root node always contains the smallest value.
Insertion and deletion operations in a mean heap have a time complexity of O(log n).
I applied via LinkedIn and was interviewed in Oct 2024. There were 2 interview rounds.
DSA medium level 2 question based on graph and recursion
I applied via LinkedIn and was interviewed in Sep 2024. There was 1 interview round.
What people are saying about Amazon
Prime numbers usung sieve if erastothenesis
Amazon interview questions for designations
I applied via Company Website and was interviewed in May 2024. There was 1 interview round.
Amazon Chime interview with questions on DSA
Find the pair element from the array
Iterate through the array and use a hashmap to store elements and their counts
Check if the current element's complement exists in the hashmap
Return the pair if found, otherwise return null
I was interviewed before May 2016.
I am a passionate software engineer with experience in developing web applications and a strong background in computer science.
Experienced in developing web applications using technologies such as HTML, CSS, JavaScript, and React
Strong background in computer science with knowledge of data structures and algorithms
Proficient in programming languages such as Java, Python, and C++
Familiar with Agile development methodolog
Flipkart is a leading e-commerce platform in India with a strong focus on technology and innovation.
Flipkart offers a challenging and dynamic work environment for software engineers.
The company has a strong reputation for investing in technology and innovation.
Flipkart has a large user base and offers opportunities to work on a variety of projects.
The company has a strong focus on customer satisfaction and user experie...
Yes, I am comfortable with reallocating as needed.
I am flexible and adaptable to changing circumstances.
I have experience working in dynamic environments where priorities can shift.
I am willing to take on new challenges and responsibilities as required.
I have a strong technical background, excellent problem-solving skills, and a proven track record of delivering high-quality software.
Extensive experience in software development, including proficiency in multiple programming languages such as Java, Python, and C++
Strong problem-solving skills demonstrated through successful completion of complex projects
Proven track record of delivering high-quality software on time a...
Calculate the level sum of a binary tree.
Traverse the tree level by level using BFS
Add the values of nodes at each level
Store the level sum in an array
Return the array of level sums
Vertical sum of binary tree is the sum of all nodes in each vertical line of the tree.
Traverse the tree in-order and keep track of the horizontal distance of each node from the root.
Use a hash table to store the sum of nodes at each horizontal distance.
Recursively traverse the left and right subtrees and update the hash table accordingly.
Calculate top 10 frequently used words on Facebook in 1 hour dynamically.
Use Facebook API to fetch data
Implement a script to count word frequency
Sort the words based on frequency and return top 10
I am a software engineer with experience in developing web applications and a passion for problem-solving.
Proficient in programming languages such as Java, Python, and JavaScript
Experience with front-end frameworks like React and Angular
Familiarity with back-end technologies such as Node.js and Spring Boot
Strong understanding of data structures and algorithms
Ability to work collaboratively in a team environment
There are 204 squares and 1296 rectangles on a standard 8x8 chess board.
The number of squares can be calculated using the formula n(n+1)(2n+1)/6, where n is the number of rows/columns.
The number of rectangles can be calculated using the formula n(n+1)m(m+1)/4, where n and m are the number of rows and columns respectively.
For an 8x8 chess board, there are 64 squares of size 1x1, 49 squares of size 2x2, 36 squares of siz...
based on 5 interviews
1 Interview rounds
based on 5 reviews
Rating in categories
Customer Service Associate
4.2k
salaries
| ₹0 L/yr - ₹0 L/yr |
Transaction Risk Investigator
3.1k
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate
2.8k
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Associate
2.5k
salaries
| ₹0 L/yr - ₹0 L/yr |
Program Manager
2.1k
salaries
| ₹0 L/yr - ₹0 L/yr |
Flipkart
TCS
Netflix