Newgen Software interview experience Real time questions & tips from candidates to crack your interview
SDE - 2
Newgen Software
4 rounds | 8 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 3 Months
Topics: Data Structures, OOPS, Database Design, Spring Framework, REST APIs
Tip 1 : Prepare for data structures and algorithms. Practice questions from online coding platforms like- Coding Ninjas, GFG, LeetCode . Questions were more focused on String Manipulation, Arrays, and LinkedList.
Tip 2 : I applied for SDE-2 and had worked as a backend developer in my previous organization, so most questions were from previous work exp./Projects/Spring Framework/Database design.
Tip 3 : The candidate should have good communication skills.
Application process
Where: Other
Eligibility: 60% or above in graduation.
Tip 1 : Be thorough with your work done previously and don't claim any false information/skills on which you don't have a hold on.
Tip 2 : Include the previous year's work exp. (If any). Do mention roles and responsibilities in brief.
Interview rounds
01
Round
Medium
Telephonic
Duration30 minutes
Interview date23 Sep 2020
Coding problem3
It was a telephonic round, taken by a Tech Lead. He asked questions about Java Collections, SQL, previous organizations projects, and my roles and responsibilities as a backend developer.
1. DBMS Question
Write a query to fetch details of an employee with the second-highest salary in an organization excluding the CEO.
Problem approach
Tip 1: Do practice questions from the Hackerrank platform on SQL.
Tip 2: Try to optimize the SQL query for optimal performance.
2. DBMS Question
Write a query to return the last 4 characters of EmpName from the Employee table.
Problem approach
Tip 1: Do practice questions from the Hackerrank platform on SQL.
Tip 2: Try to optimize the SQL query for optimal performance.
3. Occurrence Of Each Word
Easy
10m average time
90% success
0/40
Asked in companies
You are given a string S of words. Your task is to count the occurrence of each word present in the string S. A word is a sequence of one or more non-space characters, and there can be multiple spaces between two words, and also there can be leading or trailing spaces in a string S.
For Example:
For the given string “what we think we become”
“what”,” think”, and “become” occurs 1 time, and “we” occurs 2 times in the given string.
Problem approach
Step 1: Declare a Hashmap in Java of {char, int}.
Step 2: Traverse in the string, check if the Hashmap already contains the traversed character or not.
Step 3: If it is present, then increase its count using the get() and put() function in Hashmap.
Step 4: Once the traversal is completed, traverse in the Hashmap and print the character and its frequency.
02
Round
Easy
Video Call
Duration60 minutes
Interview date24 Sep 2020
Coding problem3
It was a face-to-face technical round on MS Teams. The interviewer asked questions about Java 8, Spring Framework, Java Concurrency, and 3 coding problems.
1. Kth largest element in the unsorted array
Moderate
10m average time
90% success
0/80
Asked in companies
You are given an array consisting of 'N' distinct positive integers and a number 'K'. Your task is to find the kth largest element in the array.
Example:
Consider the array {2,1,5,6,3,8} and 'K' = 3, the sorted array will be {8, 6, 5, 3, 2, 1}, and the 3rd largest element will be 5.
Note:
1) Kth largest element in an array is the kth element of the array when sorted in non-increasing order.
2) All the elements of the array are pairwise distinct.
Problem approach
I solved this problem using Priority Queue.
Step 1 : Create a priority Queue and iterate through the array.
Step 2 : Add an element of the array to the priority queue.
Step 3 : if the size of the queue is greater than K, then poll().
Step 4 : finally poll() the element once the loop is finished.
2. DBMS Question
Difference between Left Join, Right Join, Full Join, Self Join.
3. Rotate array
Easy
25m average time
80% success
0/40
Asked in companies
Given an array 'arr' with 'n' elements, the task is to rotate the array to the left by 'k' steps, where 'k' is non-negative.
Example:
'arr '= [1,2,3,4,5]
'k' = 1 rotated array = [2,3,4,5,1]
'k' = 2 rotated array = [3,4,5,1,2]
'k' = 3 rotated array = [4,5,1,2,3] and so on.
Problem approach
I solved this problem using recursion.
Optimize the problem by k = k % arr.length
Step 1: Reverse array from 0,k-1
Step 2: Reverse array from k, array length - 1
Step 3: Reverse the whole array.
03
Round
Easy
HR Round
Duration20 minutes
Interview date26 Sep 2020
Coding problem1
CTC discussion with the Hiring Manager and other joining formalities.
1. Basic HR Questions
Why should we hire you?
Who is your Role Model?
04
Round
Easy
Assignment
Duration30 minutes
Interview date29 Sep 2020
Coding problem1
1. Assessment
This was an online psychometric assessment to assess team fitment.
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
SDE - 1
3 rounds | 6 problems
Interviewed by Newgen Software
Selected 
1210 views
0 comments
0 upvotes
Software Engineer
3 rounds | 6 problems
Interviewed by Newgen Software
Selected 1908 views
0 comments
0 upvotes
SDE - 1
2 rounds | 7 problems
Interviewed by Newgen Software
Rejected
997 views
0 comments
0 upvotes
Software Engineer
3 rounds | 6 problems
Interviewed by Newgen Software
Selected 1181 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 2
3 rounds | 4 problems
Interviewed by HashedIn
Selected 9698 views
0 comments
0 upvotes
SDE - 2
3 rounds | 4 problems
Interviewed by Arcesium
Selected 1827 views
0 comments
0 upvotes
SDE - 2
3 rounds | 4 problems
Interviewed by HashedIn
Selected 1937 views
0 comments
0 upvotes