DataTrained Information Technology Support Engineer Interview Questions and Answers

Basic aptitude questions

Linked list, array, tree and graph questions

Coding test around front end using react

Round duration - 120 minutes
Round difficulty - Easy

It was a mix of mathematical aptitude, logical ability, and puzzles along with 2 programming questions of easy and medium level. Time was enough and no sectional time was present. 1-2 MCQs on SQL were also present.

This round was immediately followed by an SHL aptitude test which was basically a quick limited time check of your verbal ability and math because many questions were to be done in 1 hour.

Q1. 
Boolean Matrix Transformation Challenge
Given a 2-dimensional boolean matrix mat of size N x M, your task is to modify the matrix such that if any element is 1, set its entire row and column to 1. Specifi...read more
Ans. 
Modify a boolean matrix such that if any element is 1, set its entire row and column to 1.
• Iterate through the matrix and mark rows and columns to be modified

• Use additional arrays to keep track of rows and columns to be modified

• Update the matrix in-place based on the marked rows and columns
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

It was an online video interview round on HackerEarth with simultaneous code option. It was mostly justifying your resume in the first 15 minutes. After that OOPS was majorly asked. Basics of programming including questions on STL were asked. A class which required inheritance was asked by the interviewer to write. I was helped by the interviewer if i got stuck somewhere, Some questions on implementation of hashmaps and priority queues were also asked. A puzzle was asked which luckily struct to me at that moment.

Q1. Check if string is palindrome
Ans. 
Check if a string is the same forwards and backwards
• Iterate through the string from both ends and compare characters

• Use built-in functions like reverse() to check for palindrome

• Ignore spaces and punctuation when checking for palindrome
Answered by AI
Add your answer

Python technical SQL basic

2.5 Hours 2 Coding que and sql query and topin tech platform

Q1. Based on boolean matrix
Add your answer
Q2. Find k closest node of given given node in a BST.
Ans. 
Find k closest nodes to a given node in a BST.
• Perform an inorder traversal of the BST to get a sorted list of nodes.

• Use a priority queue to keep track of the k closest nodes based on their absolute difference with the target node.

• Populate the priority queue with the first k nodes from the inorder traversal.

• For each subsequent node, calculate its absolute difference with the target node and compare it with the top eleme...read more
Answered by AI
Add your answer

Two dynamic programming challenges at the hard level on LeetCode and 10 medium-level SQL challenge.

Two Medium DSA problem to solve

Q1. Design scalable Streaming pipeline and
Ans. 
Design a scalable streaming pipeline for processing large volumes of data.
• Use a distributed streaming framework like Apache Kafka or Apache Flink for real-time data processing.

• Implement data partitioning and parallel processing to handle high data throughput.

• Utilize cloud services like AWS Kinesis or Google Cloud Pub/Sub for scalability and reliability.

• Include fault tolerance mechanisms like checkpointing and data repl...read more
Answered by AI
Add your answer

Q1. LLD round , write classes and its methods
Add your answer

Q1. Salary and benefits discussion
Add your answer