This was a hiring event

Online Assessment: Refer to Sethil's question list and questions in comments

Onsite:
Round 1: Discussion about my experience and resume + LC easy problem
Did well in this round

Round 2: Deep dive into Java, resume and finally OO design for elevator. At that point i dint know how to handle OO design, did below average

Round 3: https://leetcode.com/problems/intersection-of-two-arrays/
Round went well but felt interviewer was quite arrogant and dismissive

Round 4: Messed up this round pretty bad.
Ask was to implement BST in-order traversal by completing below code

class inOrderBST{

	inOrderBST(Node root){
	}

	Node getNext(){
	//return next element of in order straversal
	}

	boolean isEmpty(){
	//return true if all elements in BST are accessed. else false
	}
}

Class Node{
	int value;
	Node left;
	Node right;
}

Feel free to answer last question in the comments. Hope this helps others.