Two interviews were conducted, each lasting one hour.

The first interview was algorithm-based, and the second focused on system design.

Both interviews were considered easy to moderate in difficulty.

Two interviewers facilitated both rounds.

They provided assistance when candidates became stuck.

Their focus was on understanding the candidate's thought process rather than expecting a perfect answer.

Find the number of Perfect Substrings from a string.

E.g. s = 1102021222 k = 2

The 6 perfect substrings are: s[0:1] = 11 s[0:5] = 110202 s[1:6] = 102021 s[2:5] = 0202 s[7:8] = 22 s[8:9] = 22

System Design: Design a parking lot system.