Question

Bloomberg | 2023 | New Grad | Set - 2 | First round

Answer 1

Interview Duration : 1hr
Type : Online Zoom
Format: Candidate Background (10Mins) | Technical Assesment | Questions (10 Mins)

Asked questions from resume, and favorite project.

Technical Assessment
1. Given the root of a tree, check if its a BST or not
	a. if root is None: Return True
	b. if there are duplicates: Return False
	
2. Implement Stack using two queues (Push, Pop, Top, Empty)
	a. Push must be efficient O(1)
	b. Top must be efficient O(1)
	You have to use the methods provided by queue and no other method on top of it
	class MyQueue:
		def enqueue():
		def dequeue(): return int
		def empty(): return True/False