NucleusTeq Software Developer Interview Questions, Process, and Tips

Q1. Oops, basic ,SQL ,ado
Add your answer

Curd operation with SQL connectivity

Communication skills and basic knowledge on java,

Q1. Why you preferred this job in genpact
Add your answer
Q2. Basically now a days genpact company is best in past all preferred for tcs, but in my servey genpact company is best because it gives best position for my life. Mostly i love this company where there is a ...read more
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

It was in the evening. Coding platform was good. There were 3 coding questions only in the screening round

Q1. Triple Sum
It was Todd’s Birthday, So Bojack decided to give Todd a Binary tree with ‘N’ nodes. But the binary tree was too big to keep in his house, so Bojack decided to give exactly three nodes from that...read more
Ans. 
The task is to determine if it is possible to select three nodes from a binary tree such that their sum equals a given value.
• Traverse the binary tree and store all the node values in an array

• Use three nested loops to iterate through all possible combinations of three nodes

• Check if the sum of the three nodes equals the given value

• If a valid combination is found, return True

• If no valid combination is found, return False
Answered by AI
View 3 more amswers
Q2.  Inorder Traversal
You have been given a Binary Tree of 'N' nodes, where the nodes have integer values. Your task is to find the In-Order traversal of the given binary tree.
For example :
For the...read more
Ans. 
The task is to find the in-order traversal of a given binary tree.
• Implement a recursive function to perform in-order traversal of the binary tree

• Start from the left subtree, then visit the root, and finally visit the right subtree

• Use an array to store the values of the nodes in the in-order traversal
Answered by AI
View 4 more amswers

Round duration - 45 minutes
Round difficulty - Medium

It was conducted in day time. Interviewer shared the jio's platform link where question was there and a function was there which I needed to complete while sharing my screen. Interviewer was very nice in behaviour

Q1. Check Whether Binary tree Is Complete
You are given a binary tree. Your task is to check whether the given binary tree is a Complete Binary tree or not.
A Complete Binary tree is a binary tree whose ever...read more
Ans. 
The task is to check whether a given binary tree is a complete binary tree or not.
• A complete binary tree is a binary tree where every level, except possibly the last, is completely filled.

• All nodes in the last level are placed at the left end.

• To check if a binary tree is complete, we can perform a level order traversal and check if any null nodes appear before all non-null nodes in the last level.

• If any null nodes appe...read more
Answered by AI
View 3 more amswers

Round duration - 45 minutes
Round difficulty - Medium

It was conducted in early evening, again it consist of one coding question and some Basic OOP question.

Q1. Rat in a maze
You are given a starting position for a rat which is stuck in a maze at an initial point (0, 0) (the maze can be thought of as a 2-dimensional plane). The maze would be given in the form of a...read more
Ans. 
The task is to find all possible paths for a rat to reach its destination in a maze.
• The maze is represented as a square matrix of 0s and 1s.

• The rat starts at (0, 0) and the destination is at (N-1, N-1).

• The rat can move in four directions: up, down, left, and right.

• Use backtracking to explore all possible paths.

• Print the paths in alphabetical order.
Answered by AI
View 2 more amswers

Round duration - 45 minutes
Round difficulty - Easy

It was conducted at night like it was 8.00pm . HR was very nice. She asked managerial questions only and asked about my hobbies, experiences, why I want to join jio etc.

Q1. Basic HR question
Why do you want to join jio?
Ans. 
I want to join Jio because of its innovative technology and vast opportunities for growth.
• Jio is known for its cutting-edge technology and I want to be a part of that innovation.

• Jio offers a wide range of career opportunities and growth prospects.

• Jio's strong market presence and success make it an exciting company to work for.

• Jio's focus on digital transformation aligns with my passion for technology.

• Jio's commitment t...read more
Answered by AI
View 2 more amswers
Q2. Basic HR Question
What will you do if there is some conflict in a team were you working?r
Ans. 
In case of conflict in a team, I would first try to understand the root cause and then facilitate open communication and collaboration to resolve the conflict.
• Listen to all parties involved and understand their perspectives

• Encourage open and respectful communication

• Facilitate a discussion to identify the root cause of the conflict

• Promote collaboration and finding common ground

• Propose potential solutions and encourage c...read more
Answered by AI
View 1 more amswer

Round duration - 135 minutes
Round difficulty - Easy

Coding questions was easy if you know the basic of coding in any language. I submitted optimized solution for every questions that's why i got selected in this round.

Q1. Find K’th Character of Decrypted String
You have been given an Encrypted String where repetitions of substrings are represented as substring followed by the count of substrings.
Example: String "aabb...read more
Ans. Decryption
We will just iterate through Encrypted String ‘S’ and will create a Decrypted String. Then we can print the K’th character of Decrypted String.
• We will find the substring by traversing the string until no digit is found.
• Then find the frequency of the preceding substring by traversing the string until no lowercase alphabet is found. We can use this relation to create the Integer frequency from the string:
  • freqOf...read more
