Unthinkable Solutions Interview Questions, Process, and Tips

3 questions, 60 mins, DSA

Q1. DSA QUESTIONS: Strings, Arrays, Linked List
Add your answer
Q2. Matrix question
Add your answer

Q1. Interview. All questions were asked from my resume
Add your answer

Hacker earth DSA questions

Q1. Find loop in linked list
Ans. 
Use Floyd's Tortoise and Hare algorithm to find a loop in a linked list.
• Initialize two pointers, slow and fast, at the head of the linked list.

• Move slow pointer by one step and fast pointer by two steps.

• If they meet at some point, there is a loop in the linked list.
Answered by AI
Add your answer
Q2. Longest common substring
Ans. 
Finding the longest common substring among a set of strings.
• Iterate through all substrings of the first string and check if they are present in all other strings.

• Keep track of the longest common substring found so far.

• Return the longest common substring.
Answered by AI
Add your answer

Test was 2 hours long and had medium to difficult level question.

Q1. Main questions are from your resume and on the basis of your project.
Add your answer

Q1. Questions on oops
Add your answer
Q2. 3 coding questions from array they were easy
Add your answer