Technical Interview: This round was organized on google meet. In this round, the interviewer discussed my project and my open-source contribution. The interviewer asked an interesting puzzle “You have 2 ropes, each of which takes 1 hour to burn. But both have different densities at different points. How to measure 45 minutes?”
And the coding question was interesting and quite easy and the interviewer asked me for a brute force approach. The question was there is a function, a tuple, and an array.
f(x)=a*b+c/(d+e)
tuple=[a,b,c,d,e]
array={a,b,c,d,e,f,g,h,....z}
Find how many tuples are present in this array. The tuple contains all the elements of that function f(x). The whole problem solves in O(n)^5 time complexity and the space complexity was O(5) to store the 5 elements. Finally, I rejected in this round because I was a bit nervous.
Note: For lidos interview, confidence and communication are really matters a lot. Always keep yourself confident. Best of luck with your upcoming interview.