Giving back to the community

Phone Screen :
Question1 : https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list
Question2 : https://leetcode.com/problems/accounts-merge

Onsite Loop :
Coding Round 1 :
Question1:https://leetcode.com/problems/continuous-subarray-sum/
Question2: Sparse multiplication of a matrix, pretty different from https://leetcode.com/problems/sparse-matrix-multiplication/description/. Provided just the row and cols and values of the 2 matrices containing non zeros elementss.

Coding Round 2:
Question 1 : Candy crush 1 similar to https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/ but there wasn't any limitation on count. You need to keep on bursting the similar characters
Input: "aaabbbc"
Output: "c"
Explanation:

1. Remove 3 'a': "aaabbbbc" => "bbbbc"
2. Remove 4 'b': "bbbbc" => "c"
   Question 2 : https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-ii/description/

Coding Round 3 :
Question1 : https://leetcode.com/problems/clone-graph
Question2 : https://leetcode.com/problems/top-k-frequent-elements
For question 1, I used DFS approach. For Question 2 i told him 3 approaches : Priority Queue, Quick Sort and Count sort. He didnt have count sort in his mind so asked me to implement count sort one.

Behavioral Round:
Standard behavioral questions

1. Critical feedback from manager
2. Most complicated project
3. Conflict with the team mate
4. Tight deadline

System Design :
Online Coding Judge : LeetCode
Primary Functionality : Multiple competitions running at the same time, generate score for each user participating the competition and show real time ranking board

Got additional coding round since feedback of one of my coding round was not submitted on time.
Passed for E4. Couldn't get E5 since in my behavioral round, my previous work scope was limited and didn't align with E5.