NexGen Technologies Interview Questions, Process, and Tips

Q1. General questions about you
Add your answer

Q1. General questions about the company
Add your answer

Q1. Department lead will take a interview
Add your answer

Q1. Department manager will take a interview
Add your answer

Q1. Department head take interview
Add your answer

Q1. Management level interview
Add your answer

Q1. Tell me something about yourself ?
Add your answer
Q2. How many years experience do you have?
Add your answer
Q3. Tell me something about your skills
Add your answer
Q4. Which platform do you use for recruiting?
Add your answer

I had to find right candidates according to job description and I had to create one job description.

Q1. Not much, hr will ask your introduction Previous company experience or if you are fresher so strength weeknes
Add your answer

Some analytical questions

Q1. Face to face round, checking about process knowledge
Add your answer
Q2. How much knowledge about procurement and Market research
Ans. 
The candidate should have a strong knowledge of procurement and market research.
• The candidate should be familiar with procurement processes and strategies.

• They should have experience in conducting market research and analyzing data.

• Knowledge of supplier management and negotiation skills is important.

• Understanding market trends and competitive analysis is necessary.

• Proficiency in using procurement software and tools is
Answered by AI
Add your answer
Q3. Same , checking knowledge about procurement and Market research
Add your answer

Q1. Same face to face
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

The round consisted of 2 coding Problems and it lasted for 60 minutes from 12:00 PM to 1:00 PM on Hackerearth.
Use of other IDEs was prohibited and video was on.

Q1. 
Ninja's Lootcase Problem Statement
Ninja stumbled upon a locked suitcase while digging in his lawn. The only way to unlock it is by following specific instructions stated on an accompanying paper.
Explan...read more
Ans. Recursive Approach
The idea here is that we can say that number of increment operations required are equal to the number of set bits present in the elements of a given array because in one operation you can double all elements of the array. To get an even number you need to get even / 2 i.e. half of the number. So we need Increment operations only when our current element is odd
 and in all other cases, we can divid...read more
Answered Anonymously
Add your answer
Q2. 
Problem: Search In Rotated Sorted Array
Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer Q queries. Each query is represented by an integer Q[i], and you must ...read more
Ans. Brute Force Approach
The idea here is to do a linear approach which apparently is a brute force way to do this.
• Visit every element one by one.
• Check if the current element that you are looking at is the key value that needs to be searched. If the element is found, return the index at which you find it.
• Once all the elements are visited and you don't find the key-value, return -1.
Space Complexity: O(1)Explanation:
O(1)
&nbs...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The round was conducted on Google Meet with 2 interviewers . They were friendly and helpful.
The timing was 12:00 to 1:00 PM.
Our Video was on .

Q1. 
Pair Sum Problem Statement
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Note:
...read more
Ans. Brute Force
• Initialize a list to store our results.
• For each element in the array 'ARR[i]', check if ('ARR[i]' + ‘ARR[j]’), equals to given sum or not, where ‘i’ < ‘j’ < ‘N’.
• If the condition matches, add the pair('ARR[i]', ‘ARR[j]’) to the list. Sort the list of pairs as per the given output format and return this list.
Space Complexity: O(1)Explanation:
O(1).
 
Constant extra space is required.
Time Complexity: O...read more
Answered Anonymously
Add your answer
Q2. 
Count Ways to Reach the N-th Stair Problem Statement
You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...read more
Ans. Brute Force
One basic approach is to explore all possible steps which can be climbed with either taking one step or two steps. So at every step, we have two options to climb the stairs either we can climb with one step, or we can climb with two steps. So the number of ways  can be recursively defined as :
countDistinctWayToClimbStair ( currStep, N ) = countDistinctWayToClimbStair ( currStep+1, N ) + countDistinctWay...read more
Answered Anonymously
Add your answer

Round duration - 50 minutes
Round difficulty - Medium

This was a Behavioral Round. It lasted for 45-50 minutes. It consisted of a discussion on my projects. The interviewer was very impressed by the way I explained my projects. She even appreciated me in between for that. This was followed by normal HR questions .Timing of This round was 4:00 PM to 5:00 PM