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-1. 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: 2 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: No backlogs
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 Interview
Duration60 minutes
Interview date16 Mar 2022
Coding problem2
1. Maximum subarray sum
Moderate
25m average time
75% success
0/80
Asked in companies
Given an array of numbers, find the maximum sum of any contiguous subarray of the array.
For example, given the array [34, -50, 42, 14, -5, 86], the maximum sum would be 137, since we would take elements 42, 14, -5, and 86.
Given the array [-5, -1, -8, -9], the maximum sum would be -1.
Follow up: Do this in O(N) time.
2. Intersection of two linked lists
Easy
25m average time
73% success
0/40
Asked in companies
You are given two Singly Linked Lists of integers, which may have an intersection point.
Your task is to return the first intersection node. If there is no intersection, return NULL.
Example:-
The Linked Lists, where a1, a2, c1, c2, c3 is the first linked list and b1, b2, b3, c1, c2, c3 is the second linked list, merging at node c1.
02
Round
Easy
HR Round
Duration30 minutes
Interview date23 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
How do you select an element by class name in CSS?
Choose another skill to practice
Similar interview experiences
SDE
2 rounds | 2 problems
Interviewed by Softcrylic Technology Solutions India Private Ltd.
Selected 
572 views
0 comments
0 upvotes
SDE
2 rounds | 3 problems
Interviewed by Softcrylic Technology Solutions India Private Ltd.
Selected 549 views
0 comments
0 upvotes
SDE
1 rounds | 2 problems
Interviewed by Softcrylic Technology Solutions India Private Ltd.
Rejected
589 views
0 comments
0 upvotes
SDE
2 rounds | 3 problems
Interviewed by Softcrylic Technology Solutions India Private Ltd.
Selected 572 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
1264 views
0 comments
0 upvotes
SDE
2 rounds | 6 problems
Interviewed by Tata Consultancy Services (TCS)
Selected 1796 views
0 comments
0 upvotes