Amazon Mysql Database Administrator Interview Questions and Answers

Implement an iterator to flatten 2D vector

Q1. Find shortest path to get all keys
Ans. 
Use Dijkstra's algorithm to find the shortest path to get all keys
• Implement Dijkstra's algorithm to find the shortest path in a graph

• Consider the keys as nodes in the graph and the paths between keys as edges

• Keep track of the keys collected and update the shortest path accordingly
Answered by AI
Add your answer

Q1. Data structure and algorithm
Add your answer
Q2. Some tricky logical question
Add your answer
Q3. Stack and queue
Add your answer
Q4. Some basic question about system Design
Add your answer

Q1. Tell me about yourself
Add your answer

Got a leetcode easy question

Leetcode question on DFS and BFS. Passed

Develop a ml model to predict pass/no pass decision.

DSA has 2-3 rounds depending on the team that is hiring. coding and algorithms 1 and coding and algorithms 2 and concurrency.
Topics for coding and algorithms are into Tress, Graphs
Concurrency round is all about implementing base modules

Hackerrank Coding Test, Leetcode medium questions

HLD test, was asked to design an online coding platform like leetcode

Q1. Most interesting project you have worked on
Add your answer
Q2. How do you handle conflict at workplace
Add your answer

PS DSA, Maps, Linked List, Trees

Had to write an application which processes 5TBs of data in Distributed manner