Birlasoft Ltd. interview experience Real time questions & tips from candidates to crack your interview
Graduate Trainee
Birlasoft Ltd.
4 rounds | 5 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 6 months
Topics: SQL, OOPS, Data Structures, Algorithms, CORE JAVA
Tip 1 : Solve as many aptitude and coding problems as you can before the interview.
Tip 2 : Revise the syntax of the Programing Language which you mentioned in your resume
Tip 3 : Mention your project and your role in that project in resume.
Tip 4 : Work on your Communication Skills before giving interview.
Tip 5 : Make sure you convey your intentions clearly to interviewer.
Application process
Where: Campus
Eligibility: 7 CGPA
Tip 1 : Mentioned your Projects and your role in that projects.
Tip 2 : Mention your programming skills in your resume.
Tip 3 : Mention your extracurricular activities or the internships if or any other certifications you have done.
Interview rounds
01
Round
Easy
Online Coding Interview
Duration90 minutes
Interview date4 Sep 2019
Coding problem2
1. Longest Subarray With Zero Sum
Moderate
0/80
Asked in company
Ninja is given an array ‘Arr’ of size ‘N’. You have to help him find the longest subarray of ‘Arr’, whose sum is 0. You must return the length of the longest subarray whose sum is 0.
For Example:
For N = 5, and Arr = {1, -1, 0, 0, 1},
We have the following subarrays with zero sums:
{{1, -1}, {1, -1, 0}, {1, -1, 0, 0}, {-1, 0, 0, 1}, {0}, {0, 0}, {0}}
Among these subarrays, {1, -1, 0, 0} and {-1, 0, 0, 1} are the longest subarrays with their sum equal to zero. Hence the answer is 4.
Problem approach
Below is solution of the code :
import java.util.Set;
import java.util.HashSet;
class Main
{
// Function to check if subarray with zero-sum is present in a given array or not
public static Boolean hasZeroSumSubarray(int[] nums)
{
// create an empty set to store the sum of elements of each
// subarray `nums[0…i]`, where `0 <= i < nums.length`
Set set = new HashSet<>();
// insert 0 into the set to handle the case when subarray with
// zero-sum starts from index 0
set.add(0);
int sum = 0;
// traverse the given array
for (int value: nums)
{
// sum of elements so far
sum += value;
// if the sum is seen before, we have found a subarray with zero-sum
if (set.contains(sum)) {
return true;
}
// insert sum so far into the set
set.add(sum);
}
// we reach here when no subarray with zero-sum exists
return false;
}
public static void main (String[] args)
{
int[] nums = { 4, -6, 3, -1, 4, 2, 7 };
if (hasZeroSumSubarray(nums)) {
System.out.println("Subarray exists");
}
else {
System.out.println("Subarray does not exist");
}
}
}
2. Distinct Subsequences
Easy
0/40
Asked in companies
Given two strings S and T consisting of lower case English letters. The task is to count the distinct occurrences of T in S as a subsequence.
A subsequence is a sequence generated from a string after deleting some or no characters of the string without changing the order of the remaining string characters. (i.e. “ace” is a subsequence of “abcde” while “aec” is not).
For example, for the strings S = “banana” and T=”ban”, output is 3 as T appears in S as below three subsequences.
[ban], [ba n], [b an ]
02
Round
Easy
Group Discussion
Duration30 minutes
Interview date4 Sep 2019
Coding problem1
1. Group Discussion
What are your views on the increasing demand of Chinese goods despite having a low quality?
03
Round
Easy
Face to Face
Duration45 minutes
Interview date4 Sep 2019
Coding problem1
1. DBMS Questions
1. What is DBMS, and what is its utility? Explain RDBMS with examples.
2. What is a Database?
3. Mention the issues with traditional file-based systems that make DBMS a better choice?
04
Round
Medium
HR Round
Duration30 minutes
Interview date4 Sep 2019
Coding problem1
1. Basic HR Questions
1. Tell me about yourself.
2. What are your greatest strengths and weaknesses?
3. Why do you want to work for our company?
4. How would you rate yourself on a scale of 1 to 10?
5. Why should we hire you?
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
What is recursion?
Choose another skill to practice
Similar interview experiences
Senior Software Engineer
3 rounds | 7 problems
Interviewed by Birlasoft Ltd.
Selected 
1637 views
0 comments
0 upvotes
Senior Consultant
3 rounds | 8 problems
Interviewed by Birlasoft Ltd.
Selected 1168 views
0 comments
0 upvotes
Software Engineer
3 rounds | 3 problems
Interviewed by Birlasoft Ltd.
Selected 904 views
0 comments
0 upvotes
Software Engineer
1 rounds | 1 problems
Interviewed by Birlasoft Ltd.
Selected 3246 views
0 comments
0 upvotes