i
Amazon
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Hackerrank was used for test
Implement BFS algorithm to find the nearest neighbour
Create a queue to store nodes to be visited
Start with the initial node and add it to the queue
While the queue is not empty, dequeue a node, visit its neighbours, and add them to the queue
Repeat until the nearest neighbour is found
Priority queue can be implemented using a heap data structure.
Create a min heap or max heap based on the priority order needed.
Insert elements into the heap based on their priority level.
Remove elements from the heap based on their priority level.
Heapify the heap after each insertion or deletion operation.
Example: Implementing a min heap for a priority queue where lower values have higher priority.
I have 3 years of experience working as a software engineer, with projects including a mobile app for tracking fitness goals and a web application for managing inventory.
3 years of experience as a software engineer
Developed a mobile app for tracking fitness goals
Created a web application for managing inventory
I was interviewed before Jan 2024.
Difficulty level was medium to hard
Difficulty level was medium to hard
I applied via LinkedIn and was interviewed in Nov 2024. There was 1 interview round.
Merge Sort is a divide and conquer algorithm that divides the input array into two halves, recursively sorts them, and then merges the sorted halves.
Divide the input array into two halves
Recursively sort the two halves
Merge the sorted halves back together
Quick Sort is a popular sorting algorithm that uses a divide-and-conquer approach to sort elements in an array.
Choose a pivot element from the array.
Partition the array into two sub-arrays: elements less than the pivot and elements greater than the pivot.
Recursively apply the same process to the sub-arrays.
Combine the sorted sub-arrays to get the final sorted array.
posted on 9 Oct 2024
I applied via Recruitment Consulltant and was interviewed in Sep 2024. There were 3 interview rounds.
Java coding questions
Java oops concepts include inheritance, encapsulation, polymorphism, and abstraction.
Inheritance allows a class to inherit properties and behavior from another class.
Encapsulation hides the internal state of an object and restricts access to it.
Polymorphism allows objects to be treated as instances of their parent class.
Abstraction hides the implementation details and only shows the necessary features.
Collections in programming refer to data structures that allow you to store and manipulate groups of objects.
Collections provide a way to organize and manage data efficiently
Examples include lists, sets, maps, queues, and stacks
Collections can be used to perform operations like adding, removing, and searching for elements
Code to reverse a number in JavaScript
Convert the number to a string to easily manipulate each digit
Use array methods like split, reverse, and join to reverse the number
Convert the reversed string back to a number before returning
I am a recent graduate with a degree in Computer Science and a passion for coding and problem-solving.
Graduated with a degree in Computer Science
Proficient in programming languages like Java, Python, and C++
Completed internships at tech companies like Google and Microsoft
Enthusiastic about learning new technologies and working in a team environment
The company is a leading software development firm specializing in creating innovative solutions for various industries.
Company focuses on creating innovative software solutions
Has a strong presence in various industries
Known for their expertise in software development
I applied via Referral and was interviewed in Jun 2024. There were 3 interview rounds.
Hackerrank Coding Test, Leetcode medium questions
HLD test, was asked to design an online coding platform like leetcode
It was a medium-level DSA round
This was also a DSA round
This again a DSA round
Interview experience
based on 4 reviews
Rating in categories
Customer Service Associate
4.1k
salaries
| ₹0.6 L/yr - ₹6 L/yr |
Transaction Risk Investigator
3.1k
salaries
| ₹2.4 L/yr - ₹6.5 L/yr |
Associate
2.5k
salaries
| ₹0.8 L/yr - ₹6.5 L/yr |
Senior Associate
2.4k
salaries
| ₹2 L/yr - ₹10.1 L/yr |
Software Development Engineer
2k
salaries
| ₹16.5 L/yr - ₹34 L/yr |
Flipkart
TCS
Netflix