Filter interviews by
Clear (1)
I applied via Walk-in and was interviewed in May 2022. There were 2 interview rounds.
Convert Number to words
SOLID principles are a set of guidelines for writing maintainable and scalable code.
Single Responsibility Principle: A class should have only one reason to change.
Open/Closed Principle: A class should be open for extension but closed for modification.
Liskov Substitution Principle: Subtypes should be substitutable for their base types.
Interface Segregation Principle: Clients should not be forced to depend on interfaces ...
Top trending discussions
Formula to calculate number of squares that can fit inside a triangle
Calculate the area of the triangle and the area of the square
Divide the area of the triangle by the area of the square to get the number of squares that can fit inside the triangle
Formula: (h*b)/(a*a)
SVM is a machine learning algorithm used for classification and regression analysis.
SVM finds the best hyperplane that separates data into different classes.
It works by maximizing the margin between the hyperplane and the closest data points.
SVM can handle both linear and non-linear data using kernel functions.
It is widely used in image classification, text classification, and bioinformatics.
SVM has been shown to be ef...
Logistic regression is used for classification while linear regression is used for regression analysis.
Logistic regression predicts the probability of an event occurring, while linear regression predicts the value of a continuous variable.
Logistic regression uses a sigmoid function to map input values to a probability between 0 and 1.
Linear regression assumes a linear relationship between the independent and dependent ...
I was interviewed before Sep 2020.
Round duration - 60 minutes
Round difficulty - Medium
30 Aptitude problems and two coding questions
Given an integer array ARR
of size N
, your task is to find the total number of inversions that exist in the array.
An inversion is defined for a pair of integers in the...
Count the total number of inversions in an integer array.
Iterate through the array and for each pair of elements, check if the conditions for inversion are met.
Use a nested loop to compare each pair of elements efficiently.
Keep a count of the inversions found and return the total count at the end.
Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.
array = [34, -50, 42, 14, -5, 86]
Find the maximum sum of any contiguous subarray within an array of integers.
Iterate through the array and keep track of the maximum sum of subarrays encountered so far.
At each index, decide whether to include the current element in the subarray or start a new subarray.
Use Kadane's algorithm to solve the problem efficiently.
Example: For array [34, -50, 42, 14, -5, 86], the maximum subarray sum is 137.
Round duration - 90 minutes
Round difficulty - Medium
Data structure and algorithms plus object oriented problems
You are given a sequence of numbers, ARR
. Your task is to return a sorted sequence of ARR
in non-descending order using the Merge Sort algorithm.
The Merge Sort...
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
Divide the input array into two halves recursively until each array has only one element.
Merge the sorted halves to produce a completely sorted array.
Time complexity of Merge Sort is O(n log n).
Example: Input: [3, 1, 4, 1, 5], Output: [1, 1, 3, 4, 5]
Given a singly linked list of integers and a reference to a node, your task is to delete that specific node from the linked list. Each node in the linked li...
Given a singly linked list of integers and a reference to a node, delete the specified node from the linked list.
Traverse the linked list to find the node to be deleted
Update the pointers to skip over the node to be deleted
Print the modified linked list after deletion
Round duration - 60 miinutes
Round difficulty - Easy
Database questions and discussion about projects
Normal forms in database management systems help in organizing data to reduce redundancy and improve data integrity.
Normal forms are rules used to design relational database tables to minimize redundancy and dependency.
Boyce-Codd Normal Form (BCNF) is a stricter version of Third Normal Form (3NF) where every determinant is a candidate key.
BCNF helps in eliminating anomalies like insertion, update, and deletion anomalie...
WHILE is used in loops to repeatedly execute a block of code, while HAVING is used in SQL queries to filter results based on aggregate functions.
WHILE is used in programming languages like SQL to create loops for executing a block of code multiple times.
HAVING is used in SQL queries to filter results based on aggregate functions like SUM, COUNT, AVG, etc.
WHILE is used for iterative operations, while HAVING is used for
Tip 1 : Competitive Programming
Tip 2 : Do atleast 2 projects
Tip 1 : To be precise, mention your technical skills, achievements, dont write anything unnecessary plus write your professional summary good mention your project details in not more than 2 lines and make sure those sentences make sense to reader.
Tip 2 : Resume should be not more than one page. Write everything within one page
posted on 5 Jun 2024
I applied via Naukri.com and was interviewed in Dec 2023. There was 1 interview round.
posted on 31 May 2021
I applied via Company Website and was interviewed in May 2021. There were 4 interview rounds.
Multithreading in Java allows multiple threads to execute concurrently within a single program.
Java provides built-in support for multithreading through the java.lang.Thread class.
Threads can be created by extending the Thread class or implementing the Runnable interface.
Synchronization is used to prevent race conditions and ensure thread safety.
Java also provides several classes and interfaces for managing thread exec...
posted on 5 Sep 2022
I applied via Campus Placement and was interviewed in Aug 2022. There were 3 interview rounds.
Two Easy questions to be solved
Heap sort is a comparison-based sorting algorithm that uses a binary heap data structure.
Heap sort works by building a binary heap from the array and then repeatedly extracting the maximum element and placing it at the end of the array.
The heap is maintained as a complete binary tree, where each parent node is greater than or equal to its children.
The time complexity of heap sort is O(n log n) and it is an in-place sor...
posted on 31 Oct 2023
I applied via Campus Placement and was interviewed before Oct 2022. There were 4 interview rounds.
It was an MCQ based test. Code Snippets as well as OOPS, OS, DBMS questions were there
posted on 11 Sep 2024
I applied via Recruitment Consulltant and was interviewed before Sep 2023. There were 5 interview rounds.
IT was basic question from string and array
Use depth-first search to traverse the tree and identify leaf nodes.
Implement depth-first search algorithm to traverse the tree.
Identify nodes with no children as leaf nodes.
Store leaf nodes in an array for retrieval.
Reverse each word in a sentence without using default function.
Split the sentence into words
Iterate through each word and reverse it
Join the reversed words back into a sentence
Fibonacci series using recursion is a classic programming problem where each number is the sum of the two preceding ones.
Define a recursive function that takes an integer n as input
Base case: if n is 0 or 1, return n
Recursive case: return the sum of the previous two Fibonacci numbers
Call the function recursively with n-1 and n-2 until base case is reached
Find 1st, 2nd, and 3rd highest integers from an array.
Sort the array in descending order.
Retrieve the first three elements from the sorted array.
Handle cases where array length is less than 3.
based on 17 reviews
Rating in categories
Software Developer
226
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
159
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Systems Engineer
106
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
71
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Developer
51
salaries
| ₹0 L/yr - ₹0 L/yr |
GE Healthcare
Philips
Siemens Healthineers
Toshiba Medical Systems