Two technical phone screens were conducted.

The interviewers were nice and helpful.

Expectation: Fully optimal, working code (compiled and running on HackerRank CodePair).

If you don't get the code working, you can probably consider it a thumbs down on your interview.

However, you get enough time; there will be only one question for 45 minutes.

1. Word Break

Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.

For example, given `s = "leetcode", dict = ["leet", "code"].

Return true because "leetcode" can be segmented as "leet code".

1. Log-in/Log-out Time Series

Given an input which is a vector of (user name, log-in time, log-out time), output a time series which will have the number of users logged in at each given time slot in the input. The output should only contain time slots that are present in the input.

For example, if the input is:

• ("September", 1.2, 4.5)
• ("June", 3.1, 6.7)
• ("August", 8.9, 10.3)

The output should contain only 1.2, 3.1, 4.5, 6.7, 8.9, 10.3.

Example:

[ ("September", 1.2, 4.5), ("June", 3.1, 6.7), ("August", 8.9, 10.3) ]

=>

[(1.2, 1), (3.1, 2), (4.5, 1), (6.7, 0), (8.9, 1), (10.3, 0)]