In this Round they asked me 2 DSA question

1. Find the longest size of subarray with sum==0.
2. A binary tree node-update problem requiring each node's value to be computed based on the sum of its cousin nodes.

A string filtering problem requiring frequency counts above a threshold K. Started with a Hash Map approach for counting, then optimized memory/lookup efficiency using a Trie (Prefix Tree).

Tell me where do you use GenAI in your daily life.

Tips: Every technical round included ~15–20 minutes of behavioral questions evaluated against Amazon Leadership Principles using the STAR method.