UST ETL Developer Interview Questions and Answers for Freshers

3 coding problems
1 aptitude
1 puzzle
3 hrs duration

Q1. Sorting algorithms
Add your answer
Q2. 1 puzzle - burning candles
Add your answer

Q1. General discussion on resume
Add your answer
Q2. Few reasoning questions
Add your answer

Q1. About company work culture
Add your answer

Q1. Java basics oops, and others stuff in the resume
Add your answer

Easy aptitude questions with minimum tough

2 rounds of coding.. one is normal coding another is super coding

Q1. What is polymorphism,buzz words of java
Ans. 
Polymorphism is the ability of an object to take on many forms.
• Polymorphism allows objects of different classes to be treated as if they are of the same class.

• It is achieved through method overloading and method overriding.

• Example: A parent class Animal can have child classes like Dog, Cat, and Bird. Each child class can have its own implementation of the method 'makeSound', but they can all be called using the same me...read more
Answered by AI
Add your answer
Q2. Difference between html and html5
Ans. 
HTML5 is the latest version of HTML with new features and improvements.
• HTML5 supports multimedia elements like video and audio without plugins.

• HTML5 has new semantic tags like

  ,

• HTML5 has improved form elements like date pickers, range sliders, etc.

• HTML5 has better support for mobile devices and responsive design.

• HTML5 has improved performance and security compared to HTML.

• HTML5 has a canvas element for drawing...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

First round has 4 coding Questions in which i have solved 3 complete and 1 partial.

Q1. Crazy Numbers
Ninja loves playing with numbers. So one day, he wants to arrange a few numbers in the ‘N’ number of rows. The first row contains 1 number, the second row has two numbers, the third row has 3...read more
Ans. Brute force
The key here is to traverse all the lines sequentially, and for each line, we print the required character at the given index.
The steps are as follows:
• We will define matrix ‘ans’ to store the final pattern.
• We will initialize a variable ‘k’ to 1, which will be the starting value for the pattern.
• We will iterate over all the rows, i.e., i = 0 to i = N - 1:
  • We will run a for loop starting from j = N - i -1 with t...read more
Answered by CodingNinjas
View 1 more answer
Q2. Pairs with difference K
You are given with an array of integers and an integer K. You have to find and print the count of all such pairs which have difference K.
Note: Take absolute difference between th...read more
Ans. Space Complexity: O(1)Explanation: Time Complexity: O(1)Explanation:
Answered by CodingNinjas
Add your answer
Q3. Fibonacci Member
Given a number N, figure out if it is a member of fibonacci series or not. Return true if the number is member of fibonacci series else false.
Fibonacci Series is defined by the recurren...read more
Ans. Space Complexity: Explanation: Time Complexity: Explanation:
Answered by CodingNinjas
Add your answer
Q4. Ninja And The New Year Guests
Ninja has organized the new year party and invited all the programmers for it, as being the programmer also has been invited by Ninja.
To detect whether the guest is a progr...read more
Ans. Brute Force Approach
Approach: We will recursively find all possible permutations and then check for each of them whether it is following the condition or not.
 
We will maintain a counter based on that and increment it when the current permutation satisfies the condition.
 
Algorithm :  
 
// It is a recursive function to get all the permutations of the current array 'arr'.
void getPermutations(arr, i...read more
Answered by CodingNinjas
View 1 more answer

Round duration - 20 minutes
Round difficulty - Easy

Every single question were based on the concept of data structure.
I have to answer my approach for solving a particular real life Problem.

Q1. Valid Parentheses
You're given string ‘STR’ consisting solely of “{“, “}”, “(“, “)”, “[“ and “]” . Determine whether the parentheses are balanced.
Input Format:
The first line contains an Integer &...read more
Ans. 
Declare a character stack S.
Now traverse the expression string exp. 
If the current character is a starting bracket (‘(‘ or ‘{‘ or ‘[‘) then push it to stack.
If the current character is a closing bracket (‘)’ or ‘}’ or ‘]’) then pop from stack and if the popped character is the matching starting bracket then fine else brackets are not balanced.
After complete traversal, if there is some starting bracket left in stac
Answered by CodingNinjas
View 1 more answer
Q2. Aptitude Question
Find the angle between the minute and The hour clock
if its 4:10
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

Q1. Basic HR Questions
Why do u want to join Nagarro
Explain About Yourself.
Add your answer

Good questions related to coding and performance tuning

Q1. General HR questions
Add your answer
Q2. Questions about location and salary
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Timing -12pm to 1:30pm
Test environment was good and we should keep in our mind about our net speed.

Q1. Reverse the array
Given an array with N elements, the task is to reverse all the array elements and print the reversed array.
Input Format:
The first line contains an integer N representing the size of ...read more
Ans. Brute Force approach
• Initialise start and end indices with start = 0, end = N-1 where N is the total number of elements in array.
• We then run a loop while start < end and swap arr[start] with arr[end].
• Finally, we increment start and decrement end variable
Space Complexity: O(1)Explanation: Time Complexity: O(1)Explanation:
Answered by CodingNinjas
Add your answer
Q2. Tiling Problem
You have been given a board where there are '2' rows and 'N' columns. You have an infinite supply of 2x1 tiles, and you can place a tile in the following ways:
1. Horizontal...read more
Ans. Recursion And Memoization (Runtime error)
Try to place the tile to fill the unit column and calculate the number of ways from smaller sub-problems. Then use memoization to convert O(2^N) solution to an O(N) solution.
1. At any point we are at ‘idx’ column then we can place our tile in two ways to fill this column.
   1. Option 1 -  1 Horizontal Tile
We can place in this way where we have ‘idx-1’ column filled.
    &nb...read more
Answered by CodingNinjas
View 3 more answers

Round duration - 60 Minutes
Round difficulty - Easy

Timing was 3pm to 4 pm
environment was easy familier and interviwer was also in good mood ,first he ask me about general things then he come on OS/DBMS .

Q1. DBMS Questions
Normalization forms.
Entity relational model
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

timing - 10am to 10:30am
environment was very familier and interviewer was with good sence of humor

Q1. Basic HR Questions
Would you prefer work from home or would like to come to office?
What is your biggest achievement.
Are you a team player?
Ans. 
Tip 1 : do what you are real and don't try to be fake 
Tip 2 : be confident and try to explain in simple way
Answered by CodingNinjas
Add your answer