Filter interviews by
Clear (1)
I applied via Referral and was interviewed in Dec 2022. There were 3 interview rounds.
Joins in SQL are used to combine rows from two or more tables based on a related column between them.
Joins are used in SQL to retrieve data from multiple tables based on a related column
DDL (Data Definition Language) is used to define the structure of database objects like tables, views, etc.
DML (Data Manipulation Language) is used to manipulate data in the database like inserting, updating, deleting records
I applied via Referral and was interviewed in Nov 2022. There were 3 interview rounds.
I applied via Campus Placement and was interviewed in Feb 2021. There were 4 interview rounds.
I applied via Campus Placement and was interviewed before Dec 2020. There were 4 interview rounds.
SQL Joins are used to combine data from multiple tables. There are four types of SQL statements: SELECT, INSERT, UPDATE, and DELETE.
SQL Joins are used to combine data from two or more tables based on a related column between them.
The four types of SQL statements are SELECT, INSERT, UPDATE, and DELETE.
SELECT is used to retrieve data from one or more tables.
INSERT is used to add new data to a table.
UPDATE is used to modi...
Top trending discussions
I applied via Campus Placement and was interviewed before Oct 2023. There were 2 interview rounds.
Simple questions, easy to clear
I applied via Naukri.com and was interviewed in Jan 2021. There were 4 interview rounds.
I applied via Naukri.com and was interviewed before Sep 2021. There was 1 interview round.
I applied via Campus Placement and was interviewed in Nov 2020. There were 4 interview rounds.
posted on 11 Mar 2022
I was interviewed before Mar 2021.
Round duration - 60 minutes
Round difficulty - Medium
This test consisted of 10 questions with no negative marking to test my problem solving ability.
Round duration - 60 minutes
Round difficulty - Medium
Technical Interview round with questions based on DSA and algorithms.
Given a document represented as an array/list ARR
of words with length N
, find the smallest distance between two given words for multiple queries. The distance is defined as the ...
Find the smallest distance between two words in a document for multiple queries.
Iterate through the document to find the indices of the given words in the document array.
Calculate the distance between the two indices for each query.
Return the smallest distance or 'N' if a word from the query is not present in the document.
Given a 9 x 9 2D matrix 'MATRIX', where some cells are filled with digits (1-9) and others are empty (denoted by 0), determine if there is a way to fill the empty cells suc...
The task is to determine if a given 9x9 Sudoku puzzle can be solved.
Check if each row, column, and 3x3 subgrid contains all numbers from 1 to 9 without repetition.
Iterate through each empty cell and try filling it with a valid number, then recursively check if the puzzle can be solved.
If all empty cells are filled without violating Sudoku rules, output 'yes'; otherwise, output 'no'.
Round duration - 60 minutes
Round difficulty - Easy
You will be having 2 or 3 members per panel and questions may be from databases , object oriented programming, operating systems, Linux commands and algorithm may be asked for problems
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next
points back to a previous node in the ...
Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.
Traverse the linked list using two pointers, one moving at double the speed of the other
If the two pointers meet at any point, there is a cycle in the linked list
If one of the pointers reaches the end of the list (null), there is no cycle
Given a binary tree of integers, return the level order traversal of the binary tree.
The first line contains an integer 'T', representing the number of te...
The task is to implement a function that returns the level order traversal of a binary tree given in level order.
Create a queue to store nodes for level order traversal
Start with the root node and enqueue it
While the queue is not empty, dequeue a node, print its value, and enqueue its children
Repeat until all nodes are traversed
Virtual functions are functions in a base class that are overridden in derived classes, allowing for polymorphic behavior.
Virtual functions are declared in a base class with the 'virtual' keyword.
They are meant to be overridden in derived classes to provide specific implementations.
They allow for polymorphism, where a pointer to a base class can call a derived class's overridden function.
Example: virtual void display()
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.
based on 2 interviews
Interview experience
based on 40 reviews
Rating in categories
Software Engineer
1.1k
salaries
| ₹0 L/yr - ₹0 L/yr |
System Engineer
533
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
402
salaries
| ₹0 L/yr - ₹0 L/yr |
Automation Test Engineer
362
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer II
300
salaries
| ₹0 L/yr - ₹0 L/yr |
Siemens
Veradigm
McKesson
Siemens Healthineers