Softcrylic Technology Solutions India Private Ltd. interview experience Real time questions & tips from candidates to crack your interview
SDE
Softcrylic Technology Solutions India Private Ltd.
2 rounds | 3 Coding
problems
Selected Interview preparation journey
Journey
I started my coding journey from the second year of graduation. I asked and consulted seniors on how to start in my career. I started doing DSA. In starting it was not regular but from the seventh semester, I started practicing DSA on regular basis. Meanwhile I also learned Web Development in the last phase of third year. Than, I was ready to apply in different companies.
Application story
I got a message in my telegram group about the company visiting our campus for the hiring of SDE. As, I was in the fourth year, it was sure that I am going to apply for it. I started preparing accordingly and got selected at last.
Why selected/rejected for the role?
I think I was on point with my coding solutions to the questions asked in the interviews. I provided the optimal solutions and I was giving correct explanations to some theory questions asked.
Preparation
Duration: 3 Months
Topics: Data Structures, Algorithms, System Design, Aptitude, OOPS
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Application process
Where: Campus
Eligibility: NA
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Interview rounds
01
Round
Easy
Online Coding Test
Duration60 minutes
Interview date10 Mar 2022
Coding problem2
1. Minimum Path Sum
Moderate
15m average time
85% success
0/80
Asked in companies
Ninjaland is a country in the shape of a 2-Dimensional grid 'GRID', with 'N' rows and 'M' columns. Each point in the grid has some cost associated with it.
Find a path from top left i.e. (0, 0) to the bottom right i.e. ('N' - 1, 'M' - 1) which minimizes the sum of the cost of all the numbers along the path. You need to tell the minimum sum of that path.
Note:
You can only move down or right at any point in time.
2. Left View of binary tree
Moderate
30m average time
60% success
0/80
Asked in companies
You have been given a Binary Tree of 'n' nodes, where the nodes have integer values
Print the left view of the binary tree.
Example :
If the input tree is as depicted in the picture:
The Left View of the tree will be: 2 35 2
02
Round
Easy
HR Round
Duration30 minutes
Interview date17 Mar 2022
Coding problem1
1. Basic HR Questions
Introduce yourself
Why do you want to join us?
What are your hobbies?
What do you think makes you a better choice than the other candidates?
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
Which traversal uses a queue as its primary data structure?
Choose another skill to practice
Similar interview experiences
SDE
2 rounds | 2 problems
Interviewed by Softcrylic Technology Solutions India Private Ltd.
Selected 
590 views
0 comments
0 upvotes
SDE
1 rounds | 2 problems
Interviewed by Softcrylic Technology Solutions India Private Ltd.
Rejected
608 views
0 comments
0 upvotes
SDE
2 rounds | 3 problems
Interviewed by Softcrylic Technology Solutions India Private Ltd.
Selected 520 views
0 comments
0 upvotes
SDE
2 rounds | 3 problems
Interviewed by Softcrylic Technology Solutions India Private Ltd.
Selected 594 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE
3 rounds | 6 problems
Interviewed by PhonePe
Selected 0 views
0 comments
0 upvotes
SDE
2 rounds | 5 problems
Interviewed by Infosys
Rejected
1292 views
0 comments
0 upvotes
SDE
2 rounds | 6 problems
Interviewed by Tata Consultancy Services (TCS)
Selected 1838 views
0 comments
0 upvotes