Filter interviews by
I applied via Company Website and was interviewed in Jul 2023. There were 2 interview rounds.
I was given 3 C++ code submission of DSA questions, but it had errors in syntax and logic. My task was to find as many errors as possible in the code and provide correct solution to the question. They asked me to provide video solution.
Constructors are special member functions in a class used to initialize objects. Copy constructors create a new object as a copy of an existing object.
Types of constructors: Default constructor, Parameterized constructor, Copy constructor, and Destructor
Types of copy constructors: Shallow copy constructor and Deep copy constructor
Shallow copy constructor copies the values of the members of one object to another object....
Smart pointers are objects that manage the memory of dynamically allocated objects in C++ to prevent memory leaks.
Smart pointers automatically delete the object they point to when they are no longer needed.
Examples include unique_ptr, shared_ptr, and weak_ptr in C++.
They help in preventing memory leaks and dangling pointers.
Smart pointers provide better memory management compared to raw pointers.
Diamond Problem occurs in multiple inheritance when a class inherits from two classes that have a common base class.
Diamond Problem arises when a class inherits from two classes that have a common base class.
Ambiguity arises in accessing the common base class members.
To solve Diamond Problem, virtual inheritance is used to ensure only one copy of the common base class is inherited.
Virtual functions in C++ allow for dynamic polymorphism by enabling a function to be overridden in a derived class.
Virtual functions are used in C++ to achieve runtime polymorphism, where the function to be called is determined at runtime based on the object's type.
They are needed to enable a base class pointer to call a function that is overridden in a derived class.
Virtual functions help in achieving the Open/Closed ...
To find the middle of a linked list, use two pointers - one moving at double the speed of the other.
Initialize two pointers, slow and fast, both pointing to the head of the linked list.
Move the slow pointer by one node and the fast pointer by two nodes in each iteration.
When the fast pointer reaches the end of the list, the slow pointer will be at the middle node.
The Travelling Salesman Problem is a classic optimization problem where a salesman needs to visit a set of cities exactly once and return to the starting city with the shortest possible route.
The goal is to find the shortest possible route that visits each city exactly once and returns to the starting city.
This problem is NP-hard, meaning there is no known efficient algorithm to solve it for large numbers of cities.
One...
I applied via Job Portal and was interviewed in Oct 2023. There were 2 interview rounds.
Selenium, java, Manual Testing
I applied via Campus Placement and was interviewed before Jul 2020. There were 4 interview rounds.
The project involved designing and implementing a new network infrastructure for a large corporation.
Conducted a thorough analysis of the existing network infrastructure
Designed a new network architecture that met the company's needs
Implemented the new network infrastructure with minimal disruption to business operations
Tested and optimized the new network to ensure optimal performance
Provided ongoing support and maint
I applied via Walk-in and was interviewed before Feb 2020. There were 4 interview rounds.
I applied via Naukri.com and was interviewed in Jul 2020. There were 3 interview rounds.
I applied via Campus Placement and was interviewed before Jun 2020. There were 3 interview rounds.
I applied via Referral and was interviewed before Jun 2020. There were 5 interview rounds.
I applied via Naukri.com and was interviewed before Nov 2020. There were 3 interview rounds.
I appeared for an interview before Jun 2021.
Round duration - 180 minutes
Round difficulty - Easy
It was an mcq + coding round. There were aptitude and ouput based question in mcq. And coding questions were easy
Given an integer array 'ARR' of size 'N' containing numbers from 0 to (N - 2). Each number appears at least once, and there is one number that appears twice. Yo...
Find the duplicate number in an array of integers from 0 to (N-2).
Iterate through the array and keep track of the frequency of each number using a hashmap.
Return the number with a frequency greater than 1 as the duplicate number.
Time complexity can be optimized to O(N) using Floyd's Tortoise and Hare algorithm.
You are provided with a string S
and an array of integers A
of size M
. Your task is to perform M
operations on the string as specified by the indices in array A
...
Given a string and an array of indices, reverse substrings based on the indices to obtain the final string.
Iterate through the array of indices and reverse the substrings accordingly
Ensure the range specified by each index is non-empty
Return the final string after all operations are completed
Round duration - 60 Minutes
Round difficulty - Easy
It was technical + hr round. there were 2 people as interviewer. They stated from intro and asked some basic puzzles and hr questions. After that they asked about my projects, technologies and some ds algo and dbms questions.
Tip 1 : Practice aptitude
Tip 2 : Focus on practicing coding
Tip 3 : Learn from mistakes
Tip 1 : Mention some projects that you have done
Tip 2 : Try to have skills that are required for the role
based on 3 interviews
Interview experience
2-8 Yrs
Not Disclosed
2-5 Yrs
Not Disclosed
2-6 Yrs
Not Disclosed
Software Developer
4
salaries
| ₹3 L/yr - ₹12.5 L/yr |
Game Designer
4
salaries
| ₹4.8 L/yr - ₹4.8 L/yr |
AM Human Resource
4
salaries
| ₹5.2 L/yr - ₹10 L/yr |
HR Manager
3
salaries
| ₹10 L/yr - ₹11 L/yr |
Backend Developer
3
salaries
| ₹5 L/yr - ₹6 L/yr |
upGrad
Simplilearn
Great Learning
Jigsaw Academy