Filter interviews by
Clear (1)
Percentage, profit loss, logical reasoning
Its completely full of numerical problems
The coding test doesn't have enough time to complete it.Though the question was easy but the time given for it to complete it was very tough
Top trending discussions
posted on 20 Feb 2015
posted on 10 Sep 2020
I applied via Company Website and was interviewed in Aug 2020. There were 3 interview rounds.
Connecting to a database has multiple options depending on the type of database and programming language used.
For SQL databases, options include using JDBC for Java, ODBC for C++, and ADO.NET for C#.
For NoSQL databases, options include using MongoDB's driver for Python or Node.js.
ORMs like Hibernate and Entity Framework can also be used to abstract away the database connection details.
Connection strings are used to spe...
I applied via Naukri.com and was interviewed before Jun 2019. There were 3 interview rounds.
Implement stack data structure
Use an array or linked list to store elements
Push operation adds element to top of stack
Pop operation removes element from top of stack
Peek operation returns top element without removing it
Global variables are accessible from any part of the program and can be modified by any function.
Global variables are declared outside of any function.
They can be accessed and modified by any function in the program.
If a function modifies the value of a global variable, the new value is visible to all other functions.
Global variables can be useful for sharing data between functions.
However, overuse of global variables
Program to transpose a matrix
Iterate through rows and columns of the matrix
Swap the elements at (i,j) and (j,i) positions
Return the transposed matrix
Pre and post fix operators are used to increment or decrement a value before or after it is used in an expression.
Pre-fix operator (++x) increments the value of x and returns the new value.
Post-fix operator (x++) returns the value of x and then increments it.
Both operators can be used with variables of numeric data types.
They can also be used with pointers to increment or decrement the memory address they point to.
I applied via Company Website and was interviewed in Jun 2024. There were 2 interview rounds.
Tomarrow, power system
Machine power system drive
Prevent the duplicate accounts
30min and ask one coding question
30min and ask 2 coding question
I applied via Company Website and was interviewed in Nov 2024. There was 1 interview round.
A stack is a Last In First Out (LIFO) data structure, while a queue is a First In First Out (FIFO) data structure.
Stack: LIFO - Last In First Out. Example: browser history where the last page visited is the first to be accessed.
Queue: FIFO - First In First Out. Example: a line at a grocery store where the first person in line is the first to be served.
Function to find two numbers in array that add up to target. Optimize solution.
Use a hash map to store each number and its index as you iterate through the array.
For each number, check if the difference between the target and the number exists in the hash map.
Return the indices of the two numbers that add up to the target.
based on 2 interviews
Interview experience
Assistant Engineer
52
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Engineer
47
salaries
| ₹0 L/yr - ₹0 L/yr |
Engineer
44
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
43
salaries
| ₹0 L/yr - ₹0 L/yr |
Design Engineer
38
salaries
| ₹0 L/yr - ₹0 L/yr |
TKIL
McNally Bharat Engineering
TRF
Elecon Engineering