Sharechat Interview Expereince SDE INTERN BACKEND — REJECT

Revision en1, by tarun_1801, 2022-05-25 09:10:33

There was a opening in Sharechat regarding an SDE Backen Intern . I applied through a referral. I got the test link the very next day. Test was conducted on Hackerearth and had three questions -Easy, Medium , and Hard. I was able to solve Easy and Medium questions.

The link to the questions is : link This Folder contains only 2 questions Medium and Hard . Easy question was like a BCD display you have to tell the minimum toggle if you want to display the number.

Surprisingly I got the call for next round. HR called me to ask if I can immediately join and scheduled my interview the very next day . My interview was scheduled at 5 pm.

Second Round : We started by introducing ourselves . He told this round would be around for 45 mins to 1 hr. He would ask me two questions if the time permits . He send me a codebunk link and ask to generate a room and send back the room link to him . He started with the first question :

Given a dictionary, a method to do lookup in dictionary and a M x N board where every cell has one character. Find all possible words that can be formed by a sequence of adjacent characters.
Note that we can move to any of 8 adjacent characters, but a word should not have multiple instances of same cell.
Example :
Input: dictionary[] = {"SHARE", "CHAT", "MOJ", "SHARECHAT"};
boggle[][]   = {{'S', 'C', 'E'},
{'H', 'H', 'R'},
{'A', 'T', 'A'}};

Desired Output :
SHARE
CHAT
SHARECHAT


We started the discussion I told that it was a graph problem . He wanted a production ready code. (I had not solved graph questions before the interview ever). If the problem statement is unclear to you, visit this link But I told the basic approaches. He wanted me to optimise it but I couldn't . As a result I was rejected after this round.

Hope this helps in your interview preparation.

#### History

Revisions

Rev. Lang. By When Δ Comment
en1 tarun_1801 2022-05-25 09:10:33 2219 Initial revision (published)