Domanda di colloquio di Intentional Software
1st round HR: basic behavioral questions
2nd tech screen: data structures and an algorithm question that most people should have learned in their algorithms class
3rd tech screen: a simpler algorithm design question, then a really weird data structure question.
Risposte di colloquio
Thank you for your replay !
I didn't make it to the final round since I came up with a TreeMap like solution but failed to get to the optimal solution. The optimal solution was NOT using a TreeMap, since it requires O(log(n)) insertion time and the interviewer wanted O(1). The best solution is something related to bucket hashing.
It is related to a special use of hash table. How would hash a range of things together?
Literally she asked how to design a hash table so that it's quicker to search for a range (e.g. hash table has numbers as key)
You might get a binary heap related question instead of this though.. I answered a hash table question wrong in the first round, which might be the reason for them to ask more hash table questions since they want to test on your weakest ability.
Okay did u make it to the final round ?
What is the weird data structure question?
The idea is to use a Table built on a a BST. Search up TreeMap, or RangeTree.