Unthinkable Solutions Interview Questions, Process, and Tips

It was a coding round of 3 question , 1st was to print a specific pattern 2nd was similar to famous leetcode problem rain water and 3rd was to convert postfix expression to infix using stack

Q1. Similar to leecode 3sum problem
Add your answer
Q2. Similar to leetcode combination sum -3
Add your answer

Q1. Java opps concept
Add your answer

Q1. General testing concepts and process
Add your answer

Q1. Deep test cases and project discussion
Add your answer

Q1. All personality and behavioral related question and salary discussion
Add your answer

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