Bloomberg | Phone, 1st round, Hackerrank | Scrabble
Question Details
Interviewing for senior software engineer, recruiter reached out on linkedin. This was the first technical round with hackrrank coding questions, 1 hour. The problem was pretty complex and haven\'t seen this...
Full Details
Interviewing for senior software engineer, recruiter reached out on linkedin.
This was the first technical round with hackrrank coding questions, 1 hour. The problem was pretty complex and haven\'t seen this in leetcode tagged with bloomberg. Not sure if this even exists on leetcode.
The question was to find longest matching word from dictionary for given set of chars.
e.g.
dict={when, what, whatthen, whatnow}, input="whatno", expected output= "what"
dict={when, what, whatthen, whatnow}, input="whatnwo", expected output= "whatnow"
dict={when, what, whatthen, whatnow}, input="wonthaw", expected output= "whatnow"
I solved it using trie and I was able to get output for given test cases but I later realized the logic fails for input like 3rd case mentioned above.
Haven\'t heard back yet, hoping for the best.
About This Question
This is a reported interview question from a bloomberg interview for a swe role (senior level) during the oa round reported in 2023.
It covers the following topics: Binary Tree, Hash Table, Trie .
Difficulty rating: Hard