Forsys

Forsys Interview Experience

Rejection

Forsys Interview Experience for Software Engineer

Role

Software Engineer

Experience

Fresher

Platform

Campus

Prep Duration

6 months

Eligibility / Offer Details

Above 8 CGPA, (Salary package: 7 LPA)

Branch

Computer Science Engineering

Total Rounds

3 Rounds

Application Process

I applied through our college’s placement drive after the company registration link was shared by the Training and Placement Cell. Once I submitted the form with my details, I received further updates about the process. The company conducted the initial assessments, shortlisted candidates, and then scheduled the interviews. The entire journey—from application to interview—was organized and communicated clearly through the placement cell.

Topics Prepared

Data StructuresPointersDBMSOOPSDynamic Programming

Resume Tips

Tip 1: Keep your resume clear and concise—highlight only relevant skills and projects.

Tip 2: Add measurable achievements to your projects.

Preparation Tips

Tip 1: Practice coding regularly and solve at least 150–200 problems to build confidence.

Tip 2: Revise core subjects like OOPS, DBMS, OS, and CN before interviews.

Tip 3: Build at least one good project to showcase your practical skills.

Interview Rounds (3)

Detailed breakdown of each evaluation round, questions asked, and candidate approaches.

Round 1

Interview Round 1 — Online Coding Interview

Duration: 90 minutes | Difficulty: Medium | Outcome: ClearedMEDIUM

Problems in Round: 1

Problem: Longest Subarray With Sum K

You are given an array 'a' of size 'n' and an integer 'k'. Find the length of the longest subarray of 'a' whose sum is equal to 'k'. Example : Input: ‘n’ = 7 ‘k’ = 3 ‘a’ = [1, 2, 3, 1, 1, 1, 1] Output: 3 Explanation: Subarrays whose sum = ‘3’ are: [1, 2], [3], [1, 1, 1] and [1, 1, 1] Here, the length of the longest subarray is 3, which is our final answer. Input Format : The first line contains two integers, ‘n’ and ‘k’, denoting the size of array ‘a’ and the integer ‘k’. The following line contains ‘n’ integers, denoting the array ‘a’. Output format : Print the length of the longest subarray whose sum is equal to ‘k’. Note : You do not need to print anything; it has already been taken care of. Just implement the given function.

Step 1: I first tried a brute-force approach using two nested loops to check all possible subarrays. It worked for small inputs, but the time complexity was too high (O(n²)), so it wasn’t efficient. Step 2: After reviewing the constraints, I realized I needed to optimize the approach. I looked for a way to avoid recalculating sums repeatedly. Step 3: I then used the prefix-sum + HashMap technique. By storing the earliest occurrence of each prefix sum, I was able to check if a subarray with sum K existed in constant time. Step 4: This optimized approach reduced the time complexity to O(n), and it handled negative numbers as well. The solution became efficient, and I successfully found the longest subarray with sum K.

Problem Metadata

Problem Type: CODE

Average Solve Time: 20 minutes

Success Rate: 75%

Maximum Score: 40

Practice Topics: Two Pointers, Arrays

Test Cases: 5

Default Language: js

Round 2

Interview Round 2 — Face to Face

Duration: 60 minutes | Difficulty: Medium | Outcome: ClearedMEDIUM

Problems in Round: 1

Problem: DBMS

What is a Database? (Learn) What is DBMS? (Learn) Difference between DBMS and RDBMS. (Learn) What are primary key, foreign key, and unique key? (Learn) What is normalization? Explain 1NF, 2NF, 3NF, BCNF. (Learn) What is denormalization and when is it used? (Learn) Explain ACID properties in a transaction. (Learn)

Tip 1: Understand concepts, not just definitions — try to explain with examples, as interviewers often ask scenario-based questions. Tip 2: Practice SQL queries regularly — focus on joins, subqueries, aggregation, grouping, and complex queries. Tip 3: Solve previous interview questions on DBMS and OS to get familiar with common patterns.

Round 3

Interview Round 3 — HR Round

Duration: 30 minutes | Difficulty: Easy | Outcome: ClearedEASY

Problems in Round: 1

Problem: HR Questions

Tell us about your background and education. What are your strengths and weaknesses? What are your career aspirations? Why are you interested in this role? Tell us about a challenging and a teamwork experience that you handled.

Tip 1: Be honest and confident while answering questions about yourself. Avoid exaggeration. Tip 2: Prepare short and structured answers for common questions like strengths, weaknesses, and career goals. Tip 3: Give real-life examples for behavioural questions (teamwork, handling challenges, achievements).