Filter interviews by
I applied via Campus Placement and was interviewed in Oct 2023. There was 1 interview round.
I appeared for an interview before Jan 2016.
Seeking new challenges and growth opportunities.
I felt that I had reached a plateau in my role and was no longer being challenged.
I was interested in exploring new technologies and wanted to work on more innovative projects.
I wanted to work in a more collaborative and dynamic environment.
I left on good terms and have maintained positive relationships with my former colleagues.
I am excited to bring my skills and experie...
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 currently reside in New York City.
I live in an apartment in Manhattan.
My neighborhood is known for its diverse food options.
I have easy access to public transportation.
I enjoy exploring the city in my free time.
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.
Program to determine system's endianness
Check the endianness by storing a multi-byte integer and checking the byte order
Use bitwise operations to extract the least significant byte
If the least significant byte is at the lowest memory address, it's little-endian
If the least significant byte is at the highest memory address, it's big-endian
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...
Function pointers in C are used to store the address of functions, allowing for dynamic function calls and callbacks.
Function pointers can be used to implement callbacks in event-driven programming.
They can be used to switch between different functions at runtime.
Function pointers are commonly used in implementing data structures like function pointers in an array of function pointers.
Example: void (*funcPtr)(int) = &a
Design a data structure for multi-threading
Use a thread-safe queue to manage tasks for each thread
Implement a lock or semaphore to control access to shared resources
Consider using condition variables for synchronization
Use atomic operations for shared variables to prevent race conditions
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
A storage class in programming defines the scope and lifetime of variables.
Storage classes include auto, register, static, and extern.
Auto variables are created when a function is called and destroyed when the function ends.
Register variables are stored in CPU registers for faster access.
Static variables retain their value between function calls.
Extern variables are declared outside of any function and can be accessed
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.
I appeared for an interview before Jan 2021.
Round duration - 70 Minutes
Round difficulty - Medium
This was an Online Coding+MCQ round where we had a total of 50 MCQ questions and 1 coding problem. The coding problem was of easy to medium level but was a bit implementation heavy.
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key)
- Return the value of the key if it exists in the cache; otherw...
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.
Implement a doubly linked list to maintain the order of recently used keys.
Use a hashmap to store key-value pairs for quick access.
When capacity is reached, evict the least recently used item before inserting a new item.
Update the position of a key in the linked list whenever it is accessed or updated.
H...
Round duration - 60 Minutes
Round difficulty - Medium
This round had 1 coding question in which I was first required to explain my approach and then discuss the time and space complexities. After this , some basic questions from OOPS and Java were asked.
For a given singly linked list, identify if a loop exists and remove it, adjusting the linked list in place. Return the modified linked list.
A...
Detect and remove loop in a singly linked list in place with O(n) time complexity and O(1) space complexity.
Use Floyd's Cycle Detection Algorithm to identify the loop in the linked list.
Once the loop is detected, use two pointers to find the start of the loop.
Adjust the pointers to remove the loop and return the modified linked list.
ArrayList is implemented using a dynamic array while LinkedList is implemented using a doubly linked list.
ArrayList provides fast random access but slow insertion and deletion operations.
LinkedList provides fast insertion and deletion operations but slow random access.
Example: ArrayList is suitable for scenarios where frequent access and traversal of elements is required, while LinkedList is suitable for scenarios wher...
Abstraction focuses on hiding implementation details, while inheritance allows a class to inherit properties and behavior from another class.
Abstraction is the concept of hiding the complex implementation details and showing only the necessary features of an object.
Inheritance is a mechanism where a new class inherits properties and behavior from an existing class.
Abstraction is achieved through interfaces and abstract...
Round duration - 60 Minutes
Round difficulty - Medium
This round had questions from OS and OOPS. The interviewer also tested my problem solving skills by asking me some puzzles in the end.
Piping in Unix/Linux allows the output of one command to be used as the input for another command.
Piping is done using the | symbol
Multiple commands can be piped together
Piping allows for the creation of complex command chains
Example: ls -l | grep txt
A static variable in C is a variable that retains its value between function calls.
Static variables are declared using the 'static' keyword.
They are initialized only once and retain their value throughout the program's execution.
Static variables have a default value of 0 if not explicitly initialized.
They are stored in the data segment of the program's memory.
Example: static int count = 0; declares a static variable 'c
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.
I appeared for an interview before May 2021.
Round duration - 60 Minutes
Round difficulty - Medium
Timing: Morning
How was the environment? It happened in the Computer Lab of my institution
All students were assigned a computer and we had to solve questions on hackerrank
Consider 'N' individuals numbered from 0 to N-1 standing in a queue. You are provided with two arrays: Height
and Infront
, each consisting of 'N' non-negative int...
The task is to find the actual order of people in a queue based on their heights and the number of taller people in front of them.
Iterate through the given arrays and create a list of tuples containing the height and number of taller people for each person.
Sort the list of tuples in descending order of height and ascending order of the number of taller people.
Create an empty result list and insert each tuple into the r...
Round duration - 60 Minutes
Round difficulty - Medium
Round was a mix of concepts from OOPS, OS and Problem Solving
Given a Binary Search Tree (BST) and a key value 'X', determine if there exists a node within the BST containing the value 'X'.
Consider the tree represe...
The task is to find if a given value is present in a Binary Search Tree (BST).
Start from the root node and compare the value with the target value.
If the value matches, return true.
If the target value is less than the current node value, move to the left child.
If the target value is greater than the current node value, move to the right child.
Repeat the process until a match is found or a leaf node is reached.
If a leaf...
Tip 1 : Try to code the data structures that you have learned to understand things better
Tip 2 : Try to solve the problem even if it is the worst possible solution you think and then try to optimize don't jump to get the
best possible solution
Tip 3 : Discuss things among peers it helps to improve the understanding, even try to teach someone anything new you learn, this is very helpful during the interviews as you will have habit of explaining things
Tip 1 : Try to be honest in the resume don't write something you don't know, most of the time it backfires.
Tip 2 : Try to make 2 good projects for cv and know about the challenges you can face on the project and think about how you can solve that challenge.
posted on 9 Dec 2021
I applied via Naukri.com and was interviewed before Dec 2020. There were 3 interview rounds.
OOPs concept stands for Object-Oriented Programming concepts which includes encapsulation, inheritance, polymorphism, and abstraction.
Encapsulation is the process of hiding the implementation details from the user.
Inheritance allows a class to inherit properties and methods from another class.
Polymorphism allows objects to take on multiple forms or behaviors.
Abstraction is the process of hiding unnecessary details from
Lazy loading is a technique used to defer the loading of non-critical resources until they are needed.
It improves page load time and performance.
It is commonly used for images, videos, and other media files.
It can be implemented using JavaScript libraries like LazyLoad or Intersection Observer API.
Lazy loading can also be used for modules and components in web applications.
It helps to reduce the initial load time of th
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...
I applied via Campus Placement and was interviewed in Apr 2023. There were 3 interview rounds.
Question based on Array and string medium level of leetcode
based on 1 interview
Interview experience
Staff Engineer
47
salaries
| ₹23.5 L/yr - ₹41.5 L/yr |
Senior Analyst
45
salaries
| ₹10.1 L/yr - ₹33.5 L/yr |
Senior Engineer
44
salaries
| ₹9.5 L/yr - ₹35 L/yr |
Engineer 1
21
salaries
| ₹8.4 L/yr - ₹12.2 L/yr |
L2 Engineer
21
salaries
| ₹10.9 L/yr - ₹20 L/yr |
Sterlite Technologies
Cisco
BT Business
Lumen Technologies