Filter interviews by
Find all palindromic decompositions of a given string s.
Iterate through all possible substrings and check if they are palindromes.
Use backtracking to generate all possible decompositions.
Return the list of palindromic decompositions.
Use sliding window technique to find minimum window in s containing all characters of t.
Use two pointers to create a window in s
Move the right pointer to expand the window until all characters of t are found
Move the left pointer to shrink the window while maintaining all characters of t
Update minimum window size as you iterate through s
Use a max heap to keep track of the K largest elements in a continuous stream of integers.
Create a max heap of size K to store the K largest elements.
For each new element in the stream, compare it with the root of the max heap. If it is larger, replace the root with the new element and heapify.
At any point, the root of the max heap will be the Kth largest element in the stream.
A ticketing management system for a theatre to streamline ticket sales and seat allocation.
Create an online platform for customers to purchase tickets
Implement a seating chart to allow customers to select their seats
Include options for different ticket types (e.g. VIP, standard, student)
Generate electronic tickets for customers to present at the theatre entrance
Integrate payment processing for secure transactions
What people are saying about Comcast
A customer relationship management platform for Comcast would focus on personalized customer interactions and efficient issue resolution.
Implement a centralized database to store customer information and interaction history.
Integrate communication channels such as phone, email, and chat for seamless customer support.
Utilize data analytics to track customer behavior and preferences for targeted marketing campaigns.
...
Program to find lowest common ancestor of two nodes in a binary tree with unique values.
Start from the root and traverse the tree to find the paths from root to the two nodes.
Compare the paths to find the lowest common ancestor node.
Use recursion to traverse the tree efficiently.
Handle edge cases like if one of the nodes is the ancestor of the other.
Convert a set of integers to Roman numerals
Create a function that takes an integer array as input
Use a loop to iterate through each integer and convert it to Roman numeral
Implement a mapping of integers to Roman numerals for conversion
Return an array of strings containing the Roman numeral equivalents
The minimum number of coins required to express a given amount of money is calculated using a dynamic programming approach.
Use dynamic programming to calculate the minimum number of coins required for each amount from 1 to the given amount.
Start with the base case of 0 coins required for amount 0, then iterate through each coin type to calculate the minimum coins required for each amount.
Choose the minimum of the ...
Return the next lexicographically greater permutation of a given sequence or return it in ascending order if not possible.
Use the concept of lexicographic ordering to find the next permutation.
If the sequence is already in descending order, return it in ascending order.
Examples: ['a', 'b', 'c'] -> ['a', 'c', 'b'], ['3', '2', '1'] -> ['1', '2', '3']
Autocomplete feature for a search engine
1. Display suggestions as user types in the search bar
2. Suggestions should be based on popular searches or previous searches
3. Allow users to select a suggestion to complete their search
4. Update suggestions in real-time as the user continues typing
I applied via Approached by Company and was interviewed in May 2023. There were 7 interview rounds.
Experienced accountant with a strong track record in financial analysis, budgeting, and compliance, ready to contribute effectively.
Managed a team of 5 in preparing annual budgets, resulting in a 15% reduction in costs through strategic planning.
Implemented a new accounting software system that improved reporting efficiency by 30%, enhancing decision-making processes.
Conducted thorough audits that identified discrepanc...
Find all palindromic decompositions of a given string s.
Iterate through all possible substrings and check if they are palindromes.
Use backtracking to generate all possible decompositions.
Return the list of palindromic decompositions.
The minimum number of coins required to express a given amount of money is calculated using a dynamic programming approach.
Use dynamic programming to calculate the minimum number of coins required for each amount from 1 to the given amount.
Start with the base case of 0 coins required for amount 0, then iterate through each coin type to calculate the minimum coins required for each amount.
Choose the minimum of the curre...
Convert a set of integers to Roman numerals
Create a function that takes an integer array as input
Use a loop to iterate through each integer and convert it to Roman numeral
Implement a mapping of integers to Roman numerals for conversion
Return an array of strings containing the Roman numeral equivalents
Program to find lowest common ancestor of two nodes in a binary tree with unique values.
Start from the root and traverse the tree to find the paths from root to the two nodes.
Compare the paths to find the lowest common ancestor node.
Use recursion to traverse the tree efficiently.
Handle edge cases like if one of the nodes is the ancestor of the other.
Program to find longest consecutive sequence and length of longest path in a binary tree.
Traverse the binary tree using depth-first search (DFS)
Keep track of the current consecutive sequence length and the longest consecutive sequence found so far
Update the length of the longest path as you traverse the tree
Return the next lexicographically greater permutation of a given sequence or return it in ascending order if not possible.
Use the concept of lexicographic ordering to find the next permutation.
If the sequence is already in descending order, return it in ascending order.
Examples: ['a', 'b', 'c'] -> ['a', 'c', 'b'], ['3', '2', '1'] -> ['1', '2', '3']
Solve problems using a fixed amount of extra memory, focusing on in-place algorithms and efficient data manipulation.
Use in-place algorithms to modify data without extra space, e.g., reversing an array in place.
Utilize two-pointer technique for sorting or searching, e.g., finding pairs in a sorted array.
Perform operations directly on the input data structure, e.g., merging two sorted arrays without extra space.
Use sliding window technique to find minimum window in s containing all characters of t.
Use two pointers to create a window in s
Move the right pointer to expand the window until all characters of t are found
Move the left pointer to shrink the window while maintaining all characters of t
Update minimum window size as you iterate through s
Use a max heap to keep track of the K largest elements in a continuous stream of integers.
Create a max heap of size K to store the K largest elements.
For each new element in the stream, compare it with the root of the max heap. If it is larger, replace the root with the new element and heapify.
At any point, the root of the max heap will be the Kth largest element in the stream.
Design a home monitoring system for Comcast.
Include smart sensors for monitoring temperature, humidity, and motion
Integrate with smart devices like thermostats, cameras, and door locks
Provide real-time alerts and notifications to homeowners via mobile app
Allow remote access and control of home devices
Offer optional professional monitoring services for added security
Autocomplete feature for a search engine
1. Display suggestions as user types in the search bar
2. Suggestions should be based on popular searches or previous searches
3. Allow users to select a suggestion to complete their search
4. Update suggestions in real-time as the user continues typing
A customer relationship management platform for Comcast would focus on personalized customer interactions and efficient issue resolution.
Implement a centralized database to store customer information and interaction history.
Integrate communication channels such as phone, email, and chat for seamless customer support.
Utilize data analytics to track customer behavior and preferences for targeted marketing campaigns.
Autom...
A ticketing management system for a theatre to streamline ticket sales and seat allocation.
Create an online platform for customers to purchase tickets
Implement a seating chart to allow customers to select their seats
Include options for different ticket types (e.g. VIP, standard, student)
Generate electronic tickets for customers to present at the theatre entrance
Integrate payment processing for secure transactions
Understanding GST TDS journal entries is crucial for accurate accounting and compliance.
GST TDS (Tax Deducted at Source) is applicable on certain payments like professional fees.
When TDS is deducted, the journal entry is: Debit Expense Account, Credit TDS Payable.
Example: If a professional fee of ₹10,000 is paid with 10% TDS, the entry is: Debit Professional Fees ₹10,000, Credit TDS Payable ₹1,000.
When TDS is paid to t...
Receiving an amount requires a journal entry to reflect the increase in cash and the corresponding credit to the appropriate account.
Debit Cash/Bank Account: Increase in assets.
Credit Revenue/Sales Account: If the amount is income.
Credit Accounts Receivable: If it's a payment received from a customer.
Example: If $1,000 is received for services, debit Cash $1,000 and credit Revenue $1,000.
I applied via Naukri.com and was interviewed in Feb 2024. There was 1 interview round.
Section 194q is a TDS provision on payment made for purchase of goods.
Rate of Section 194q is 0.1% on purchase of goods exceeding Rs. 50 lakhs in a financial year.
It is applicable to individuals and HUFs who are not required to get their accounts audited under section 44AB.
The TDS under Section 194q is to be deducted at the time of credit of such sum to the account of the seller or at the time of payment, whichever is ...
What people are saying about Comcast
I applied via Walk-in and was interviewed before Nov 2020. There was 1 interview round.
I applied via Referral and was interviewed before Feb 2021. There were 2 interview rounds.
I applied via Approached by Company
I applied via LinkedIn and was interviewed before Jun 2023. There was 1 interview round.
I applied via Naukri.com and was interviewed in Apr 2024. There were 3 interview rounds.
Basic knowledge of the candidates
Program out put and input question
Giveing a situation and ask for the results
Some of the top questions asked at the Comcast Accountant interview -
based on 1 interview experience
Difficulty level
Duration
Development Engineer 2
172
salaries
| ₹10 L/yr - ₹16 L/yr |
Devops Engineer
137
salaries
| ₹5.1 L/yr - ₹21 L/yr |
Development Engineer 3
136
salaries
| ₹15 L/yr - ₹25.2 L/yr |
Development Engineer
134
salaries
| ₹6.5 L/yr - ₹22.4 L/yr |
Data Engineer
96
salaries
| ₹7.5 L/yr - ₹22 L/yr |
PVR Inox
Cinépolis
HT Media
Zee Entertainment Enterprises