Technical screen :
Hacker Rank OA - 2 questions.

Followed by 4 interview rounds ranging from 45 min - 1 hour.

Round 1:
Behavioral + run code with tescases
Variation of :
https://leetcode.com/problems/my-calendar-i/description/

cal = Calendar()

cal.addMeeting("10:00", 15)
cal.addMeeting("11:00", 30)
cal.addMeeting("13:00", 50)
cal.addMeeting("16:00", 15)

print(cal.canSchedule("09:00", 60))   # True
print(cal.canSchedule("13:00", 30))   # False

Round 2:
Behavioral + run code with tescases

Compute the length of the longest sub-string without repeating characters in a single pass. You cannot rescan, you cannot use nested loops, should remain small and predictable.

Round 3:
Behavioral + run code with tescases
Returns a maximum number of sessions that were active at the same time.
Variation of :
https://leetcode.com/problems/meeting-rooms-ii/description/

Round 4:
Explain about BST and write insert and removal functions.