Newgen Software interview experience Real time questions & tips from candidates to crack your interview
Software Engineer
Newgen Software
3 rounds | 6 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 12 months
Topics: Java, SQL, Data Structure, Networking, OOPS
Tip 1 : Focus on practicals, theory won't be enough.
Tip 2 : Get at least the basic of all topics.
Tip 3 : Revision before interview will be helpful.
Application process
Where: Campus
Eligibility: 80% in Graduation
Tip 1 : Highlight your strengths.
Tip 2 : Mention a detailed description of the Project.
Interview rounds
01
Round
Medium
Online Coding Interview
Duration60 minutes
Interview date17 Nov 2020
Coding problem3
It was scheduled in evening. It was set up on HirePro enviornment, where it was online proctored. We had option to talk to proctors in case anything was required. It was not a interview round.
1. Theory Question
Which of these is not one of the pillars of OOPS?
What do you understand by data encapsulation?
Problem approach
Tip 1 : Be calm
Tip 2 : Read questions twice as sometimes they twist the language.
2. Tweaked Array
Easy
10m average time
90% success
0/40
Asked in companies
You are given an array ‘ARR’ of size ‘N’ consisting of integers. The array needs to be tweaked a little bit.
Firstly, calculate ‘TotalSum’ = ‘ARR[0]’ + ‘ARR[1]’ + ... + ‘ARR[N - 1]’.
Now, for every ‘i’ (0 <= ‘i’ <= ‘N’ - 1), ‘ARR[i]’ is replaced with ‘ARR[i]’ = ‘TotalSum’ - ‘ARR[i]’.
Output the final array after tweaking it.
Example :
'N' = 3
'ARR' = {2, 4, 1, 1}
TotalSum = 2 + 4 + 1 + 1 = 8
Tweaked Array = {6, 4, 7, 7}.
3. Verify Preorder Sequence in Binary Search Tree
Moderate
30m average time
70% success
0/80
Asked in companies
You are given an array/list ‘ARR’ consisting of ‘N’ distinct integers. You need to check whether ‘ARR’ can represent the Preorder Traversal of a Binary Search Tree.
You should return true if ‘ARR’ can represent Preorder Traversal of a Binary Search Tree, otherwise return false.
Example:
Consider ‘ARR’ = [40, 30, 35, 80, 100]. You can see that it is the preorder traversal of the Binary Search Tree shown above.
Thus, we should return true in this case.
02
Round
Medium
Video Call
Duration60 minutes
Interview date1 Dec 2020
Coding problem2
It was a interview round scheduled as per the slots that we had to choose. So basically we had options to give it at slot that is comfortable to us. It happened on HirePro environment. Interviewer was a calm person. She gave enough time to think after each question.
1. Move Zeroes to End
Easy
0/40
Asked in companies
Given an unsorted array of integers, you have to move the array elements in a way such that all the zeroes are transferred to the end, and all the non-zero elements are moved to the front. The non-zero elements must be ordered in their order of appearance.
For example, if the input array is: [0, 1, -2, 3, 4, 0, 5, -27, 9, 0], then the output array must be: [1, -2, 3, 4, 5, -27, 9, 0, 0, 0].
Expected Complexity: Try doing it in O(n) time complexity and O(1) space complexity. Here, ‘n’ is the size of the array.
Problem approach
Step 1 : I suggested that sorting will solve this problem but the interview asked me to consider other approaches.
Step 2 : Then I suggested we need to traverse the whole array and find an exact number of zeroes.
Step 3 : As now we will be having a total number of zeroes and the size of the array, I can find a total number of 1s.
Step 4 : Now again we need to traverse the array and based on the of zeroes, we need to start changing the values to zero once we have placed all the zeroes then for the remaining array we will have to change values to 1.
Step 5 : So in this approach problem is solved in maximum O(n) time complexity.
2. Triangle Number Pattern
Easy
0/40
Asked in company
Print the following pattern for the given N number of rows.
Pattern for N = 4
1
22
333
4444
Problem approach
Step 1 : For this kind of problem, it is important to understand the pattern. I observed that with each line no of stars were increasing then it reached to max value and then started to decrease.
Step 2 : As star pattern is a very popular question asked during an interview, I was prepared for it. I knew nested loops are required.
Step 3 : I started coding. I started the outer loop that will control the number of lines that we are going to print.
Step 4 : Then I created one inner loop to print stars according to the required pattern.
Step 5 : It's important to understand corner cases in this kind of question like if n is 0 or 1, we need to control that.
Step 6 : So after I wrote the code and executed it. The interviewer asks me to tell the complexity of this code. I told as it is a nested loop time complexity will be O(n^2).
03
Round
Easy
HR Round
Duration15 minutes
Interview date10 Dec 2020
Coding problem1
The interview was scheduled for the afternoon.
Basic questions about projects that I have done were asked. The interviewer was friendly and gave the option to ask him about the company.
1. Basic HR Questions
Tell us about your project.
Why should we hire you?
Problem approach
Tip 1 : Be honest
Tip 2 : Be calm.
Tip 3 : Don't include too technical terms as it is an HR interview.
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 remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
Software Engineer
3 rounds | 4 problems
Interviewed by Newgen Software
Selected 
1045 views
0 comments
0 upvotes
Software Engineer
3 rounds | 5 problems
Interviewed by Newgen Software
Selected 1009 views
0 comments
0 upvotes
Software Engineer
3 rounds | 6 problems
Interviewed by Newgen Software
Selected 1908 views
0 comments
0 upvotes
Software Engineer
2 rounds | 3 problems
Interviewed by Newgen Software
Selected 163 views
0 comments
0 upvotes
Companies with similar interview experiences
Software Engineer
3 rounds | 6 problems
Interviewed by HashedIn
Selected 2644 views
0 comments
0 upvotes
Software Engineer
2 rounds | 2 problems
Interviewed by Ernst & Young (EY)
Selected 0 views
0 comments
0 upvotes
Software Engineer
4 rounds | 8 problems
Interviewed by Arcesium
Selected 1414 views
0 comments
0 upvotes