Filter interviews by
I applied via Approached by Company and was interviewed in Nov 2023. There were 3 interview rounds.
Fixing rendering issues in a React project often involves debugging component states and props.
Check component state: Ensure that the state is being updated correctly using setState or useState.
Verify props: Make sure that the props being passed to components are correct and not undefined.
Use React DevTools: Inspect the component tree to see if components are rendering as expected.
Check for conditional rendering: Ensur...
Implementing search functionality in a React application
Use state to store search query
Filter data based on search query
Display filtered results
I applied via LinkedIn and was interviewed in Oct 2023. There were 3 interview rounds.
Top trending discussions
I applied via Naukri.com
Amazon's innovation, customer focus, and diverse opportunities align with my career goals and values.
Customer Obsession: Amazon prioritizes customer satisfaction, evident in initiatives like Prime and personalized recommendations.
Innovation: The company is a leader in technology and logistics, constantly pushing boundaries with services like AWS and drone delivery.
Diversity of Roles: Amazon offers a wide range of caree...
I expect Amazon to foster innovation, provide growth opportunities, and maintain a customer-centric culture.
Opportunities for professional development, such as training programs and mentorship.
A collaborative work environment that encourages teamwork and idea sharing.
Access to cutting-edge technology and resources to drive innovation.
A strong focus on customer satisfaction, ensuring that every decision prioritizes the ...
I applied via Campus Placement and was interviewed before Jan 2020. There was 1 interview round.
I enjoy hiking, reading, and cooking, which help me relax and stay creative while fostering personal growth.
Hiking: I explore local trails every weekend, enjoying nature and staying fit.
Reading: I read a mix of fiction and non-fiction, currently diving into historical novels.
Cooking: I experiment with new recipes, recently trying my hand at Italian cuisine.
I applied via Recruitment Consultant and was interviewed before Apr 2020. There was 1 interview round.
I will generate daily revenue for the company by implementing effective sales strategies and motivating my team to achieve their targets.
Developing a sales plan and setting achievable targets
Identifying potential customers and reaching out to them through various channels
Providing excellent customer service to retain existing customers and generate referrals
Motivating and training team members to improve their sales sk...
I approach tough times with resilience, strategic planning, and team collaboration to navigate sales pressure effectively.
Maintain a positive mindset: I remind my team that challenges are opportunities for growth. For example, during a sales slump, I encouraged brainstorming sessions to identify new strategies.
Set clear goals: I break down larger targets into manageable milestones, making it easier for the team to stay...
I applied via Company Website and was interviewed in May 2019. There were 5 interview rounds.
I am a Senior Associate in the field of finance, specializing in investment management.
I have expertise in analyzing financial data and making investment recommendations.
I work closely with clients to understand their financial goals and risk tolerance.
I monitor market trends and economic indicators to make informed investment decisions.
I have experience in portfolio management and asset allocation.
I may hold certifica...
My ambition is to become a respected leader in my field, making a positive impact through innovative solutions and mentorship.
To continuously learn and grow in my role
To lead and inspire a team towards success
To contribute to the advancement of the organization and industry
To mentor and guide junior colleagues in their professional development
I appeared for an interview before Dec 2020.
Round duration - 60 Minutes
Round difficulty - Medium
This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.
Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...
Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.
Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.
Use level-order input to construct the Binary Tree.
Traverse the Binary Tree recursively to generate the required traversals.
Ensure proper handling of null nodes represented by -1 in the input.
Return the three traversals as ...
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
The first line of input is an intege...
Reverse a singly linked list by altering the links between nodes.
Iterate through the linked list and reverse the links between nodes
Use three pointers to keep track of the current, previous, and next nodes
Update the links between nodes to reverse the list
Return the head of the reversed linked list
Round duration - 45 Minutes
Round difficulty - Medium
This round basically tested some concepts from Data Structures and File Manipulation .
Given two arrays A
and B
with sizes N
and M
respectively, both sorted in non-decreasing order, determine their intersection.
The intersection of two arrays in...
The problem involves finding the intersection of two sorted arrays efficiently.
Use two pointers to iterate through both arrays simultaneously.
Compare elements at the pointers and move the pointers accordingly.
Handle cases where elements are equal and update the intersection array.
Return the intersection array as the result.
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.
I applied via Referral
Convert a sorted array to balanced binary search tree
Find the middle element of the array and make it the root of the tree
Recursively construct the left subtree using the left half of the array
Recursively construct the right subtree using the right half of the array
Repeat until all elements are added to the tree
Reverse a singly linked list in groups of k inplace
Divide the linked list into groups of k nodes
Reverse each group of k nodes
Connect the reversed groups to form the final linked list
A recursive routine to calculate a ^ n
The base case is when n is 0, in which case the result is 1
For any other value of n, the result is a multiplied by the result of a^(n-1)
The recursive function should call itself with a^(n-1) as the new input
Design optimal data structure for never-ending stream of numbers for insertion, deletion, searching, kth largest and kth smallest.
Use a balanced binary search tree like AVL or Red-Black tree for efficient insertion, deletion, and searching.
Maintain two heaps, one for kth largest and one for kth smallest.
For finding kth largest, use a min heap of size k and for kth smallest, use a max heap of size k.
Alternatively, use a...
I appeared for an interview in Oct 2016.
based on 1 interview experience
Duration
based on 4 reviews
Rating in categories
Staff Software Engineer
8
salaries
| ₹44 L/yr - ₹62 L/yr |
Software Engineer
4
salaries
| ₹15 L/yr - ₹40 L/yr |
Senior Software Engineer
4
salaries
| ₹34 L/yr - ₹48 L/yr |
Staff Engineer
4
salaries
| ₹38.5 L/yr - ₹52.7 L/yr |
Staff Quality Engineer
4
salaries
| ₹45 L/yr - ₹56 L/yr |
Amazon
Flipkart
Amazon Development Centre India
Indiamart Intermesh