1. Online Assessment
The Online assessment was for 1:45 hours.

• 2 coding questions
• 2 problem approach and complexity write up
  Both question were relatively simpler if HashMap and Heaps are used.

1. Find Amazon's Top N competitors from given list of Comptetitors and Reviews.
   Similar problem : https://leetcode.com/problems/top-k-frequent-words/
   Desciption: Given a list of reviews, return top N competitors with maximum unique reviews. If reviews count is same, return lexicographically smaller competitor first.
   Input: competitor = ['newshop','fashioicon','leetcode'], reviews=['newshop has the best collection', 'fashionicon is the best,fashionicon is polite.','newshop is better than leetcode', 'leetcode is better',], N=2
   Output: [leetcode, newshop] as both leetcode and newshop have 2 unique reviews, while fashion icon has 1 unique review.

This answer was expected in lowercase irrespective competitor name. That was not mentioned in the question. Cost me some time.

2. Several products are brought together on amazon. If product A is bought together with Product B, it will represented as [A,B]. Given a list such relations, return the list of products, with the largest number of products, that can be bought together. If there are 2 lists, return the lexicographically smaller list. [Given a undirected graph, return the largest subgraph]
   EDIT : Here's the exact question : https://leetcode.com/discuss/interview-question/782606/Amazon-or-OA-or-SDEII-or-Aug-2020 Thank you @rohan2005p

Input: [i1,i2],[i3,i4],[i5,i6],[i7,i8],[i9,i10],[i1,i10],[i3,i5]
Output: [i1,i2,i9,i10]
Explanation: [i3,i4,i5,i6] also has the same number of elements, however it is lexicographically smaller than result.
I didn't find any exact problem on leetcode, however this one comes close
https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/

All test cases were accepted and I cleared this round.
Edit: Thank you @gerrob for this link
https://leetcode.com/problems/accounts-merge/

2. Onsite
Update
Onsite Round1
Question 1: https://leetcode.com/problems/find-peak-element/ He was expecting binary search solution. It took me some time right the correct binary expression.

2. Question 2: https://leetcode.com/problems/first-missing-positive/ I was struggling with index approach. He pretty much told me the entire solution while giving hints.

Onsite Round2:

• Hiring manager round
• I was asked to design a system like BookMyShow/Ticketmaster HLD
• There were few questions like tell me about a time when you made decision against popular decision, you changed something that was working well

Onsite Round 3:

• Design round HLD /LLD
• I was asked to desing Bus Shuttle Service from scratch. It should have User BookingService, Notification, Feedback, Payment, Bus Maintenance Service
• I was expected to draw HLD diagrams, layout the table schema and interaction between them.
•