Answered by CodingNinjas
View 2 more amswers
Q2. Cycle Detection In Undirected Graph
You have been given an undirected graph with 'N' vertices and 'M' edges. The vertices are labelled from 1 to 'N'.
Your task is to find if the g...read more
Ans. DFS Approach (Slow)
There is a cycle in the graph only if there is a back edge (back edge is an edge that connects a vertex to another vertex that is discovered before it's parent) present in the graph. To detect a back edge, we will keep track of vertices that have been already visited. If we reach a vertex that is already visited and is not the parent vertex of the current vertex, then there is a cycle in the graph.&n...read more
Answered by CodingNinjas
View 2 more amswers

Round duration - 150 minutes
Round difficulty - Medium

Q1. Pair Sum
You are given an array/list ‘ARR’ consisting of ‘N’ distinct integers arranged in ascending order. You are also given an integer ‘TARGET’. Your task is to count all the distinct pairs in ‘ARR’ suc...read more
Ans. Brute Force
First, we declare a variable 'COUNTPAIR’ in which we store all pairs whose sum is equal to 'TARGET’. Then, we traverse the array ‘ARR’ and assume every element as the first element of the pair. Then we again traverse the remaining array and consider every element as a second element of the pair, and check whether the sum of the two elements is equal to 'TARGET' or not. If it is equal to 'TARGET',’ then we in...read more
Answered by CodingNinjas
View 2 more amswers
Q2. Next smaller Palindrome
You are given a number 'N' in the form of a string 'S', which is a palindrome. You need to find the greatest number strictly less than 'N' which is also a pa...read more
Ans. Brute Force
• Given the fact that the input number is a palindrome itself makes this problem very trivial.
• Let us assume that the given string str is a palindrome, so we know that ‘S’ comprises of two halves  ‘S₁’ and ‘S₂’ i.e ‘S’ = ‘S₁' + ‘S₂', where ‘S₁' and ‘S₂’ are two strings, and ‘S₂’ is the reverse of ‘S₁’(in case of odd length palindromes ‘S₂’ won’t have the last character of ‘S₁’). So a change in any of the h...read more
Answered by CodingNinjas
Add your answer
Q3. Longest Common Subsequence
You have been given two Strings “STR1” and “STR2” of characters. Your task is to find the length of the longest common subsequence.
A String ‘a’ is a subsequence of a String ‘b...read more
Ans. Recursive Brute Force
The basic idea of this approach is to break the original problem into sub-problems. Let us assume we want to find the length of the longest common subsequence of “STR1” and “STR2” whose length is ‘N’ and ‘M’ respectively. 
 
Now, let us define a recursive function 
 
LCS(Int I, int J, string STR1, string STR2)
Which returns the length of the longest common subsequence of string STR1...read more
Answered by CodingNinjas
View 3 more amswers

Round duration - 30 minutes
Round difficulty - Easy

Interview went well.The interviewer asked me how the previous interviews were.

Q1. Boundary Traversal
You have been given a binary tree of integers. Your task is to print the boundary nodes of this binary tree in an Anti-Clockwise direction starting from the root node.
NOTE: The bounda...read more
Ans. Recursion based Approach
The boundary traversal of a binary tree can be broken down into 4 parts. These parts are given in the same order as they are present in the traversal-
1. The root node - The root node will always be our first node in the whole boundary traversal.
2. The left boundary - The left most nodes of the left subtree are also included in the boundary traversal, so we will process them next except for the leaf no...read more
Answered by CodingNinjas
Add your answer
Q2. Sort 0 1 2
You have been given an integer array/list(ARR) of size 'N'. It only contains 0s, 1s and 2s. Write a solution to sort this array/list.
Note :
Try to solve the problem in 'Single Sca...read more
Ans. Sorting
Use any good sorting algorithm like Merge Sort, Quick Sort or inbuilt sorting function of different languages.
• Sort the Array and just return.
Space Complexity: O(1)Explanation:
O(1), As we are using constant space.
Time Complexity: O(nlogn)Explanation:
O(N*log(N)), where ‘N’ is the size of the array.
We are using inbuilt sort algorithm which has Overall Time Complexity O(N*log(N))
Answered by CodingNinjas
View 3 more amswers

Round duration - 20 minutes
Round difficulty - Easy

This round is very easy, In this round they basically need confidence and truthful person.

Q1. Basic HR Questions
Where do you see yourself in 5 years?
What are your weaknesses?
Ans. 
Tip 1 : Just be confident
Answered by CodingNinjas
Add your answer