Given a binary search tree (BST) with duplicates, find all the mode(s) (the most frequently occurred element) in the given BST.
Assume a BST is defined as follows:
The left subtree of a node contains only nodes with keys less than or equal to the node's key.
The right subtree of a node contains only nodes with keys greater than or equal to the node's key.
Both the left and right subtrees must also be binary search trees.
Typical phone screen, zoom call with video with multiple rounds. Positive feedback leads to the next round. Varying difficulty/depends on the interviewer really. Leetcode stuff. Fast response time from the coordinator too.
Super good. Reached out to a recruiter. Had an online screen, then a phone screen + doc. Finally an onsite. Overall smooth process. Definitely have a good HR system and some strong software engineers on the team . They know how to conduct interviews though some depends on luck.
Domande di colloquio [1]
Domanda 1
Leetcode Style Coding Questions. Important to focus also on style
