HashedIn Interview Experience | Software Engineer | Sep 2019

Round 1 : It had 2 sections.
Section A :
It was having 2 Output based questions, 2 questions on Data Structures, 2 on OS and 2 on DBMS.

Section B :
It had 3 Programming Questions.
1. Problem : Given 2 Strings str and word, you have to find how many words can you make from that given string.
Input : str=”This is a test string” word=”tsit”
Output : 2
Explanation : there are 4 t’s 4 s’s 3 i’s in the given str, by which you can only make 2 “tsit”.
Input: str=”Here is HashedIn Technologies” word=”neurons”
Output : 0
Explanation: since you do not have ‘u’ in str. thus u can’t form word “neurons”.
2. Problem : Given a 2D matrix of 0s and 1s, you have to find number of potholes in that. Potholes are defined as all neighbouring 1s(including diagonals).
Input :
1 1 0 0 0
0 1 0 0 1
1 0 0 0 1
0 0 0 0 0
1 0 1 0 1
Output : 5
Explanation: follow the bold 1s, there are 5 such potholes.
1 1 0 0 0
0 1 0 0 1
1 0 0 0 1
0 0 0 0 0
1 0 1 0 1
3. Based on Topological Sort. Can’t remember the exact question.

Round 2 :
They asked only 2 questions but it took an hour approx. But the interviewer as very supportive and gave hints few times.

Problem 1 : You are having an old NOKIA phone and you are given a string of integers and “*” only. You have to find the mess typed.
Input : 2222*444*5
Output: “AIJ”
Input : 222*2*8
Output: “CAT”

Problem 2 : You are given a Binary Tree, you have to find a path such that the sum of element of the nodes in a path results to a given number x.

Write your Interview Experience or mail it to contribute@geeksforgeeks.org



My Personal Notes arrow_drop_up

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.




Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.