Cerebra Integrated Technologies Domestic IT Recruiter Interview Questions and Answers

Q1. Project monitoring
Add your answer
Q2. Project handling
Add your answer

Q1. Project completion
Add your answer

Q1. Salary negotiation
Add your answer

Q1. Water Division related on question with planning and billing. They enquiry related to project deep and deep and asking about the fix the issue.
Add your answer
Q2. Filter house methodology and construction related.
Add your answer

Q1. Work experience , Previous company work,
Add your answer

Q1. OTDR,LSPM,Link budget,Field work
Add your answer

Q1. Stay Rod Length, 11kv line BOQ FOR 1 KM, Substation SLD etc
Add your answer
Q2. 1600mm, 21 nos Pole with DP ,V Cross ,1 nos DP with Belting & bracing
Add your answer

Q1. Salary expectation
Add your answer
Q2. Show your salary in Bank statement, will provide Bike conveyance rs 5 rs/ km, Guest house facility mob. Reimburse etc
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

It was in the morning. Because of covid test was from home. We had 50 MCQ and 1 coding question. The coding question was pretty easy. MCQ were mixed, we even had questions from machine learning.

Q1. 
Maximum Path Sum Between Two Leaves
Given a non-empty binary tree where each node has a non-negative integer value, determine the maximum possible sum of the path between any two leaves of the given tree.
...read more
Ans. 
Find the maximum path sum between two leaf nodes in a binary tree.
• Traverse the tree to find the maximum path sum between two leaf nodes

• Consider both cases where the path passes through the root and where it doesn't

• Keep track of the maximum sum while traversing the tree
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Interview round. Questions were based on projects, database and one coding question

Q1. 
Longest Subarray Zero Sum Problem Statement
Given an array of integers arr, determine the length of the longest contiguous subarray that sums to zero.
Input:
N (an integer, the length of the array)
arr (...read more
Ans. 
Find the length of the longest contiguous subarray that sums to zero in an array of integers.
• Use a hashmap to store the cumulative sum and its corresponding index.

• Iterate through the array, updating the sum and checking if the current sum exists in the hashmap.

• If the sum exists in the hashmap, update the maximum length of subarray with sum zero.

• Return the maximum length of subarray with sum zero.
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

Managerial round. Was asked questions on projects and management

Round duration - 10 minutes
Round difficulty - Easy

HR just asked about basic stuffs and all. Nothing technical