i
Amazon
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I applied via LinkedIn and was interviewed in Jul 2024. There was 1 interview round.
Given 100 numbers return n unique numbers
I applied via Campus Placement and was interviewed in Oct 2024. There were 3 interview rounds.
Test contains 26 questions for me 13 are java based 13 are c++ based
Indexing in DBMS is a technique to improve the performance of queries by creating a data structure that allows for faster retrieval of data.
Indexes are created on columns in a database table to speed up the retrieval of rows that match a certain condition.
Types of indexes include clustered, non-clustered, unique, and composite indexes.
Examples of indexing techniques include B-tree, hash, and bitmap indexes.
Indexing can...
Check if two strings are anagrams by comparing the sorted characters in each string.
Sort the characters in both strings and compare if they are equal.
Ignore spaces and punctuation when comparing the strings.
Example: 'listen' and 'silent' are anagrams.
Example: 'hello' and 'world' are not anagrams.
Use a stack to simulate the recursive inorder traversal process
Create an empty stack to store nodes
Start with the root node and push it onto the stack
While the stack is not empty, keep traversing left and pushing nodes onto the stack
Once you reach a leaf node, pop it from the stack, print its value, and move to its right child
Repeat the process until all nodes have been visited
To make a class final, use the 'final' keyword in the class declaration.
Use the 'final' keyword before the 'class' keyword in the class declaration
A final class cannot be subclassed or extended
Final classes are often used for utility classes or classes that should not be modified
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
BFS Implementation of a jug question.
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
I applied via LinkedIn and was interviewed in Jul 2024. There was 1 interview round.
I want to join Facebook because of its innovative technology, global impact, and opportunities for growth.
Innovative technology: Facebook is known for its cutting-edge technology and constant innovation.
Global impact: Working at Facebook would allow me to contribute to a platform that connects billions of people worldwide.
Opportunities for growth: Facebook offers a dynamic and fast-paced work environment with ample opp...
I appreciate the personalized news feed feature on Facebook.
Personalized news feed shows content based on user interests
Helps users stay updated on relevant information
Allows users to engage with content they are interested in
based on 1 review
Rating in categories
Customer Service Associate
4.2k
salaries
| ₹0.6 L/yr - ₹5 L/yr |
Transaction Risk Investigator
3.1k
salaries
| ₹2.5 L/yr - ₹6.5 L/yr |
Associate
2.8k
salaries
| ₹0.8 L/yr - ₹6.7 L/yr |
Senior Associate
2.4k
salaries
| ₹2 L/yr - ₹10.1 L/yr |
Program Manager
2k
salaries
| ₹9 L/yr - ₹36 L/yr |
Flipkart
TCS
Netflix