CommScope interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
CommScope
1 rounds | 2 Coding
problems
Selected Interview preparation journey
Journey
I cleared the gate exam in 2022 and got 369 ranks. Then, I joined IIT Madras for tech in CSE. Then, after one year, we had campus placement in college. During this time, I prepared for DSa and basic computer subjects.
Application story
This company came on campus. Applied on campus portal. After a few days, they conducted a test on the HackerEarth platform.
Why selected/rejected for the role?
I got selected for the role due to my ability to solve questions and my approach to problem-solving. I was confident throughout my interview and was honest in my answers.
Preparation
Duration: 5 months
Topics: DSA , OOP ,C++ , DBMS , Operating System
Tip 1: Solve the DSA sheet
Tip 2: After solving the sheet, try to solve random problems
Tip 3: Prepare computer fundamentals and aptitude
Application process
Where: Campus
Eligibility: 7+ CGPA
Tip 1: Have some good projects handy.
Tip 2: Do not lie in your resume. Prepare resume very well.
Interview rounds
01
Round
Easy
Video Call
Duration80 minutes
Interview date2 Dec 2023
Coding problem2
It was at 6.45 pm. The interviewer asked me about my introduction, and after that, he asked me how I rate myself in coding. He then asked me two coding questions. He asked me 1 question regarding the output of the given code. He also conducted an HR round on the same call. Asked me about my expectations and why I joined IIT.
1. Intersection of Two Linked Lists
Easy
25m average time
73% success
0/40
Asked in companies
You are given two Singly Linked Lists of integers, which may have an intersection point.
Your task is to return the first intersection node. If there is no intersection, return NULL.
Example:-
The Linked Lists, where a1, a2, c1, c2, c3 is the first linked list and b1, b2, b3, c1, c2, c3 is the second linked list, merging at node c1.
Problem approach
used 2 pointer method to solve this problem
2. Cycle Detection in a Singly Linked List
Moderate
15m average time
80% success
0/80
Asked in companies
You are given a Singly Linked List of integers. Return true if it has a cycle, else return false.
A cycle occurs when a node's next points back to a previous node in the list.
Example:
In the given linked list, there is a cycle, hence we return true.
Problem approach
using fast and slow pointer i solved this question
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
What is recursion?
Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
Selected 
4657 views
0 comments
0 upvotes
SDE - Intern
2 rounds | 3 problems
Interviewed by Amazon
Rejected
960 views
0 comments
0 upvotes
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
Rejected
6450 views
0 comments
0 upvotes
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
Selected 3452 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
Selected 114579 views
24 comments
0 upvotes
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
Selected 57825 views
5 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
Selected 34961 views
7 comments
0 upvotes