Filter interviews by
Coding round was weird. The interviewer couldn't understand english and there was a bit of miscommunication because of the language barrier. I answered the question nevertheless. The second round was where the scam happened. The HR told me it was a system design round and I had prepared accordingly. The interviewer was 15 mins late (I had to call the HR numerous times to get the interviewer in the call) and in the interview I was asked another DSA question instead of a System Design question. The interviewer was rude, abruptly ended the call in 10 mins and HR ghosted me for a week. She rudely asked me to stop calling one day and told me I was not selected. Stay away from these monkeys.
Top trending discussions
posted on 3 Dec 2024
Binary Search based optimisation question
posted on 12 Dec 2024
Design a chat room system where users can chat with each other and join chat rooms.
Implement user authentication and authorization to ensure secure access to chat rooms.
Create a database to store chat messages, user information, and chat room details.
Develop a real-time messaging system using websockets for instant communication.
Allow users to create new chat rooms and join existing ones.
Include features like message h
posted on 13 Oct 2024
I applied via Naukri.com and was interviewed in Sep 2024. There were 2 interview rounds.
Write code on paper using the multithreading, oops and design patterns correctly
I'm sorry, I don't have access to real-time data to provide a list of hot videos on YouTube.
Design Amazon Prime - a subscription service offering fast shipping, streaming of movies, TV shows, music, and more.
Offer fast shipping for products purchased on Amazon
Provide access to a library of movies, TV shows, and music for streaming
Include exclusive deals and discounts for Prime members
Offer additional services like Prime Video, Prime Music, Prime Reading, and more
posted on 12 Nov 2024
I applied via Recruitment Consulltant
Dsa, array, dp, backtracking
The container problem involves efficiently packing items into containers to minimize wasted space.
Use algorithms like First Fit, Best Fit, or Next Fit to optimize packing efficiency.
Consider the size and shape of items being packed to determine the best container arrangement.
Utilize dynamic programming or greedy algorithms to solve the container packing problem efficiently.
posted on 15 Jul 2024
I applied via Recruitment Consulltant and was interviewed in Jun 2024. There were 3 interview rounds.
Round 1 was a technical/coding round. There were 2 simple linked-list and LRU cache questions.
Round 2 was also a tech/coding round. The 1st question was about from tree and second was from string (which could be done using map and array).
posted on 18 Jan 2025
I applied via LinkedIn and was interviewed in Jul 2024. There were 3 interview rounds.
Data Structures and Algorithms plus Amazon behavioral interview questions.
posted on 13 Jan 2025
I applied via LinkedIn and was interviewed in Jul 2024. There were 3 interview rounds.
Standard questions, Don't Remember
posted on 10 Aug 2024
Tough and was mostly out of leet code type
posted on 3 Jun 2024
The coin change problem involves finding the minimum number of coins needed to make a certain amount of change.
Start by creating an array to store the minimum number of coins needed for each amount from 0 to the target amount.
Iterate through each coin denomination and update the minimum number of coins needed for each amount.
Return the minimum number of coins needed for the target amount.
Tree traversal problem involves visiting each node in a tree data structure in a specific order.
There are three main types of tree traversal: in-order, pre-order, and post-order.
In-order traversal visits the left subtree, then the root, then the right subtree.
Pre-order traversal visits the root, then the left subtree, then the right subtree.
Post-order traversal visits the left subtree, then the right subtree, then the
Longest common subsequence is the longest sequence of characters that appear in the same order in two or more strings.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the lengths of longest common subsequences of substrings.
Traverse the array to find the longest common subsequence.
Software Developer
3
salaries
| ₹16 L/yr - ₹19 L/yr |
Data Engineer
3
salaries
| ₹15 L/yr - ₹30 L/yr |
TCS
Accenture
Wipro
Cognizant