Amazon Interview Experience for SDE-I

1st Interview-

• Swap Kth node from beginning with Kth node from end in a Linked List
  https://practice.geeksforgeeks.org/problems/swap-kth-node-from-beginning-and-kth-node-from-end-in-a-singly-linked-list/1
• Check if two nodes are cousins in a Binary Tree: https://practice.geeksforgeeks.org/problems/check-if-two-nodes-are-cousins/1
• Project-related questions

2nd Interview(Held on same day)-

• In a binary tree for every node you have to check whether it is even or not. If even then print its kth child.
• OS-related questions like. Thrashing, paging, scheduling algorithm,
• DBMS-related question – indexing, SQL vs no-SQL.
• Project-related questions

My Personal Notes arrow_drop_up

Save