Indian Cable Net Company Network Engineer Interview Questions and Answers

Round duration - 40 minutes
Round difficulty - Medium

Asked about time complexity of algorithm, puzzles, DBMS, cutting edge technologies etc. What are indexes?

Q1. 
Flip Bits Problem Explanation
Given an array of integers ARR of size N, consisting of 0s and 1s, you need to select a sub-array and flip its bits. Your task is to return the maximum count of 1s that can b...read more
Ans. 
Given an array of 0s and 1s, find the maximum count of 1s by flipping a sub-array at most once.
• Iterate through the array and keep track of the maximum count of 1s obtained by flipping a sub-array.

• Consider flipping a sub-array from index i to j and calculate the count of 1s in the resulting array.

• Return the maximum count of 1s obtained by flipping a sub-array at most once.
Answered by AI
Add your answer

Round duration - 20 minutes
Round difficulty - Medium

Asked 1 standard algorithm

Q1. 
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. 
Count the number of islands in a 2D matrix of 1s and 0s.
• Iterate through the matrix and perform depth-first search (DFS) to find connected 1s.

• Mark visited cells to avoid redundant traversal.

• Increment island count whenever a new island is encountered.
Answered by AI
Add your answer

Discussion on the changes in tecehnology

Test followed by the questions and scenario based questions

DSA, system design, react, redux

DSA, stystem design, react, redux

Q1. Project related
Add your answer

This aptitude + technical MCQ test was of 120 minutes in duration. Had MCQs on quantitative ability, logical ability, Language, and technical MCQs consisted of questions on DBMS, OS, Networks, DSA. There were two coding questions as well. One on Bit Manipulating, and the other on DFS.

Q1. A question on BFS very similar to Leetcode 924. Was given one hour to discuss and come to an optimized solution with the interviewer.
Add your answer

Q1. Search an element in a sorted and rotated array
Ans. 
Search an element in a sorted and rotated array
• Find the pivot point where the array is rotated

• Divide the array into two sub-arrays based on pivot point

• Perform binary search on the appropriate sub-array
Answered by AI
Add your answer
Q2. SQL query on left join
Add your answer
Q3. Questions on CPP memory management
Add your answer
Q4. Questions related to projects done
Add your answer

Q1. Propose a system for a popular media stream service
Ans. 
Proposed system for a popular media stream service
• Implement a recommendation engine to suggest content based on user preferences and viewing history

• Integrate with social media platforms to allow users to share and discuss content

• Provide multiple subscription options with varying levels of access and features

• Ensure high-quality streaming with minimal buffering through the use of content delivery networks

• Implement robust...read more
Answered by AI
Add your answer
Q2. Questions related to Fullstack Tech Stacks
Add your answer

Guesstimate on number of Reddit users in India. No starting input was given. Gave solution by using bottom to top approach. Tried to focus on quantifying teenagers with internet access and a particular interest about internet. Gave a figure around ~1 million in a year.

Q1. Where do you see yourself at McKinsey?
Add your answer

Hacker Rank test with medium difficulty

Q1. Technical discussion mainly around system design, different architectures, problem solving and coding question may be asked.
Add your answer

A case study for a problem statement

It was 2 coding questions of medium level

Q1. Longest substring with non repeating characters
Ans. 
Find the longest substring in a given string that does not contain any repeating characters.
• Use a sliding window approach to iterate through the string.

• Keep track of the characters seen so far using a set.

• Update the start and end indices of the window to find the longest substring.

• Return the length of the longest substring.
Answered by AI
Add your answer
Q2. Candy problem. There is similar question in geeks for geeks
Add your answer