i
Ericsson
Work with us
Proud winner of ABECA 2025 - AmbitionBox Employee Choice Awards
Filter interviews by
I appeared for an interview in Apr 2025, where I was asked the following questions.
I am excited to join this company for its innovative projects, collaborative culture, and opportunities for professional growth.
The company's commitment to cutting-edge technology aligns with my passion for innovation, as seen in your recent AI-driven project.
I admire the collaborative culture here, which fosters teamwork and knowledge sharing, evident from your employee testimonials.
The opportunities for professional ...
Java is a high-level, object-oriented programming language designed for portability, performance, and ease of use.
Platform-independent: Write once, run anywhere (WORA) - Java code can run on any device with a Java Virtual Machine (JVM).
Object-oriented: Supports concepts like inheritance, encapsulation, and polymorphism, making code reusable and modular.
Rich API: Provides a vast set of libraries for tasks like networkin...
Encapsulation is a fundamental OOP concept that restricts direct access to an object's data and methods.
Encapsulation combines data and methods into a single unit called a class.
It restricts access to the internal state of an object using access modifiers (private, protected, public).
Example: A class 'BankAccount' may have private fields like 'balance' and public methods like 'deposit()' and 'withdraw()' to manipulate ...
Java is a statically typed, compiled language, while Python is dynamically typed and interpreted, affecting their syntax and performance.
Java requires explicit declaration of variable types (e.g., int x = 5;), while Python infers types (e.g., x = 5).
Java uses a class-based object-oriented model, whereas Python supports multiple programming paradigms, including procedural and functional.
Java code is compiled into byteco...
I applied via Naukri.com and was interviewed before Nov 2022. There were 3 interview rounds.
I applied via Campus Placement and was interviewed before Mar 2023. There were 4 interview rounds.
Online aptitude test only 30 -45
Questions
2 -3 coding question
Top trending discussions
Bubble sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.
Bubble sort has a worst-case and average complexity of O(n^2), where n is the number of items being sorted.
It is not efficient for large lists and is generally used for educational purposes.
Example: Sorting an array of strings in alphabetical order using bubble sort.
Auto and static are two storage classes in C. Auto variables are local to a function while static variables retain their value between function calls.
Auto variables are created when a function is called and destroyed when the function ends
Static variables are initialized only once and retain their value between function calls
Auto variables have garbage value if not initialized while static variables are initialized to ...
Yes, I am open to relocation for the right opportunity.
I am willing to relocate for the right job opportunity
I am open to exploring new cities and cultures
I am willing to consider relocation assistance
I am excited about the prospect of working in a new environment
UDP is used in scenarios where speed is more important than reliability, such as online gaming and video streaming.
UDP is a connectionless protocol that does not guarantee delivery of packets
It is faster than TCP because it does not have to establish a connection before sending data
UDP is commonly used in online gaming, video streaming, and VoIP applications
It is also used for broadcasting and multicasting data to mult...
I applied via Campus Placement and was interviewed before Apr 2020. There was 1 interview round.
I appeared for an interview in Oct 2020.
Round duration - 90 minutes (60 minutes for coding and 30 minutes for MCQs)
Round difficulty - Medium
The test was conducted in the evening from 7:00 pm to 8:30 pm. Because of the covid situation, the test was online and was given by all the students from their home.
Login window of 15 minutes was given and all students were supposed to login within initial 15 minutes (between 7:00 and 7:15 pm). The test was conducted on AMCAT and webcam was on during the whole test duration.
There were two sections in the test: 1.) Coding round with 2 coding questions - 60 minutes (2.) MCQ round with 30 MCQs - 30 minutes
120 students appeared for this round and 20 were shortlisted for further process.
You are given a string 'S' of length 'N'. Your task is to find the frequency of each character from 'a' to 'z' in the string.
S : abcdg
1...
Given a string, find the frequency of each character from 'a' to 'z' in the string.
Create an array of size 26 to store the frequency of each character from 'a' to 'z'.
Iterate through the string and increment the count of the corresponding character in the array.
Print the array of frequencies as the output for each test case.
You are given two strings 'A' and 'B'. While string 'A' is constant, you may apply any number of left shift operations to string 'B'.
Your task is to calcu...
Calculate the minimum number of left shift operations needed to achieve the longest common prefix between two strings.
Apply left shift operations to string B to find the longest common prefix with string A
Count the number of left shifts needed to achieve the longest common prefix
Return the minimum number of left shift operations for each test case
Round duration - 50-60 minutes
Round difficulty - Medium
This round started at 11 am and went till 3 pm.
Out of 120 students that appeared in online coding test, 20 were shortlisted for the first round of interviews.
In this round, everyone was asked some moderate level coding questions. We were supposed to write the code in our IDE, present the screen and show the interviewer the output of our code.
The interview started with the introduction being followed by 2 coding problems.
Ninja enjoys working with numbers, and as a birthday challenge, his friend provides him with an array consisting of both positive and negative integers. Ninja is curious to ...
Find the length of the longest subarray with zero sum in an array of integers.
Iterate through the array and keep track of the running sum using a hashmap.
If the running sum is seen before, the subarray between the current index and the previous index with the same sum is a subarray with zero sum.
Update the length of the longest subarray with zero sum as you iterate through the array.
Example: For arr1 = [1, -1, 3, 2, -2...
Round duration - 20 minutes
Round difficulty - Medium
7 students were shortlisted for the HR round. This round started at 7:30 pm and went till 8:30 pm.
Like all the other rounds, this round too was virtual (on google meet). In the beginning, the interviewer introduced himself and then asked questions based on my resume.
All the 7 candidates were selected in the HR round.
Tip 1 : Questions are asked on DSA, so practice questions and it is not the number of questions you practice, but how well you practice the questions. Prepare a notebook and write down the approach you follow. Make proper notes and maintain that notebook. Will help for quick revision.
Tip 2 : Conceptual questions are asked from topics other than DSA. So watching videos on youtube will not help. Read the book thoroughly to make yourself ready for interviews.
Tip 3 : ALWAYS read about the real-life examples of the concepts you read. This is often asked in interviews and you will definitely regret failing to answer this question.
Tip 1 : Having projects in resume will help you to give the direction to your interview, which increases the chances of selection.
Tip 2 : Add some achievements other than academics, it shows that you are a team player and increases the probability of getting shortlisted. BUT do not write anything that is not true or else, it will backfire.
I applied via Campus Placement and was interviewed before Aug 2021. There were 2 interview rounds.
Mcq based on language
STL knowledge and finding loop in linked list
STL (Standard Template Library) is a C++ library that provides containers, algorithms, and iterators.
To find a loop in a linked list, we can use Floyd's cycle-finding algorithm.
In this algorithm, we use two pointers, one moving at a slower pace and the other at a faster pace.
If there is a loop in the linked list, the faster pointer will eventually catch up to the slower poin...
I applied via Campus Placement and was interviewed before Oct 2023. There were 3 interview rounds.
Aptitude tests with all basis covered
Linked list related Questions
To explore new opportunities, gain new experiences, or be closer to family.
Exploring new opportunities in a different location
Gaining new experiences and exposure in a different environment
Being closer to family or loved ones
Seeking a better quality of life in a different location
based on 3 interview experiences
Difficulty level
Duration
based on 14 reviews
Rating in categories
Senior Solution Integrator
2.4k
salaries
| ₹12 L/yr - ₹20.9 L/yr |
Solution Architect
2.3k
salaries
| ₹20 L/yr - ₹34.8 L/yr |
Senior Engineer
2.2k
salaries
| ₹9.8 L/yr - ₹17 L/yr |
Network Engineer
1.8k
salaries
| ₹3.3 L/yr - ₹8 L/yr |
Solution Integrator
1.7k
salaries
| ₹5.1 L/yr - ₹12 L/yr |
Jio
Vodafone Idea
Bharti Airtel
Tata Communications