Two nodes in a binary search tree are swapped. We are supposed to find those two nodes, without any extra space (not even recursion) and O(N) TC. I was not able to come up with an approach without extra space. After around half hour of trying, he asked me to provide a solution which can use extra space. I gave it and he asked me to explain the whole working of the algorithm, step by step.
if you are given score of players and you have to find the rank of the players in a stream of inputs
Why am I interested in development
Era un problema sobre encontrar un valor dentro de varios arrays.
Design a scalable backend system to handle millions of concurrent users while ensuring low latency and high availability.
One thing they always asked was a behavioral question based on Amazon Leadership Principles, for example: “Tell me about a time you faced a conflict or failed, and how you handled it (use STAR).”
Explain your final year project and the challenges you faced.
what is the difference between procedure and a function?
introduction, 2 DSA questions, and cs fundamentals in round 1 . There is no time for project discussion
Size of the longest zig zag traversal in a binary tree
Viewing 231 - 240 interview questions