10+ Newgen Software Technologies Interview Questions and Answers for Freshers

The task is to find the maximum number of non-crossing rope connections possible between houses on each bank of a river.

• Sort the arrays A and B in ascending order.

• Use dynamic programming to find the longest increasing subsequence between A and B.

• The length of the longest increasing subsequence is the maximum number of non-crossing connections.

Concatenate two linked lists alternatively

• Create a new linked list

• Traverse both linked lists simultaneously

• Alternate between adding nodes from each list to the new list

• If one list is longer than the other, add the remaining nodes to the end of the new list

System architecture for higher experience involves scalable and efficient design.

• Focus on scalability to handle increasing user load

• Use microservices architecture for flexibility and easy maintenance

• Implement caching mechanisms for faster response times

• Utilize load balancing to distribute traffic evenly across servers

Check if the binary representation of a given integer is a palindrome.

• Convert the integer to binary representation.

• Check if the binary representation is a palindrome by comparing it with its reverse.

• Return true if it is a palindrome, false otherwise.

Find the sum of the subarray with the maximum sum among all subarrays in a given array.

• Iterate through the array and keep track of the current sum and maximum sum seen so far.

• If the current sum becomes negative, reset it to 0 as it won't contribute to the maximum sum.

• Return the maximum sum as the result.

• Example: For input arr = [-2, 1, -3, 4, -1], the maximum subarray sum is 4.

Add two numbers represented as linked lists and return the sum as a linked list.

• Traverse both linked lists simultaneously while keeping track of carry

• Create a new linked list to store the sum

• Handle cases where one list is longer than the other

• Consider edge cases like carry at the end of addition

Given a sorted N * N matrix, find the position of a target integer 'X'.

• Iterate over each row and column to search for the target integer 'X'.

• Utilize the sorted nature of the matrix to optimize the search process.

• Return the position of 'X' if found, else return '-1 -1'.

Maximize vaccines administered on a specific day while adhering to rules.

• Distribute vaccines evenly over the days to maximize on the specific day.

• Ensure the difference in vaccines between consecutive days is at most 1.

• Keep track of the total vaccines administered to not exceed the maximum limit.

• Implement a function to calculate the maximum vaccines administered on the given day.

Check if a given string is a palindrome considering only alphanumeric characters.

• Remove non-alphanumeric characters from the input string.

• Convert the string to lowercase for case-insensitive comparison.

• Compare characters from start and end of the string to check for palindrome.

• Return 'true' if the string is a palindrome, otherwise 'false'.

Develop a function to remove all instances of a given character from a string.

• Create a function that takes the input string and character to be removed as parameters.

• Iterate through each character in the input string and only add characters that are not equal to the given character to a new string.

• Return the new string as the output.

• Handle edge cases such as empty input string or character.

• Example: Input string 'hello world' and character 'o' should return 'hell wrld'.

CPU scheduling algorithms determine the order in which processes are executed by the CPU.

• First Come First Serve (FCFS) - Processes are executed in the order they arrive.

• Shortest Job Next (SJN) - Process with the shortest burst time is executed next.

• Round Robin (RR) - Each process is given a small unit of time to execute in a cyclic manner.

• Priority Scheduling - Processes are executed based on priority levels assigned to them.

• Multi-Level Queue Scheduling - Processes are divided...read more