Unthinkable Solutions interview experience Real time questions & tips from candidates to crack your interview
Software Engineer
Unthinkable Solutions
1 rounds | 1 Coding
problems
Rejected
Interview preparation journey
Journey
I started my preparation by building a strong foundation in Data Structures and Algorithms while simultaneously working on my core tech stack, especially Node.js and React.js. Initially, I focused on understanding concepts deeply rather than just solving problems. Over time, I gradually moved on to solving problems on coding platforms and practiced regularly to improve my problem-solving speed and accuracy.
Application story
I applied for the role through LinkedIn by submitting my application via the job posting. After a few days, I received a response from the company with details about the next steps in the hiring process. The first stage was an online coding assessment designed to evaluate problem-solving and DSA skills.
The overall process was smooth, and communication was clear throughout. The experience gave me a good understanding of the company’s expectations and the level of preparation required for coding rounds. Although I couldn’t progress further, it was a valuable learning experience and helped me identify areas for improvement.
Why selected/rejected for the role?
I was not able to clear the coding round, mainly due to time constraints and not fully optimizing my approach for the given problems. While I understood the logic, I struggled to implement efficient solutions within the limited time. This experience highlighted the importance of practicing more problems under timed conditions and improving my optimization skills.
Preparation
Duration: 3 months
Topics: Data Structures, Algorithms, Dynamic Programming, Graphs, System Design, Object-Oriented Programming (OOP), JavaScript, Node.js, React.js, Database Management Systems (DBMS)
Tip 1: Practice DSA consistently and focus on understanding patterns (not just solving questions).
Tip 2: Solve problems under time constraints to improve speed and accuracy for coding rounds.
Tip 3: Build and explain projects clearly to strengthen fundamentals and confidence during interviews.
Application process
Where: Linkedin
Eligibility: Above 7 CGPA, (Salary Package: 8 LPA)
Tip 1: Keep your resume concise (one page) and clearly highlight relevant skills, projects, and achievements.
Tip 2: Mention projects with proper details, including the tech stack and your exact contributions.
Interview rounds
01
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date11 Apr 2026
Coding problem1
1. Shortest Path in a Binary Matrix
Moderate
37m average time
65% success
0/80
Asked in companies
You have been given a binary matrix of size 'N' * 'M' where each element is either 0 or 1. You are also given a source and a destination cell, both of them lie within the matrix.
Your task is to find the length of the shortest path from the source cell to the destination cell only consisting of 1s. If there is no path from source to destination cell, return -1.
Note:
1. Coordinates of the cells are given in 0-based indexing.
2. You can move in 4 directions (Up, Down, Left, Right) from a cell.
3. The length of the path is the number of 1s lying in the path.
4. The source cell is always filled with 1.
For example -
1 0 1
1 1 1
1 1 1
For the given binary matrix and source cell(0,0) and destination cell(0,2). Few valid paths consisting of only 1s are
X 0 X X 0 X
X X X X 1 X
1 1 1 X X X
The length of the shortest path is 5.
Problem approach
Step 1: I first understood the problem and identified that it is a shortest path problem in a grid where movement is allowed in eight directions.
Step 2: I initially considered using DFS but realized it would not guarantee the shortest path and could be inefficient.
Step 3: I then switched to using Breadth-First Search (BFS), since BFS is ideal for finding the shortest path in an unweighted grid.
Step 4: I used a queue to traverse the grid level by level, marking visited cells to avoid revisiting and maintaining the current path length.
Step 5: For each cell, I explored all eight possible directions and added valid cells (within bounds and with value = 0) to the queue.
Step 6: When I reached the bottom-right cell, I returned the current path length as the answer.
Step 7: Finally, I handled edge cases such as when the starting or ending cell is blocked, returning -1 in those cases.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
Which data structure is used in the implementation of recursion?
Choose another skill to practice
Similar interview experiences
Software Engineer
5 rounds | 9 problems
Interviewed by Unthinkable Solutions
Selected 
1299 views
0 comments
0 upvotes
Associate Software Engineer
3 rounds | 4 problems
Interviewed by Unthinkable Solutions
Selected 1097 views
0 comments
0 upvotes
Associate Software Engineer
4 rounds | 8 problems
Interviewed by Unthinkable Solutions
Selected 611 views
0 comments
0 upvotes
Junior Associate
3 rounds | 4 problems
Interviewed by Unthinkable Solutions
Selected 726 views
0 comments
0 upvotes
Companies with similar interview experiences
Software Engineer
4 rounds | 1 problems
Interviewed by Newgen Software
Selected 3452 views
2 comments
0 upvotes
Software Engineer
3 rounds | 6 problems
Interviewed by HashedIn
Selected 2789 views
0 comments
0 upvotes
Software Engineer
2 rounds | 2 problems
Interviewed by Ernst & Young (EY)
Selected 0 views
0 comments
0 upvotes