i
Amazon
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Python, html &css programming
Python programming is a high-level, interpreted, and general-purpose programming language known for its simplicity and readability.
Python is widely used for web development, data analysis, artificial intelligence, scientific computing, and more.
It emphasizes code readability and uses indentation for block delimiters.
Python supports multiple programming paradigms, including procedural, object-oriented, and functional pr...
HTML & CSS are the building blocks of web development, used to create and style web pages.
HTML stands for HyperText Markup Language and is used to create the structure of a web page.
CSS stands for Cascading Style Sheets and is used to style the elements created with HTML.
HTML uses tags like <div>, <p>, <h1> to define the content and structure of a webpage.
CSS uses properties like color, font-size,...
Bitwise operators are used to perform operations on individual bits of binary numbers.
Bitwise AND (&) - Sets a bit to 1 only if both bits are 1
Bitwise OR (|) - Sets a bit to 1 if either bit is 1
Bitwise XOR (^) - Sets a bit to 1 if the bits are different
Bitwise NOT (~) - Flips the bits
Bitwise left shift (<<) - Shifts the bits to the left by a certain number of positions
Bitwise right shift (>>) - Shifts the bits to the r
An algorithm is a step-by-step procedure for solving a problem or accomplishing a task.
An algorithm is a set of instructions that are followed to solve a problem.
It is a sequence of well-defined steps that lead to the desired outcome.
Algorithms can be represented using flowcharts, pseudocode, or programming languages.
Examples of algorithms include sorting algorithms like bubble sort and searching algorithms like binary
An array in Python is a data structure that stores a collection of elements of the same data type.
Arrays in Python can be created using the 'array' module or using list comprehension.
Elements in an array are accessed using their index, starting from 0.
Example: arr = [1, 2, 3, 4, 5]
Example: import array; arr = array.array('i', [1, 2, 3, 4, 5])
I appeared for an interview before May 2021.
Round duration - 60 Minutes
Round difficulty - Easy
Given the head node of a singly linked list and an integer 'k', this problem requires you to determine the value at the k-th node from the end of the linke...
To find the k-th node from the end of a linked list, iterate through the list to determine the size, then traverse again to reach the k-th node from the end.
Iterate through the linked list to determine its size.
Calculate the position of the k-th node from the end based on the size of the list.
Traverse the list again to reach the k-th node from the end.
Return a pointer to the k-th node from the end.
Round duration - 60 Minutes
Round difficulty - Easy
High level System Design
Designing a system like Uber involves components like user app, driver app, server, database, and algorithms for matching and routing.
User app for booking rides and tracking
Driver app for accepting rides and navigation
Server for handling requests and communication between apps
Database for storing user, driver, and ride information
Algorithms for matching riders with drivers and routing
Round duration - 45 minutes
Round difficulty - Easy
Basic HR questions
Tip 1 : Practise DSA/coding consistently
Tip 2 : Choose a tech stack and Make side hobby projects
Tip 3 : Give mock interviews for your preparation evaluation
Tip 1 : Pointers about your current job responsibility
Tip 2 : Side Projects with Tech stack
I applied via Naukri.com and was interviewed before Nov 2020. There were 3 interview rounds.
Solution to performing operations on a large array of bits.
Use bitwise operators to perform operations on individual bits
Use a loop to iterate through the array and perform the operations
Ensure that the array is large enough to accommodate all the bits
Consider using a data structure like a bitset for efficient bit manipulation
I applied via Campus Placement and was interviewed in Dec 2016. There were 4 interview rounds.
Given a 2D matrix with doors and walls, fill distance matrix with minimum distance to the nearest door.
Iterate through the matrix and find the doors
Use Breadth-First Search (BFS) to calculate the minimum distance from each cell to the nearest door
Update the distance matrix with the minimum distances
Find kth smallest element in unordered array with O(1) space
Use the QuickSelect algorithm to partition the array and find the kth smallest element
Choose a pivot element and partition the array into two subarrays
Recursively partition the subarray that contains the kth smallest element
Repeat until the pivot element is the kth smallest element
Time complexity: O(n) average case, O(n^2) worst case
To find friends of friends who are not already friends with you, we can first find your friends and then their friends excluding yourself and your friends.
Get your list of friends
For each friend, get their list of friends
Exclude yourself and your friends from the final list of friends of friends
I appeared for an interview before Apr 2021.
Round duration - 60 minutes
Round difficulty - Medium
It started with an informal talk after he gave his introduction. We talked about the cyclone that was going to be there and what I did in my internship and my previous projects. Then we moved to questions. After solving both questions he asked if I had questions.
Given an array of distinct positive integers and a number 'K', your task is to find the K'th largest element in the array.
Array: [2,1,5,6,3,8], K ...
Find the Kth largest element in an array of distinct positive integers.
Sort the array in non-increasing order
Return the Kth element from the sorted array
Handle multiple test cases
Consider a grid containing oranges. Each cell in this grid can hold one of three integer values:
The task is to determine the minimum time required for all fresh oranges to become rotten in a grid.
Create a queue to store the rotten oranges and their time of rotting.
Iterate through the grid to find the initial rotten oranges and add them to the queue.
Perform BFS by popping each rotten orange from the queue, rot adjacent fresh oranges, and add them to the queue with updated time.
Continue until the queue is empty, ke...
Round duration - 45 minutes
Round difficulty - Easy
This was a design round.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
based on 1 interview
Interview experience
based on 23 reviews
Rating in categories
Customer Service Associate
4.2k
salaries
| ₹0.6 L/yr - ₹6.8 L/yr |
Transaction Risk Investigator
3.1k
salaries
| ₹2 L/yr - ₹6.1 L/yr |
Associate
2.9k
salaries
| ₹0.8 L/yr - ₹7 L/yr |
Senior Associate
2.5k
salaries
| ₹2 L/yr - ₹10.5 L/yr |
Program Manager
2.2k
salaries
| ₹9 L/yr - ₹37 L/yr |
Flipkart
TCS
Netflix