Given a string containing different sentences with keys (strings) and a list of keys (strings), find all the sentences which contains the input keys (all of them) and return a list with the other keys in this selected sentences without any duplicate.
First, you have to split the string so that you can select each sentence. I chose to create a matrix with one sentence per line and one word per cell. Once it's done, you need to find the sentences that contains all the keys. Then you must select these sentences and return the keys (ie words, cells), that are different from the input keys. Example: let's assume you already have your matrix. Input: matrix (M) and list of keys (Keys) M: [[I love love Datadog Datadog] [I like Datadog]] Keys: [Datadog, I] You should select both sentences and return [love, like] (don't contain any duplicate).
On technical side it was basic Linux questions, for some it may be slightly difficult but i found just average. In other interview they wanted to assess my skills to handle customer and how to present company image. The feedback was very positive throughout
Since I have good previous experience of similar jobs I was pretty confident. I was give extremely high feedback. I had in total eight interviews from Technical Engineers to very high command of company.
The main question was about expectations for the panel meeting. It was a 4-page pdf explaining the situation of the fictitious client and what was the purpose of the panel meeting. The final objective was to convince the customer to choose Commerce Cloud.