Filter interviews by
I applied via Campus Placement and was interviewed before Nov 2023. There were 2 interview rounds.
Coding test on hackerrank
Top trending discussions
I appeared for an interview before Jan 2016.
I am excited to join Centurylink because of their reputation for innovation and commitment to customer satisfaction.
Centurylink has a strong focus on developing cutting-edge technology solutions
The company values customer feedback and strives to provide excellent service
I am impressed by Centurylink's dedication to diversity and inclusion in the workplace
Relocated to Noida for better career opportunities and growth.
Noida is a hub for IT companies and offers a lot of job opportunities in the software development field.
The city has a good work-life balance and a lower cost of living compared to other metropolitan cities.
I was also attracted to the diverse culture and the opportunity to work with people from different backgrounds.
I did my research and found that Noida has...
Yes, I am comfortable working in US shift.
I have prior experience working in US shift.
I am flexible with my work timings.
I understand the importance of meeting project deadlines.
I am willing to adjust my personal schedule to accommodate work requirements.
I appeared for an interview before Apr 2021.
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview round with questions on OOPS and OS mainly.
Little Endian and Big Endian refer to the order in which bytes are stored in computer memory.
Little Endian stores the least significant byte first, while Big Endian stores the most significant byte first.
Little Endian is commonly used in x86 architecture, while Big Endian is used in architectures like SPARC and PowerPC.
Endianness can affect data transmission between systems with different byte orders.
The volatile keyword in programming is used to indicate that a variable's value can be changed unexpectedly.
Volatile keyword is used in multithreaded programming to prevent compiler optimizations on variables that can be changed by other threads.
It tells the compiler not to cache the variable's value in a register, ensuring that every access is made to the variable's memory location.
Commonly used in embedded systems pr...
The kernel is the core component of an operating system that manages system resources and provides a bridge between software and hardware.
Manages system resources such as CPU, memory, and I/O devices
Provides a bridge between software applications and hardware components
Handles tasks such as process scheduling, memory management, and device drivers
Controls communication between hardware and software layers
Round duration - 30 minutes
Round difficulty - Easy
HR round with typical behavioral problems.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
posted on 2 Dec 2015
posted on 9 Dec 2021
I applied via Naukri.com and was interviewed before Dec 2020. There were 3 interview rounds.
Eager loading is a technique used in software development to load related data in advance to avoid multiple database queries.
Eager loading is used to optimize database queries and improve performance.
It loads all the required data in a single query instead of making multiple queries.
It is commonly used in Object-Relational Mapping (ORM) frameworks like Hibernate, Entity Framework, etc.
Eager loading can be used with var...
posted on 25 Sep 2024
To check if a linked list is a palindrome, compare the first half of the list with the reversed second half.
Traverse the linked list to find the middle node
Reverse the second half of the linked list
Compare the first half with the reversed second half to check for palindrome
Binary search and design a data-structure to do insert, delete and get random in O(1)
I appeared for an interview in Jun 2025, where I was asked the following questions.
To delete a node in a linked list when given a pointer to that node, copy the next node's data and adjust pointers.
1. Given a pointer to the node to be deleted, we cannot directly access the previous node.
2. Copy the data from the next node to the current node.
3. Adjust the current node's pointer to skip the next node.
4. Free the memory of the next node to avoid memory leaks.
Example: If deleting node with value 3 in 1 ...
based on 2 interview experiences
Difficulty level
Duration
based on 2 reviews
Rating in categories
Senior Software Engineer
28
salaries
| ₹20.1 L/yr - ₹34.2 L/yr |
Software Development Engineer II
22
salaries
| ₹16.1 L/yr - ₹26.8 L/yr |
Senior Software Development Engineer
20
salaries
| ₹19.8 L/yr - ₹35.7 L/yr |
Staff Engineer
18
salaries
| ₹27 L/yr - ₹40 L/yr |
Staff Software Engineer
17
salaries
| ₹29.8 L/yr - ₹53.8 L/yr |
Indus Towers
Sterlite Technologies
Cisco
BT Business