Problem database last updated: June 20, 2025
4 problems · 2 Easy, 2 Medium, 0 Hard · Ranked #258 of 458
2 Easy
50% · avg 23%
2 Medium
50% · avg 59%
0 Hard
0% · avg 18%
Based on 4 reported problems, Comcast interviews are easier than average - only 0% Hard compared to 18% across all companies.
Compared to the industry average, Comcast puts unusual emphasis on breadth-first-search (50% of problems, 6x the industry average), depth-first-search (50% of problems, 5.5x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (50%), depth-first-search (50%), breadth-first-search (50%), hash-map (25%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Two Sum Given an array of integers nums and an integer target, return the indices of the two numbers that add up to target. | Easy | Very Likely | arrayhash-map | Solve |
Longest Substring Without Repeating Characters Given a string s, find the length of the longest substring without duplicate characters. | Medium | Very Likely | hash-tablestringsliding-window | Solve |
Symmetric Tree Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center). | Easy | Very Likely | treedepth-first-searchbreadth-first-search | Solve |
Number of Islands Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands. | Medium | Very Likely | arraydepth-first-searchbreadth-first-search | Solve |
Two Sum
SolveGiven an array of integers nums and an integer target, return the indices of the two numbers that add up to target.
Longest Substring Without Repeating Characters
SolveGiven a string s, find the length of the longest substring without duplicate characters.
Symmetric Tree
SolveGiven the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center).
Number of Islands
SolveGiven an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands.
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Comcast interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Comcast interviews focus heavily on array, depth-first-search, breadth-first-search problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Comcast interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
Comcast has been reported to ask 4 distinct coding problems. The most common topics are array, depth-first-search, breadth-first-search. 2 are Easy difficulty, 2 are Medium, and 0 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 4 reported problems, Comcast interviews are easier than average - only 0% Hard compared to 18% across all companies. 50% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, depth-first-search, breadth-first-search. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Comcast coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Comcast interview with AIarrow_forward
