Nucleus Software interview experience Real time questions & tips from candidates to crack your interview
Software Engineer
Nucleus Software
3 rounds | 7 Coding
problems
Selected Interview preparation journey
Journey
Being a student of B.Tech Computer Science I had a passion for coding and development which eventually helped me get this offer. I prepared for problem-solving on online coding platforms and developed some projects in domains such as Web Development, Android Development, and Machine Learning which were also key players in getting this offer.
Application story
I came to know about Nucleus Software from Linkedin then on researching about it I came to the Careers Page where I filled out the form for the role of Associate Software Engineer hiring batch 2023. After filling out the form, after almost 2 weeks I received an online test invite.
Why selected/rejected for the role?
I was selected for the above role after clearing the interview. The interviewer was happy with my answers and also my logical reasoning and thinking skills.
Preparation
Duration: 6 months
Topics: Problem Solving covering topics of DSA (Arrays, Strings, Linked List, Binary Trees, Binary Search Tree, Graphs, Greedy Approach, Algorithms, Dynamic Programming), OOPs, Computer Networks, Database Management System (DBMS), Java, CPP, Python
Tip 1: Prepare some good projects and have confidence in what you have done in the project
Tip 2: Have good communication skills and confidence while answering the questions
Tip 3: Never argue rudely, always be polite to the interviewer
Application process
Where: Company Website
Eligibility: The eligibility criteria were quite simple and straight forward. The ask was 60% in all 10ths, 12th and Graduation.
Tip 1: Include strong and relevant projects, such as those involving trending technologies like ReactJS and Machine Learning.
Tip 2: Be honest about your skills. Only include those in which you are confident.
Interview rounds
01
Round
Medium
Online Coding Interview
Duration75 minutes
Interview date26 Oct 2022
Coding problem2
This was an online round which consisted of 3 sections:
Section 1 – Cognitive Ability – 30 Questions
Section 2 – Hands on programming – 1 question (language – C, C++ or Java)
Section 3 – Technical MCQs – 15 Questions
and the total durattion for this round was 75 minutes.
The test window was open from 10:00 a.m. in the morning till 4:00 p.m. in the evening.
The MCQs were easy to moderate level and the coding question was also moderate level.
1. Minimum Steps
Moderate
20m average time
80% success
0/80
Asked in companies
You are given an array ‘ARR’ consisting of ‘N’ integers. Your task is to make all the numbers equal. You decrease one of the largest numbers present in the array into a number that is just lower than the maximum number in one step.
For example:
You are given ‘ARR’ = [5, 2, 3]
In the first step, you can change 5 to 3, so the new array is [3, 2,3].
In the second step, you can change the 3 to 2, then the array is [2, 2,3].
In the third step, you can change the 3 to 2, then the array is [2, 2, 2]
Hence the answer is 3.
Problem approach
int minSteps(int i, int j, int arr[][n])
{
if (i == n - 1 and j == n - 1)
return 0;
if (i > n - 1 || j > n - 1)
return 9999999;
if (v[i][j])
return dp[i][j];
v[i][j] = 1;
dp[i][j] = 1 + min(minSteps(i + arr[i][j], j, arr),
minSteps(i, j + arr[i][j], arr));
return dp[i][j];
}
This was the solution I wrote for th given problem statement. It passed all the 12 test cases.
In this solution I covered the base case that we have reached the target position and for this return 0, then if index goes out of the range of the matrix then return INT_MAX or 9999999(so that it is never minimum), then i checked if i have previosuly visited this element or not in my visited array. If I have previously visited it then return the value then return the value else mark this index as visited and set the value at this index using the recursive function calls and minimum functions.
This was my basic approach using Dynamic Programming.
2. Check Permutation
Easy
15m average time
85% success
0/40
Asked in companies
You have been given two strings 'STR1' and 'STR2'. You have to check whether the two strings are anagram to each other or not.
Note:
Two strings are said to be anagram if they contain the same characters, irrespective of the order of the characters.
Example :
If 'STR1' = “listen” and 'STR2' = “silent” then the output will be 1.
Both the strings contain the same set of characters.
Problem approach
Anagram Strings are those strings in which the frequency of each character in both string remains same.
For example, "ADD" and "DAD" have same frequency of "A" as 1 and "D" as 2 in both the strings.
So for this the brute force approach is to sort both the strings and then check if they are equal or not.
I used the same approach and it passed all the test cases.
Als we can handle a corner case seperately that if strings are not of equal length then they are not anagram so no need to sort them.
bool areAnagram(string str1, string str2)
{
int n1 = str1.length();
int n2 = str2.length();
if (n1 != n2)
return false;
sort(str1.begin(), str1.end());
sort(str2.begin(), str2.end());
for (int i = 0; i < n1; i++)
if (str1[i] != str2[i])
return false;
return true;
}
This is the code for the problem which checks whether two strings are anagram or not.
02
Round
Medium
Video Call
Duration60 minutes
Interview date31 Oct 2022
Coding problem4
This was the first technical interview. This round of interviews was held online over Google Meet. The interviewer was quite experienced. The interview began with my introduction covering all topics such as basic intro, technical skills, projects, etc. Then I shared my internship experience and the project I did in that. After that, the interviewer began asking me questions in Java related to the topics of OOPs.
1. Check If Linked List Is Palindrome
Easy
15m average time
85% success
0/40
Asked in companies
You are given a Singly Linked List of integers. You have to return true if the linked list is palindrome, else return false.
A Linked List is a palindrome if it reads the same from left to right and from right to left.
Example:
The lists (1 -> 2 -> 1), (3 -> 4 -> 4-> 3), and (1) are palindromes, while the lists (1 -> 2 -> 3) and (3 -> 4) are not.
2. OOPs Questions
Problem approach
Tip 1: Prepare the theory and understand the concepts
Tip 2: In the interview, explain with some examples
3. DBMS Questions
Problem approach
Tip 1 : Prepare the theory of the DBMS
Tip 2 : Understand the concepts and relate them with some real-life examples
4. Puzzle
There is a lion, grass, a goat, and a boat. Now we have to take them to the other side of the river. We can take only two at a time while considering the condition that we cannot leave grass and goat together, else the goat will eat it, and similarly, we cannot leave goat and lion together; otherwise, the lion will eat the goat. This was the problem. I took a couple of minutes, and then I answered it correctly.
03
Round
Easy
HR Round
Duration20 minutes
Interview date12 Aug 2023
Coding problem1
Basic behavioural questions were discussed.
1. Basic HR Questions
Tell us about yourself.
What do you know about our company's products and services?
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
Associate Software Engineer
2 rounds | 3 problems
Interviewed by Nucleus Software
Selected 
1332 views
0 comments
0 upvotes
Associate Software Engineer
3 rounds | 4 problems
Interviewed by Nucleus Software
Selected 1205 views
0 comments
0 upvotes
Software Engineer
3 rounds | 3 problems
Interviewed by Nucleus Software
Selected 1231 views
0 comments
0 upvotes
Associate Software Engineer
3 rounds | 3 problems
Interviewed by Nucleus Software
Selected 1788 views
0 comments
0 upvotes
Companies with similar interview experiences
Software Engineer
4 rounds | 1 problems
Interviewed by Newgen Software
Selected 3210 views
2 comments
0 upvotes
Software Engineer
3 rounds | 6 problems
Interviewed by HashedIn
Selected 2583 views
0 comments
0 upvotes
Software Engineer
2 rounds | 2 problems
Interviewed by Ernst & Young (EY)
Selected 0 views
0 comments
0 upvotes