Sheopals Interview Questions and Answers

Round duration - 60 minutes
Round difficulty - Easy

Round duration - 50 minutes
Round difficulty - Easy

Round duration - 60 minutes
Round difficulty - Easy

At the beginning of this round, the interviewer asked me about the data structures I knew. Linked lists, trees, graphs, arrays etc. was my answer. He asked me how well I knew Dynamic Programming. I said I wasn’t strong in that and he said that he would ask me a question on dynamic programming for sure.

Round duration - 40 minutes
Round difficulty - Easy

The interviewer asked me if I was comfortable with the interview process so far and how the previous interviews were. I said it was good and he gave me the first problem to solve.

Round duration - 60 minutes
Round difficulty - Easy

The interviewer asked me some Com­puter Sci­ence‍ fundamentals in this round as well as some behavioural questions.

Q1. Implement a Trie data structure and write functions to insert and search for a few words in it.
Ans. 
Implement a Trie data structure with insert and search functions.
• Create a TrieNode class with children and isEndOfWord attributes.

• Implement insert function to add words by iterating through characters.

• Implement search function to check if a word exists by traversing the Trie.

• Example: Insert 'apple', 'banana', 'orange' and search for 'apple' and 'grape'.
Answered by AI
Add your answer