Zclus Blast Furnace Operation Engineer Interview Questions and Answers

First round was a aptitude test of 25 question

Q1. Oops concept in java
Ans. 
Oops concept in Java refers to Object-Oriented Programming principles like inheritance, encapsulation, polymorphism, and abstraction.
• Inheritance allows a class to inherit properties and behavior from another class.

• Encapsulation involves bundling data and methods that operate on the data into a single unit.

• Polymorphism allows objects to be treated as instances of their parent class.

• Abstraction hides the implementation d...read more
Answered by AI
Add your answer
Q2. Basic multi threading questions
Add your answer

Q1. Code to make a pattern and explain each and every line of code
Ans. 
Code to create a pattern and explain each line of code
• Start by defining the number of rows and columns in the pattern

• Use nested loops to iterate through each row and column

• Decide the pattern you want to create and use conditional statements to determine the output for each position
Answered by AI
Add your answer
Q2. Puzzle: In how many minimum cut u can cut a cake in 8 piece
Add your answer

Q1. Basic SQL question.
Add your answer
Q2. Order of execution
Ans. 
The order of execution refers to the sequence in which instructions or operations are executed in a program.
• The order of execution is determined by the programming language and the specific code being executed.

• Generally, code is executed line by line from top to bottom.

• However, there are exceptions such as loops, conditionals, and function calls that can alter the order of execution.

• In some programming languages, there...read more
Answered by AI
Add your answer
Q3. Window functions
Add your answer
Q4. Aggregate functions
Add your answer

Q1. Level order tree traversal
Add your answer
Q2. Find the pair element from the array
Ans. 
Find the pair element from the array
• Iterate through the array and use a hashmap to store elements and their counts

• Check if the current element's complement exists in the hashmap

• Return the pair if found, otherwise return null
Answered by AI
Add your answer

We had an aptitude test which involved 60 questions in 15 minutes. Of course, no one can solve this fast, but it was about the hit rate / accuracy and volume. Subsequent followed with two guesstimate based rounds and final as HR round which involved asking about college projects, extra curricular experiences and so on.

Q1. Where do you see yourself in 5 years
Add your answer

Q1. How you will improve health of a marketplace
Ans. 
By analyzing data, identifying pain points, and implementing solutions to improve user experience and trust.
• Analyze user behavior and feedback to identify areas of improvement

• Implement measures to increase transparency and trust, such as user reviews and seller verification

• Provide resources and support for dispute resolution

• Encourage diversity and inclusivity in the marketplace to attract a wider range of buyers and se...read more
Answered by AI
Add your answer

Q1. How you will design new customer support system
Ans. 
I will design a customer support system that is user-friendly, efficient, and personalized.
• Conduct research to understand customer needs and preferences

• Identify common customer issues and develop a knowledge base for quick resolution

• Implement a ticketing system to track and prioritize customer inquiries

• Integrate chatbots and AI to provide 24/7 support

• Train support staff to provide personalized and empathetic service

• Col...read more
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

This was MCQ+Coding round.

Q1. How can you check if two strings are anagrams of each other?
Ans. 
Check if two strings are anagrams by comparing the sorted versions of the strings.
• Sort both strings and compare if they are equal.

• Use a hashmap to store the frequency of characters in each string and compare the maps.

• Ignore spaces and punctuation when comparing the strings.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Round duration - 90 Minutes
Round difficulty - Medium

Interview started at 11:00 am. It was an online round. During the coding round I submitted optimized solution and got full acceptance of the solutions.

Q1. 
Detect Cycle in a Directed Graph
You are provided with a directed graph composed of 'N' nodes. You have a matrix called 'EDGES' with dimensions M x 2, which specifies the 'M' edges in the graph. Each edge...read more
Ans. 
Detect cycle in a directed graph using depth-first search (DFS) algorithm.
• Use DFS to traverse the graph and detect back edges indicating a cycle.

• Maintain a visited array to keep track of visited nodes during traversal.

• If a node is visited again during traversal and it is not the parent node, then a cycle exists.

• Return true if a cycle is detected, false otherwise.
Answered by AI
Add your answer

Round duration - 80 Minutes
Round difficulty - Medium

Interview started at 10:00 am. Interview went well, I was able to connect with the interviewer and enjoyed the whole interview

Q1. 
Next Smallest Palindrome Problem Statement
Find the next smallest palindrome strictly greater than a given number 'N' represented as a string 'S'.
Explanation:
You are given a number in string format, a...read more
Ans. 
Find the next smallest palindrome greater than a given number represented as a string.
• Convert the string to an integer, find the next greater palindrome, and convert it back to a string.

• Handle cases where the number is a palindrome or has all digits as '9'.

• Consider both odd and even length numbers when finding the next palindrome.
Answered by AI
Add your answer

Round duration - 80 Minutes
Round difficulty - Medium

Interview started at 11:00 am. Interview went well.

Q1. 
Boundary Traversal of a Binary Tree
Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.
Input:
The first line ...read more
Ans. 
Return the boundary nodes of a binary tree in Anti-Clockwise direction starting from the root node.
• Traverse the left boundary nodes in a top-down manner

• Traverse the leaf nodes from left to right

• Traverse the right boundary nodes in a bottom-up manner

• Handle cases where duplicates occur in the boundary nodes

• Implement the function without printing as printing is already managed
Answered by AI
Add your answer