Filter interviews by
Questions related to Data structures and OOPS
Implement a custom string class in C++ without using built-in string functions.
Define a class named 'MyString' with a private character array to hold the string data.
Implement a constructor to initialize the string from a C-style string.
Create a copy constructor for deep copying of string data.
Overload the '+' operator to concatenate two MyString objects.
Implement a method to find the length of the string without using...
To find the first repeating character in a string, we can use a hash set to track characters we've seen as we iterate through the string.
Initialize an empty hash set to store characters.
Iterate through each character in the string.
If a character is already in the set, it's the first repeating character.
If not, add the character to the set and continue.
Example: In 'abca', 'a' is the first repeating character.
Coding test on C and C++.
I applied via Campus Placement and was interviewed in May 2024. There were 3 interview rounds.
I was a basic aptitute and 2 coding questions
I was asked question based on dsa
Coding round was easy
I applied via Approached by Company and was interviewed in Mar 2023. There were 5 interview rounds.
Flutter coding test and some technical questions
Data structure concepts and design principles are essential for efficient storage and retrieval of data.
Understanding different data structures like arrays, linked lists, trees, graphs, etc.
Applying design principles like abstraction, encapsulation, modularity, and efficiency.
Choosing the right data structure based on the requirements of the problem.
Optimizing data structures for faster access and manipulation.
Examples...
I appeared for an interview before Jun 2024, where I was asked the following questions.
I applied via Company Website and was interviewed before Sep 2023. There was 1 interview round.
To find if there is a cycle in a linked list, left view of a tree, Comparator vs Comparable in Java, and internal implementation of Hashmap.
To find a cycle in a linked list, you can use Floyd's Tortoise and Hare algorithm.
To get the left view of a tree, you can perform a level order traversal and print the first node at each level.
Comparator in Java is used to compare objects based on custom criteria, while Comparable ...
Top trending discussions
based on 14 interview experiences
Difficulty level
Duration
based on 75 reviews
Rating in categories
Technical Lead
559
salaries
| ₹8.6 L/yr - ₹30.9 L/yr |
Software Engineer
549
salaries
| ₹6 L/yr - ₹23 L/yr |
Technical Specialist
495
salaries
| ₹9.9 L/yr - ₹32 L/yr |
R&D Engineer
462
salaries
| ₹7 L/yr - ₹28 L/yr |
Software Developer
273
salaries
| ₹8.7 L/yr - ₹28.7 L/yr |
Jio
Bharti Airtel
Vodafone Idea
Ericsson