Filter interviews by
I applied via Campus Placement and was interviewed in Jan 2023. There were 3 interview rounds.
There were three sections in the assessment. first was aptitude, the second was Technical MCQ and the Third was Programming (Level: Mid-tough)
Create a program to print a given pattern using inheritance
Create a base class with a method to print the pattern
Create a derived class that inherits from the base class and overrides the print method to print the specific pattern
Use the derived class to print the pattern
Top trending discussions
I applied via Approached by Company and was interviewed in Aug 2017. There were 5 interview rounds.
posted on 30 Jul 2021
posted on 18 Mar 2024
posted on 28 Dec 2022
I applied via Recruitment Consulltant and was interviewed before Dec 2021. There were 2 interview rounds.
I am an excellent problem solver with a keen interest in algorithm design and optimization.
I enjoy breaking down complex problems into smaller, more manageable components.
I have experience in developing efficient algorithms for data processing and analysis.
I am always looking for ways to optimize code and improve performance.
I am interested in exploring new technologies and frameworks to solve problems in innovative wa
I have knowledge in various programming languages, frameworks, and technologies.
Proficient in Java, Python, and C++
Experience with web development using HTML, CSS, and JavaScript
Familiarity with databases such as MySQL and MongoDB
Knowledge of software development methodologies like Agile and Scrum
Understanding of design patterns and object-oriented programming principles
I applied via LinkedIn and was interviewed before Feb 2022. There were 5 interview rounds.
Hacker rank codinv problems level medium
Reverse a linked list using recursion
Create a recursive function that takes the head of the linked list as input
Base case: if the head is null or the next node is null, return the head
Recursively call the function with the next node as input
Set the next node's next pointer to the current node
Set the current node's next pointer to null
Return the new head of the reversed linked list
To find max number in linked list using stack.
Create an empty stack.
Traverse the linked list and push each element onto the stack.
Pop elements from the stack and compare with max value.
Return the max value.
I applied via Naukri.com and was interviewed before Apr 2022. There were 3 interview rounds.
Aptitude relates questions... It was modratley difficult
Reverse a linked list using recursion
Create a recursive function that takes the head of the linked list as input
Base case: if the head is null or the next node is null, return the head
Recursively call the function with the next node as input
Set the next node's next pointer to the current node
Set the current node's next pointer to null
Return the new head of the reversed linked list
Mutex is a locking mechanism to ensure exclusive access to a shared resource, while semaphore is a signaling mechanism to control access to a shared resource.
Mutex allows only one thread to access the shared resource at a time, while semaphore can allow multiple threads to access the shared resource simultaneously.
Mutex is binary, meaning it has only two states - locked and unlocked, while semaphore can have multiple s...
posted on 11 Oct 2024
I applied via LinkedIn and was interviewed before Oct 2023. There was 1 interview round.
based on 1 interview
Interview experience
Software Developer
35
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Support Engineer
35
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Manager
28
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
27
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer
27
salaries
| ₹0 L/yr - ₹0 L/yr |
Honeywell Automation
Siemens
Bosch
Schneider Electric