Comcast India Engineering Center Software Developer Intern Interview Questions and Answers

3 coding dsa question
Difficulty is On your luck
My friends got easy level
I got medium level
Some got hard questions as well

Ssh round , quant and logical
Tip: bring your calculator

Q1. Two Puzzle : bulb switching and candle
Add your answer
Q2. Dsa questions such as string reverse, binary search
Add your answer
Q3. Dbms and os core subject questions
Add your answer

Q1. How are you better than others
Add your answer
Q2. Why should we hire you
Add your answer

Easy to medium level aptitude . DSA question were hard

Oops + Dsa + puzzles. Oops mainly polymorphism

Mcqs on os,dbms,cn oops,dsa

Q1. Diameter of tree,2 sum, sliding window
Ans. 
The question covers topics like tree diameter, 2 sum problem, and sliding window technique.
• For the diameter of a tree, you can use depth-first search (DFS) or breadth-first search (BFS) to find the longest path between any two nodes.

• The 2 sum problem involves finding two numbers in an array that add up to a given target. You can use a hash table or two pointers approach to solve it efficiently.

• Sliding window technique ...read more
Answered by AI
Add your answer
Q2. Diameterof tree
Add your answer
Q3. Two sum
Add your answer
Q4. Slding window
Add your answer

Q1. Sort array of 0,1,2 oops quesions
Ans. 
Sort an array of 0s, 1s, and 2s in ascending order.
• Use the Dutch National Flag algorithm to sort the array in a single pass.

• Maintain three pointers: low, mid, and high.

• Swap elements based on their values and move the pointers accordingly.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

This round was scheduled for 9am in the morning. The test environment was pretty good . I didn't face any issues on the HireVeu platform. The first test was of Aptitude and then in next section it was Technical MCQ's. The level of questions were mid to high level of difficulty.

Round duration - 60 minutes
Round difficulty - Medium

The exam was on the same Platform. The first question was about the most difficult Project I've worked on. I have to record a video in that particular platform and then move to the next questions. There was option for a demo video of 1 minute in which you can practice your answers and then can record your answer in the next video of max 5 minutes. The next 2 question were Coding Problems of moderate difficulty and you've to record your approach and then proceed towards solving the code and then record a video stating if you succeed or not and what better could you've done to make it work.

Q1. 
Sum of N-Digit Palindromes
Determine the sum of all N-digit palindromes for a given integer 'N'. A palindrome is defined as a number that remains the same when its digits are reversed.
Example:
Input:
...read more
Ans. 
Run a loop from 10^(n-1) to 10^(n) – 1 and check when the current number is palindrome or not. If it is, adds its value to answer.
Answered Anonymously
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

This round was scheduled for 3pm. The interviewer was quite friendly. He asked about me and told me to relax and then answer. He started with asking questions from my Project and how the ideas behind the Project. My Project was related to Deadlock So he asked whether I can implement my Project on any environment. I answered . Then one of my internship Project was related to Web development so He asked me about the backend of the Project. He gave me a few SQL queries and some general DBMS concepts based on the response about using Mysql in the Project. He asked me a few things about AWS and Cloud Computing which I answered. At last he asked some LINUX commands and corrected me once and was satisfied with my answers.

Round duration - 50 minutes
Round difficulty - Medium

This round was held on Google Meet Video Call at 10 A.M.
There were 2 Interviewers and they were very helpful.

Q1. 
Kth Largest Element Problem Statement
Given an integer array and a number 'K', your task is to identify the kth largest element within the array.
Input:
The input starts with an integer 'T', which indic...read more
Add your answer
Q2. 
Maximum Sum Path from Leaf to Root
Given a binary tree with 'N' nodes, identify the path from a leaf node to the root node that has the maximum sum among all root-to-leaf paths.
Example:
All the possibl...read more
Add your answer

Round duration - 55 minutes
Round difficulty - Medium

The round was 2nd technical round conducted through Google Meet.
There were 2 interviewers and they were helpful.
Timing was from 11:10 A.M - 12:00 P.M

Round duration - 30 minutes
Round difficulty - Medium

Timing was 12:30 P.M. to 1:00 P.M.
It was held on Google Meet and HR was helpful.

Round duration - 150 Minutes
Round difficulty - Medium

This first round was the Online test which was 1 Hour 95 Minutes Long. It was Divided
as Follows.

1. Aptitude Section (Arithmetic + Analytical) 14 Questions – 26 Minutes
2. Technical MCQs( Computer Science) 14 Questions – 19 Minutes
3. Coding Question – 20 Minutes
4. Coding Question – 30 Minutes
5. Coding Questions :

Q1. 
Water Equalization Problem Statement
You are provided with an array ARR of positive integers. Each integer represents the number of liters of water in a bucket. The goal is to make the liters of water in ...read more
Add your answer
Q2. 
K Max Sum Combinations Problem Statement
Given two arrays/lists A and B, each of size N, and an integer K, you need to determine the K maximum and valid sum combinations from all possible combinations of ...read more
Add your answer

Round duration - 150 Minutes
Round difficulty - Medium

This was an Online F2F Technical Round conducted on CodePair : Hackerrank. So, Basically You have to Run and Submit ( Pass All Test cases) in the Interview Round also (Like normal Coding Test) in Codepair: Hackerrank & along with that You should have to explain your Code and Approach to the Interviewers.

Q1. 
Minimum Fountains Activation Problem
In this problem, you have a one-dimensional garden of length 'N'. Each position from 0 to 'N' has a fountain that can provide water to the garden up to a certain range...read more
Add your answer

Round duration - 150 Minutes
Round difficulty - Medium

This was also an Online F2F Technical Round conducted on Codepair : Hackerrank.
Dynamic Programming Based Not So Easy Level:
Best Time to Buy and Sell Stock
Best Time to Buy and Sell Stock II
Dynamic Programming Based Not So Medium Level
Best Time to Buy and Sell Stock with Cooldown
Best Time to Buy and Sell Stock with Transaction Fee
Dynamic Programming Based Hard Level
Best Time to Buy and Sell Stock III
Best Time to Buy and Sell Stock IV

They asked me a Lot of Questions like:
How did you arrive at this Solution ?
Why is this Approach Right ?
Can You do this in Better time & space complexities ? (Although I have done in Best time Complexity but they asked this to check my confidence level on my codes).
A lot of Variants based on Constraints.

Q1. 
Best Time To Buy and Sell Stock Problem Statement
You are given an array 'PRICES' of 'N' integers, where 'PRICES[i]' represents the price of a certain stock on the i-th day. An integer 'K' is also provide...read more
Add your answer
Q2. 
Buy and Sell Stock Problem Statement
Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' days. You can perform up to two buy-and-sell ...read more
Add your answer