Tiu Consulting Software Developer Interview Questions and Answers

Hexaware was came to our college placement and our placement staff gave us 3 days coding training and aptitude training and the first round round is aptitude it was a online mcq type you have to pass the aptitude inorder to attend the round 2

Coding test was based on DSA

Profit loss, blood relation, coding decoding, logical reasoning

2 automata code
1) Array based
2)String based

Q1. Totally asked CS fundamentals like DBMS, OS, CN and OOPM then solved 1 DSA question which is related to string
Add your answer

Q1. Just ask only behavioural questions
Add your answer

An aptitude test is a way for employers to assess a candidates abilities through a variety of different testing formats

Q1. An interview that typically conducted by a human resources generalist at the beginning of the hiring process
Add your answer
Q2. While the HR interview gets a bad reputation for being a formality
Add your answer

Simple technical maths calculations,

Writing a Jawa coding in small projects

Round duration - 90 minutes
Round difficulty - Medium

Test was active from 28th September 8 PM till 2 AM (29th September’20). We could attempt at any time. 
1.5 Hr Duration
Two coding questions.

Q1. 
Cycle Detection in Undirected Graph Problem Statement
You are provided with an undirected graph containing 'N' vertices and 'M' edges. The vertices are numbered from 1 to 'N'. Your objective is to determi...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 Anonymously
Add your answer
Q2. 
Number of Islands Problem Statement
You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...read more
Ans. Flood Fill Algorithm
We can use the flood fill algorithm to check for all connected 1s.
 
• We create two arrays, dx, and dy, in which we store the unit vectors for all eight directions. Thus, when we are at a given cell, we can easily check for all its adjacent cells by simply looping over the two arrays, adding their values to the current position, and checking for this new position recursively.
• We will also create a ...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Online video call round on Microsoft Teams
Interviewer was very friendly.
This round is often called Domain Discussion Round.

Q1. 
Longest Repeating Substring Problem Statement
Given a string str consisting of lowercase English alphabet letters, and an integer K, you are allowed to perform at most K operations on this string. An oper...read more
Ans. Brute Force
In this approach, we will consider every substring and check if it can be the longest repeating substring. Let’s say we have a variable ‘longestSubstring’ that stores the length of the longest repeating substring.
 
We can convert a substring into a repeating substring if, (L - MX) <= K (where ‘L’ is the length of substring and ‘MX’ is the count of the character which occurs maximum times in this subst...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

One hour HR round.
Also called Core Values Interview.
The Interviewer was a senior level employee and was very friendly.