Giving back to the community:
Had my virtual onsite couple of weeks back.

Coding 1
Q1. Deep Copy LinkedList with random
Follow-up: Can you implement thread safe

Q2. Return all max repeating characters in string, with output: max_length | [all_characters] . Similar to: https://leetcode.com/problems/consecutive-characters/description/

Coding 2
Q1. Find Peak variant instead of peak lower than neighbours also if the element is at 0th index or last index and the neighbour is greater it is still valid

Q2. Calculator II variant only + and * as operation. Used stack to implement
Follow-up:

1. Can you optimse for time and space. Interviewer was looking for space O(1)
2. How would you change if - and / is required

Design
Design Ticketbooking app for events

Self Verdict

• Coding 1 - Q1 I messed up, was not very clear in conveying my thought also implementation was not optimal
• Coding 2 - Q2 Follow for optimising space I couldn't figure out
• Rest were very good. All solved with optimal solutions and design went well

Final Result

• Rejected. I believe the Coding 1 where I couldn't be clear set me up for failure. This was the first time I did Meta loop, although disappointed with the rejection proud I was able to solve 2 questions within 40 minutes, which I couldn't do it 3-4 months before.